Noun
directed path (plural directed paths) (graph theory) In a directed graph, a path in which the edges are all oriented in the same direction. A path x→y→z is a directed path.