diff -r 3996d2098090 -r 29961fa390a3 src/lemon/max_matching.h
--- a/src/lemon/max_matching.h	Sat Feb 19 21:11:20 2005 +0000
+++ b/src/lemon/max_matching.h	Sun Feb 20 01:02:07 2005 +0000
@@ -180,7 +180,7 @@
 	if ( todo[v] && _mate[v]!=INVALID ) {
 	  Node u=_mate[v];
 	  for(IncEdgeIt e(g,v); e!=INVALID; ++e) {
-	    if ( g.target(e) == u ) {
+	    if ( g.runningNode(e) == u ) {
 	      map.set(u,e);
 	      map.set(v,e);
 	      todo.set(u,false);
@@ -227,7 +227,7 @@
 	if ( todo[v] && _mate[v]!=INVALID ) {
 	  Node u=_mate[v];
 	  for(IncEdgeIt e(g,v); e!=INVALID; ++e) {
-	    if ( g.target(e) == u ) {
+	    if ( g.runningNode(e) == u ) {
 	      map.set(e,true);
 	      todo.set(u,false);
 	      todo.set(v,false);
@@ -332,7 +332,7 @@
       R.pop();
 	
       for( IncEdgeIt e(g,x); e!=INVALID ; ++e ) {
-	Node y=g.target(e);
+	Node y=g.runningNode(e);
 
 	if ( position[y] == D && blossom.find(x) != blossom.find(y) ) { 
 	  //x and y must be in the same tree
@@ -388,7 +388,7 @@
       Q.pop();
 	
       for( IncEdgeIt e(g,x); e!=INVALID; ++e ) {
-	Node y=g.target(e);
+	Node y=g.runningNode(e);
 	      
 	switch ( position[y] ) {
 	case D:          //x and y must be in the same tree
@@ -453,7 +453,7 @@
     for(NodeIt v(g); v!=INVALID; ++v)
       if ( _mate[v]==INVALID ) {
 	for( IncEdgeIt e(g,v); e!=INVALID ; ++e ) {
-	  Node y=g.target(e);
+	  Node y=g.runningNode(e);
 	  if ( _mate[y]==INVALID && y!=v ) {
 	    _mate.set(v,y);
 	    _mate.set(y,v);
@@ -484,7 +484,7 @@
   bool MaxMatching<Graph>::noShrinkStep(Node x, typename Graph::NodeMap<Node>& ear,  
 					UFE& blossom, UFE& tree, std::queue<Node>& Q) {
     for( IncEdgeIt e(g,x); e!= INVALID; ++e ) {
-      Node y=g.target(e);
+      Node y=g.runningNode(e);
 	
       if ( position[y]==C ) {
 	if ( _mate[y]!=INVALID ) {       //grow