1.1 --- a/src/work/jacint/bug.cc	Fri Jan 07 08:40:13 2005 +0000
     1.2 +++ b/src/work/jacint/bug.cc	Fri Jan 07 08:50:38 2005 +0000
     1.3 @@ -44,12 +44,14 @@
     1.4      std::cout<<G.id(v)<<std::endl;
     1.5    }
     1.6  
     1.7 +  std::cout<<"Edges of node " << G.id(nodes[1])<<std::endl;
     1.8 +
     1.9    for( IncEdgeIt f(G,nodes[1]); f!=INVALID; ++f ) {
    1.10 -    std::cout<<"edges " << G.id(f)<< " : " << G.id(G.target(f))<<std::endl;
    1.11 +    std::cout<<"edge " << G.id(f)<< " goes to " << G.id(G.target(f))<<std::endl;
    1.12    }//ez a ket for ciklus meg lefut - bar hibas eleken iteral -, de a matching.h-s mar segfaultol
    1.13  
    1.14    for( IncEdgeIt f(G,nodes[1]); f!=INVALID; ++f ) {
    1.15 -    std::cout<<"edges " << G.id(f)<< " : " << G.id(G.target(f))<<std::endl;
    1.16 +    std::cout<<"edge " << G.id(f)<< " goes to " << G.id(G.target(f))<<std::endl;
    1.17    }
    1.18  
    1.19    MaxMatching<Graph> max_matching(G);