directed path


Also found in: Wikipedia.

directed path

[də¦rek·təd ′path]
(mathematics)
A sequence of vertices, v 1, v 2, … v n, in a directed graph such that there is an arc from vi to vi +1 for i = 1, 2, …, n-1. Also known as dipath.