![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/7/70/Snake-in-the-box_and_Hamiltonian_path.svg/640px-Snake-in-the-box_and_Hamiltonian_path.svg.png&w=640&q=50)
Path (graph theory)
Sequence of edges which join a sequence of nodes on a given graph / From Wikipedia, the free encyclopedia
For the family of graphs known as paths, see Path graph.
In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct (and since the vertices are distinct, so are the edges). A directed path (sometimes called dipath[1]) in a directed graph 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.
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/7/70/Snake-in-the-box_and_Hamiltonian_path.svg/320px-Snake-in-the-box_and_Hamiltonian_path.svg.png)
Paths are fundamental concepts of graph theory, described in the introductory sections of most graph theory texts. See e.g. Bondy & Murty (1976), Gibbons (1985), or Diestel (2005). Korte et al. (1990) cover more advanced algorithmic topics concerning paths in graphs.