A PATH is a set of edges that specify a path between a given vertex and another. When the edges are combined, they combine to connect a given vertex to another vertex.

Mathematically, a path is defined as a sequence of vertices, V-0 thru V-k. There must be an edge between each vertex, in proper sequence, throughout the vertices.

The LENGTH of a path specifies how many edges are included in that path.

In the example, the path has LENGTH 3. Path={V0, V1, V2, V3}={A, E, C, H}

Choose topics to learn more about graph and graph algorithms

Back to AlgoNet Home