COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
09/16/04 17:18:25 (20 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1171
Message:
 
File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/demo/sub_graph_wrapper_demo.cc

    r869 r871  
    33// Use a DIMACS max flow file as stdin.
    44// sub_graph_wrapper_demo < dimacs_max_flow_file
    5 // This program computes a maximum number of disjoint shortest paths
     5// This program computes a maximum number of edge-disjoint shortest paths
    66// between s and t.
    77
Note: See TracChangeset for help on using the changeset viewer.