In a connected graph or a connected component of a disconnected graph, we call the distance between two vertices the minimum number of edges of a chain going from one to the other.

Similarly, in a directed connected graph or a connected component of a directed disconnected graph, we call the distance between two vertices the minimum number of arcs in a path going from one to another.

### See also :

- Distance (or eccentricity) of a vertex of a graph
- Centre of a graph
- Radius of a graph
- Diameter of a graph