COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
03/17/04 16:09:48 (17 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@271
Message:

.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/marci/max_bipartite_matching_demo.cc

    r192 r194  
    5050  typedef Graph::InEdgeIt InEdgeIt;
    5151
    52   Node s, t;
     52  //Node s, t;
    5353  //Graph::EdgeMap<int> cap(G);
    5454  //readDimacsMaxFlow(std::cin, G, s, t, cap);
     
    6666    G.addEdge(s_nodes[random(20)], t_nodes[random(20)]);
    6767  }
    68   Graph::NodeMap<bool> s_map; //false
    69   Graph::NodeMap<bool> t_map; //false
     68  Graph::NodeMap<bool> s_map(G); //false
     69  Graph::NodeMap<bool> t_map(G); //false
    7070 
    7171  for(int i=0; i<20; ++i) {
     
    7777    std::cout << "on-the-fly max bipartite matching demo on wrapped leda graph..." << std::endl;
    7878    Graph::EdgeMap<int> flow(G); //0 flow
    79     Graph::EdgeMap<int> capacity(G, 1);
     79    Graph::EdgeMap<int> cap(G, 1);
    8080
    8181    Timer ts;
Note: See TracChangeset for help on using the changeset viewer.