src/work/marci/bipartite_matching_try_3.cc
changeset 730 af375858f17c
parent 640 d426dca0aaf7
child 762 511200bdb71f
equal deleted inserted replaced
7:7faba7807f6c 8:b34079ccc01e
     1 // -*- c++ -*-
     1 // -*- c++ -*-
     2 #include <iostream>
     2 #include <iostream>
     3 #include <fstream>
     3 #include <fstream>
     4 #include <vector>
     4 #include <vector>
     5 
     5 
     6 #include <list_graph.h>
     6 #include <sage_graph.h>
     7 //#include <smart_graph.h>
     7 //#include <smart_graph.h>
     8 //#include <dimacs.h>
     8 //#include <dimacs.h>
     9 #include <hugo/time_measure.h>
     9 #include <hugo/time_measure.h>
    10 #include <hugo/for_each_macros.h>
    10 #include <hugo/for_each_macros.h>
    11 #include <bfs_dfs.h>
    11 #include <bfs_dfs.h>
    17 
    17 
    18 using namespace hugo;
    18 using namespace hugo;
    19 
    19 
    20 int main() {
    20 int main() {
    21   //typedef UndirListGraph Graph; 
    21   //typedef UndirListGraph Graph; 
    22   typedef BipartiteGraph<ListGraph> Graph;
    22   typedef BipartiteGraph<SageGraph> Graph;
    23   
    23   
    24   typedef Graph::Node Node;
    24   typedef Graph::Node Node;
    25   typedef Graph::NodeIt NodeIt;
    25   typedef Graph::NodeIt NodeIt;
    26   typedef Graph::Edge Edge;
    26   typedef Graph::Edge Edge;
    27   typedef Graph::EdgeIt EdgeIt;
    27   typedef Graph::EdgeIt EdgeIt;