Shortest Path

Home > Mathematics > Graph theory > Paths and cycles > Shortest Path

The shortest path between two vertices in a graph is the path with the minimum number of edges between them.