Noun
undirected path (plural undirected paths) (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.