directed path

Noun

(graph theory) In a directed graph, a path in which the edges are all oriented in the same direction.

Japanese Meaning

有向グラフにおいて、全ての辺が同じ方向に向いている経路。

定理を証明するために、私たちは頂点uから頂点vへの有向パスを構成し、すべての禁止された辺を回避しました。

Sense（1）

(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.

directed paths

（ plural ）