[Lemon-commits] [lemon_svn] jacint: r1455 - hugo/trunk/src/work/jacint

[Lemon SVN]

Author: jacint
Date: Fri Jan  7 09:50:38 2005
New Revision: 1455

Modified:
   hugo/trunk/src/work/jacint/bug.cc

Log:


Modified: hugo/trunk/src/work/jacint/bug.cc
==============================================================================
--- hugo/trunk/src/work/jacint/bug.cc	(original)
+++ hugo/trunk/src/work/jacint/bug.cc	Fri Jan  7 09:50:38 2005
@@ -44,12 +44,14 @@
     std::cout<<G.id(v)<<std::endl;
   }
 
+  std::cout<<"Edges of node " << G.id(nodes[1])<<std::endl;
+
   for( IncEdgeIt f(G,nodes[1]); f!=INVALID; ++f ) {
-    std::cout<<"edges " << G.id(f)<< " : " << G.id(G.target(f))<<std::endl;
+    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
 
   for( IncEdgeIt f(G,nodes[1]); f!=INVALID; ++f ) {
-    std::cout<<"edges " << G.id(f)<< " : " << G.id(G.target(f))<<std::endl;
+    std::cout<<"edge " << G.id(f)<< " goes to " << G.id(G.target(f))<<std::endl;
   }
 
   MaxMatching<Graph> max_matching(G);