src/work/alpar/list_graph_demo.cc
changeset 641 bfd6c14e2975
parent 401 2d0cccf7cc94
child 880 9d0bfd35b97c
equal deleted inserted replaced
1:de45ba29be77 2:c9ccf3570100
   117       std::cout << G.id(G.tail(e)) << "->" << G.id(G.head(e))
   117       std::cout << G.id(G.tail(e)) << "->" << G.id(G.head(e))
   118 		<< ": id=" << G.id(e) << " oppid=" << G.id(G.opposite(e))
   118 		<< ": id=" << G.id(e) << " oppid=" << G.id(G.opposite(e))
   119 		<< " em=" << em[e]
   119 		<< " em=" << em[e]
   120 		<< " sm=" << sm[e] << "\n";
   120 		<< " sm=" << sm[e] << "\n";
   121     
   121     
       
   122     //Delete all nodes
       
   123     NodeIt n;
       
   124     while(G.valid(G.first(n))) G.erase(n);
   122   }
   125   }
   123 
   126 
   124   // Tests for NodeSet and EdgeSet
   127   // Tests for NodeSet and EdgeSet
   125   
   128   
   126   {
   129   {