pub fn has_path_connecting<G>(
g: G,
from: <G as GraphBase>::NodeId,
to: <G as GraphBase>::NodeId,
space: Option<&mut DfsSpace<<G as GraphBase>::NodeId, <G as Visitable>::Map>>
) -> boolwhere
G: IntoNeighbors + Visitable,
Expand description
[Generic] Check if there exists a path starting at from
and reaching to
.
If from
and to
are equal, this function returns true.
If space
is not None
, it is used instead of creating a new workspace for
graph traversal.