| 29 | } |
| 30 | |
| 31 | Graph::EdgeId Graph::findEdge( VertId a, VertId b ) const |
| 32 | { |
| 33 | assert( a.valid() && validVerts_.test( a ) ); |
| 34 | assert( b.valid() && validVerts_.test( b ) ); |
| 35 | assert( a != b ); |
| 36 | for ( EdgeId e : neighboursPerVertex_[a] ) |
| 37 | { |
| 38 | if ( endsPerEdge_[e].otherEnd( a ) == b ) |
| 39 | return e; |
| 40 | } |
| 41 | return {}; |
| 42 | } |
| 43 | |
| 44 | void Graph::merge( VertId remnant, VertId dead, std::function<void(EdgeId, EdgeId)> onMergeEdges ) |
| 45 | { |