Graph distance ($d(u,v)$)

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