# HG changeset patch
# User klao
# Date 1105123982 0
# Node ID 7a24bb2e748007e5bf6642cbcbb9aef473f5daf2
# Parent  bd97feae7d90abc81ae225571e38729f1bdfeabc
Nasty bug in undir_graph_extender.h

diff -r bd97feae7d90 -r 7a24bb2e7480 src/lemon/undir_graph_extender.h
--- a/src/lemon/undir_graph_extender.h	Fri Jan 07 08:50:38 2005 +0000
+++ b/src/lemon/undir_graph_extender.h	Fri Jan 07 18:53:02 2005 +0000
@@ -140,53 +140,55 @@
 
     template <typename E>
     void _dirFirstOut(E &e, const Node &n) const {
-      Parent::firstOut(e,n);
+      Parent::firstIn(e,n);
       if( UndirEdge(e) != INVALID ) {
-	e.forward = true;
+	e.forward = false;
       }
       else {
-	Parent::firstIn(e,n);
-	e.forward = false;
+	Parent::firstOut(e,n);
+	e.forward = true;
       }
     }
     template <typename E>
     void _dirFirstIn(E &e, const Node &n) const {
-      Parent::firstIn(e,n);
+      Parent::firstOut(e,n);
       if( UndirEdge(e) != INVALID ) {
-	e.forward = true;
+	e.forward = false;
       }
       else {
-	Parent::firstOut(e,n);
-	e.forward = false;
+	Parent::firstIn(e,n);
+	e.forward = true;
       }
     }
 
     template <typename E>
     void _dirNextOut(E &e) const {
-      if( e.forward ) {
+      if( ! e.forward ) {
+	Node n = Parent::target(e);
+	Parent::nextIn(e);
+	if( UndirEdge(e) == INVALID ) {
+	  Parent::firstOut(e, n);
+	  e.forward = true;
+	}
+      }
+      else {
+	Parent::nextOut(e);
+      }
+    }
+    template <typename E>
+    void _dirNextIn(E &e) const {
+      if( ! e.forward ) {
+	Node n = Parent::source(e);
 	Parent::nextOut(e);
 	if( UndirEdge(e) == INVALID ) {
-	  Parent::firstIn(e, Parent::source(e));
-	  e.forward = false;
+	  Parent::firstIn(e, n);
+	  e.forward = true;
 	}
       }
       else {
 	Parent::nextIn(e);
       }
     }
-    template <typename E>
-    void _dirNextIn(E &e) const {
-      if( e.forward ) {
-	Parent::nextIn(e);
-	if( UndirEdge(e) == INVALID ) {
-	  Parent::firstOut(e, Parent::target(e));
-	  e.forward = false;
-	}
-      }
-      else {
-	Parent::nextOut(e);
-      }
-    }
 
   public:
 
@@ -226,7 +228,7 @@
     }
 
 
-    int maxId(Node n) const {
+    int maxId(Node) const {
       return Parent::maxId(Node());
     }
 
diff -r bd97feae7d90 -r 7a24bb2e7480 src/work/jacint/bug.cc
--- a/src/work/jacint/bug.cc	Fri Jan 07 08:50:38 2005 +0000
+++ b/src/work/jacint/bug.cc	Fri Jan 07 18:53:02 2005 +0000
@@ -1,4 +1,3 @@
-//lasd megjegyzes a 49-es sorban
 #include <iostream>
 #include <queue>
 #include <vector>
@@ -6,23 +5,28 @@
 
 #include <lemon/invalid.h>
 #include <lemon/list_graph.h>
+#include <lemon/smart_graph.h>
 #include <matching.h>
 
 using namespace lemon;
+using namespace std;
 
-int main(int, char **) {
 
-  typedef UndirListGraph Graph;
+int main() {
+
+  typedef UndirSmartGraph Graph;
 
   typedef Graph::Edge Edge;
   typedef Graph::UndirEdgeIt UndirEdgeIt;
   typedef Graph::IncEdgeIt IncEdgeIt;
   typedef Graph::NodeIt NodeIt;
   typedef Graph::Node Node;
+
+  typedef Graph::OutEdgeIt OutEdgeIt;
    
   Graph G;
 
-  G.clear();
+  // G.clear();
   std::vector<Graph::Node> nodes;
   for (int i=0; i<5; ++i)
       nodes.push_back(G.addNode());
@@ -35,7 +39,8 @@
   G.addEdge(nodes[2], nodes[4]);
 
   for(UndirEdgeIt e(G); e!=INVALID; ++e) {
-    std::cout<<G.id(e)<<" : "<<G.id(G.source(e))<<" " <<G.id(G.target(e))<<std::endl;
+    std::cout<<G.id(e)<<" : "<<G.id(G.source(e))
+	     <<" " <<G.id(G.target(e))<<std::endl;
   }
 
   std::cout <<"Nodes:"<<std::endl;
@@ -44,11 +49,32 @@
     std::cout<<G.id(v)<<std::endl;
   }
 
+  cout << "Dev Out edges from node " << G.id(nodes[1])<<std::endl;
+  Edge f;
+  for(G.firstOut(f, nodes[1]); f!=INVALID; G.nextOut(f)) {
+    cout<<"edge " << G.id(f) << " goes"
+	     <<" from "<< G.id(G.source(f)) 
+	     << " to " << G.id(G.target(f))<<std::endl;
+  }
+
+  cout << "Out edges from node " << G.id(nodes[1])<<std::endl;
+  for( OutEdgeIt f(G,nodes[1]); f!=INVALID; ++f ) {
+    cout<<"edge " << G.id(f) << " goes"
+	     <<" from "<< G.id(G.source(f)) 
+	     << " to " << G.id(G.target(f))<<std::endl;
+  }
+
   std::cout<<"Edges of node " << G.id(nodes[1])<<std::endl;
+  for( IncEdgeIt f(G,nodes[1]); f!=INVALID; ++f ) {
+    cout<<"edge " << G.id(f) << " goes"
+	     <<" from "<< G.id(G.source(f)) 
+	     << " to " << G.id(G.target(f))<<std::endl;
+  }
 
-  for( IncEdgeIt f(G,nodes[1]); f!=INVALID; ++f ) {
-    std::cout<<"edge " << G.id(f)<< " goes to " << G.id(G.target(f))<<std::endl;
-  }//ez a ket for ciklus meg lefut - bar hibas eleken iteral -, de a matching.h-s mar segfaultol
+  //return 0;
+
+  //ez a ket for ciklus meg lefut - bar hibas eleken iteral -, de a
+  //matching.h-s mar segfaultol
 
   for( IncEdgeIt f(G,nodes[1]); f!=INVALID; ++f ) {
     std::cout<<"edge " << G.id(f)<< " goes to " << G.id(G.target(f))<<std::endl;