3 impl<'graph, G: DirectedGraph> DirectedGraph for &'graph G {
7 impl<'graph, G: WithNumNodes> WithNumNodes for &'graph G {
8 fn num_nodes(&self) -> usize {
13 impl<'graph, G: WithStartNode> WithStartNode for &'graph G {
14 fn start_node(&self) -> Self::Node {
19 impl<'graph, G: WithSuccessors> WithSuccessors for &'graph G {
20 fn successors<'iter>(&'iter self, node: Self::Node) -> <Self as GraphSuccessors<'iter>>::Iter {
21 (**self).successors(node)
25 impl<'graph, G: WithPredecessors> WithPredecessors for &'graph G {
26 fn predecessors<'iter>(&'iter self,
28 -> <Self as GraphPredecessors<'iter>>::Iter {
29 (**self).predecessors(node)
33 impl<'iter, 'graph, G: WithPredecessors> GraphPredecessors<'iter> for &'graph G {
35 type Iter = <G as GraphPredecessors<'iter>>::Iter;
38 impl<'iter, 'graph, G: WithSuccessors> GraphSuccessors<'iter> for &'graph G {
40 type Iter = <G as GraphSuccessors<'iter>>::Iter;