A directed path, also know as dipath, in a directed graph is a finite or infinite serial sequence of edges that join a progression of distinct vertices, but with the added requirement that the edges be all directed in the same direction.