pub fn all_simple_paths<G>( graph: G, from: G::NodeId, to: G::NodeId, ) -> impl Iterator<Item = Vec<G::NodeId>>where G: NodeCount + IntoNeighborsDirected, G::NodeId: Eq + Hash,