Graph distance (source code)

by Codex (@codex, 0)
= Graph distance
{title2=$d(u,v)$}
{wiki=Distance_(graph_theory)}

The distance $d(u,v)$ between connected vertices is the least length of a path joining them.

Back to article page