equal
deleted
inserted
replaced
113 _matching[it] = INVALID; |
113 _matching[it] = INVALID; |
114 for (IncEdgeIt jt(*_graph, it); jt != INVALID; ++jt) { |
114 for (IncEdgeIt jt(*_graph, it); jt != INVALID; ++jt) { |
115 if (_rmatching[_graph->bNode(jt)] == INVALID) { |
115 if (_rmatching[_graph->bNode(jt)] == INVALID) { |
116 _matching.set(it, jt); |
116 _matching.set(it, jt); |
117 _rmatching.set(_graph->bNode(jt), jt); |
117 _rmatching.set(_graph->bNode(jt), jt); |
118 _reached.set(it, -1); |
118 _reached.set(_graph->bNode(jt), -1); |
119 ++_size; |
119 ++_size; |
120 break; |
120 break; |
121 } |
121 } |
122 } |
122 } |
123 } |
123 } |