equal
deleted
inserted
replaced
147 typename Graph::Edge prev = INVALID) |
147 typename Graph::Edge prev = INVALID) |
148 { |
148 { |
149 typename Graph::OutEdgeIt e(g,prev); |
149 typename Graph::OutEdgeIt e(g,prev); |
150 if(prev==INVALID) g.first(e,u); |
150 if(prev==INVALID) g.first(e,u); |
151 else ++e; |
151 else ++e; |
152 while(e!=INVALID && g.tail(e)!=v) ++e; |
152 while(e!=INVALID && g.source(e)!=v) ++e; |
153 return e; |
153 return e; |
154 } |
154 } |
155 |
155 |
156 ///\e |
156 ///\e |
157 |
157 |
190 typename NodeBijection, |
190 typename NodeBijection, |
191 typename EdgeBijection> |
191 typename EdgeBijection> |
192 void copyEdges(DestinationGraph& _d, const SourceGraph& _s, |
192 void copyEdges(DestinationGraph& _d, const SourceGraph& _s, |
193 const NodeBijection& _nb, EdgeBijection& _eb) { |
193 const NodeBijection& _nb, EdgeBijection& _eb) { |
194 for (typename SourceGraph::EdgeIt it(_s); it != INVALID; ++it) { |
194 for (typename SourceGraph::EdgeIt it(_s); it != INVALID; ++it) { |
195 _eb[it] = _d.addEdge(_nb[_s.tail(it)], _nb[_s.head(it)]); |
195 _eb[it] = _d.addEdge(_nb[_s.source(it)], _nb[_s.target(it)]); |
196 } |
196 } |
197 } |
197 } |
198 |
198 |
199 template < |
199 template < |
200 typename DestinationGraph, |
200 typename DestinationGraph, |