fn recursive_path_finder_no_coverage<T, U, Ix: IndexType>(
graph: &Graph<T, U, Directed, Ix>,
start_node: NodeIndex<Ix>,
end_node: NodeIndex<Ix>,
visited: &mut HashSet<NodeIndex<Ix>>
) -> Result<Vec<Vec<NodeIndex<Ix>>>>Expand description
A safer and more reliable alternative to recursive_path_finder_incl_coverage where
a HashSet determines whether a segment/node has already been seen or not.