# HG changeset patch
# User jacint
# Date 1105087838 0
# Node ID bd97feae7d90abc81ae225571e38729f1bdfeabc
# Parent  dddb01f98796b280c23618c98c31dc23e13fcb2d


diff -r dddb01f98796 -r bd97feae7d90 src/work/jacint/bug.cc
--- a/src/work/jacint/bug.cc	Fri Jan 07 08:40:13 2005 +0000
+++ b/src/work/jacint/bug.cc	Fri Jan 07 08:50:38 2005 +0000
@@ -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);