Function petgraph::algo::has_path_connecting
[−]
[src]
pub fn has_path_connecting<G>(g: G, from: G::NodeId, to: G::NodeId, space: Option<&mut DfsSpace<G::NodeId, G::Map>>) -> bool where G: IntoNeighbors + Visitable, G::NodeId: PartialEq[Generic] Check if there exists a path starting at from and reaching to.
from and to are equal, this function returns true.
If space is not None, it is reused instead of creating a temporary
workspace for graph traversal.