COIN-OR::LEMON - Graph Library

Changeset 1322:cfc26d103bcf in lemon-0.x for src/demo/lp_demo.cc


Ignore:
Timestamp:
04/08/05 08:34:34 (19 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1761
Message:

Demo prog that computes the max flow by LP

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/demo/lp_demo.cc

    r1309 r1322  
    3838    lp.setObj(ex);
    3939  }
    40 
     40  lp.max();
    4141  lp.solve();
    4242
    43   return 0;
     43  return lp.primalValue();
    4444}
    4545
     
    4949
    5050  ListGraph g;
    51   ListGraph::Node s=g.addNode();
    52   ListGraph::Node t=g.addNode();
     51  ListGraph::Node s;
     52  ListGraph::Node t;
     53 
    5354
    5455  ListGraph::EdgeMap<double> cap(g);
    5556 
    5657  GraphReader<ListGraph> reader(std::cin,g);
    57   reader.addEdgeMap("capacity",cap).run();
     58  reader.addNode("source",s).addNode("target",t)
     59    .addEdgeMap("capacity",cap).run();
    5860 
    59   maxFlow(g,cap,s,t);
     61  // std::ifstream file("../test/preflow_");
     62//   readDimacs(file, g, cap, s, t);
     63
     64  std::cout << "Max flow value = " << maxFlow(g,cap,s,t) << std::endl;
    6065
    6166}
Note: See TracChangeset for help on using the changeset viewer.