1 // Copyright 2016 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
13 impl<'graph, G: DirectedGraph> DirectedGraph for &'graph G {
17 impl<'graph, G: WithNumNodes> WithNumNodes for &'graph G {
18 fn num_nodes(&self) -> usize {
23 impl<'graph, G: WithStartNode> WithStartNode for &'graph G {
24 fn start_node(&self) -> Self::Node {
29 impl<'graph, G: WithSuccessors> WithSuccessors for &'graph G {
30 fn successors<'iter>(&'iter self, node: Self::Node) -> <Self as GraphSuccessors<'iter>>::Iter {
31 (**self).successors(node)
35 impl<'graph, G: WithPredecessors> WithPredecessors for &'graph G {
36 fn predecessors<'iter>(&'iter self,
38 -> <Self as GraphPredecessors<'iter>>::Iter {
39 (**self).predecessors(node)
43 impl<'iter, 'graph, G: WithPredecessors> GraphPredecessors<'iter> for &'graph G {
45 type Iter = <G as GraphPredecessors<'iter>>::Iter;
48 impl<'iter, 'graph, G: WithSuccessors> GraphSuccessors<'iter> for &'graph G {
50 type Iter = <G as GraphSuccessors<'iter>>::Iter;