COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
07/11/05 10:54:31 (19 years ago)
Author:
athos
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2040
Message:

Typo.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • demo/sub_graph_adaptor_demo.cc

    r1435 r1544  
    6969  preflow.run();
    7070
    71   cout << "maximum number of edge-disjoint shortest path: "
     71  cout << "maximum number of edge-disjoint shortest paths: "
    7272       << preflow.flowValue() << endl;
    7373  cout << "edges of the maximum number of edge-disjoint shortest s-t paths: "
Note: See TracChangeset for help on using the changeset viewer.