Path (graph theory)
![A hypercube graph showing a Hamiltonian path in red, and a longest induced path in bold black.](/Images/godic/202501/09/Snake-in-the-box_and_Hamiltonian_path.svg3617.png")
In graph theory, a path in a graph is a finite or infinite sequence of edges which connect a sequence of vertices which, by most definitions, are all distinct from one another. In a directed graph, a directed path (sometimes called dipath) is again a sequence of edges (or arcs) which connect a sequence of vertices, but with the added restriction that the edges all be directed in the same direction.