In a graph GGG, the distance d(u,v)d(u, v)d(u,v) is defined as:
The length of the longest path between uuu and vvv
The length of the shortest path between uuu and vvv
The number of edges incident to uuu and vvv
The sum of degrees of uuu and vvv