src/work/marci/max_bipartite_matching_demo.cc
changeset 770 6387df9aadb0
parent 642 e812963087f0
equal deleted inserted replaced
6:8d21687b1005 7:373e4ab4c2ed
    68   int b;
    68   int b;
    69   cout << "number of nodes in the second color class=";
    69   cout << "number of nodes in the second color class=";
    70   cin >> b; 
    70   cin >> b; 
    71   int m;
    71   int m;
    72   cout << "number of edges=";
    72   cout << "number of edges=";
    73   cin >> m; 
    73   cin >> m;   
    74   
       
    75 
    74 
    76   for(int i=0; i<a; ++i) {
    75   for(int i=0; i<a; ++i) {
    77     s_nodes.push_back(G.addNode());
    76     s_nodes.push_back(G.addNode());
    78   }
    77   }
    79   for(int i=0; i<a; ++i) {
    78   for(int i=0; i<a; ++i) {