Directed Path

In a relevance diagram, a directed path from node N₁ to node N₂ is a connected path (or sequence) of one or more arrows—each traversed from its source node to its destination node—having N₁ as the first arrow's source node and N₂ as the last arrow’s destination node.

See also: indirect predecessor and indirect successor.