pub trait GraphQuery: Iterator {
    fn roots_for_graph<'a, G>(self, graph: &'a G) -> SubGraphs<'a, G>Notable traits for SubGraphs<'a, G>impl<'a, G> Iterator for SubGraphs<'a, G>where
    G: Graph,
type Item = NodeType<'a, G>;

    where
        G: Graph,
        Self: Iterator<Item = NodeType<'a, G>> + Sized
, { ... } }

Provided Methods

Consumes the iterator, used up nodes will be treated as root nodes in given graph

Implementors