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.