Undirected-path definitions

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

A path x→y←z is an undirected path.

noun
0
0