equal
deleted
inserted
replaced
159 |
159 |
160 ///Reads a matching from an \c UndirEdge valued \c Node map. \c |
160 ///Reads a matching from an \c UndirEdge valued \c Node map. \c |
161 ///map[v] must be an \c UndirEdge incident to \c v. This map must |
161 ///map[v] must be an \c UndirEdge incident to \c v. This map must |
162 ///have the property that if \c g.oppositeNode(u,map[u])==v then |
162 ///have the property that if \c g.oppositeNode(u,map[u])==v then |
163 ///\c \c g.oppositeNode(v,map[v])==u holds, and now some edge |
163 ///\c \c g.oppositeNode(v,map[v])==u holds, and now some edge |
164 ///joining \c u to \v will be an edge of the matching. |
164 ///joining \c u to \c v will be an edge of the matching. |
165 template<typename NMapE> |
165 template<typename NMapE> |
166 void readNMapEdge(NMapE& map) { |
166 void readNMapEdge(NMapE& map) { |
167 for(NodeIt v(g); v!=INVALID; ++v) { |
167 for(NodeIt v(g); v!=INVALID; ++v) { |
168 UndirEdge e=map[v]; |
168 UndirEdge e=map[v]; |
169 if ( e!=INVALID ) |
169 if ( e!=INVALID ) |