equal
  deleted
  inserted
  replaced
  
    
    
     7   | 
     7   | 
     8 #include <list_graph.h>  | 
     8 #include <list_graph.h>  | 
     9 #include <smart_graph.h>  | 
     9 #include <smart_graph.h>  | 
    10 #include <bfs_iterator.h>  | 
    10 #include <bfs_iterator.h>  | 
    11 #include <graph_wrapper.h>  | 
    11 #include <graph_wrapper.h>  | 
    12 #include <leda_graph.h>  | 
    12 #include <leda_graph_wrapper.h>  | 
    13   | 
    13   | 
    14 using namespace hugo;  | 
    14 using namespace hugo;  | 
    15 using std::cout;   | 
    15 using std::cout;   | 
    16 using std::endl;  | 
    16 using std::endl;  | 
    17 using std::string;  | 
    17 using std::string;  | 
    33 { | 
    33 { | 
    34     | 
    34     | 
    35   | 
    35   | 
    36   //typedef SmartGraph Graph;  | 
    36   //typedef SmartGraph Graph;  | 
    37   //typedef ListGraph Graph;  | 
    37   //typedef ListGraph Graph;  | 
    38   typedef LedaGraph<leda::graph> Graph;  | 
    38   typedef LedaGraphWrapper<leda::graph> Graph;  | 
    39   | 
    39   | 
    40   typedef Graph::Node Node;  | 
    40   typedef Graph::Node Node;  | 
    41   typedef Graph::NodeIt NodeIt;    | 
    41   typedef Graph::NodeIt NodeIt;    | 
    42   typedef Graph::Edge Edge;  | 
    42   typedef Graph::Edge Edge;  | 
    43   typedef Graph::EdgeIt EdgeIt;  | 
    43   typedef Graph::EdgeIt EdgeIt;  |