1.Previous
3.Next

is a finite or infinite sequence of edges which joins a sequence of distinct vertices, but with the added restriction that the edges be all directed in the same direction.

Paths are fundamental concepts of graph theory, described in the introductory sections of most graph theory texts. See e.g. , , or . cover more advanced algorithmic topics concerning paths in graphs.

Definitions

Walk, trail, and path

* A walk is a finite or infinite sequence

1.Previous
3.Next