1.1 --- a/src/demo/sub_graph_wrapper_demo.cc	Thu Sep 16 15:05:10 2004 +0000
     1.2 +++ b/src/demo/sub_graph_wrapper_demo.cc	Thu Sep 16 15:18:25 2004 +0000
     1.3 @@ -2,7 +2,7 @@
     1.4  
     1.5  // Use a DIMACS max flow file as stdin.
     1.6  // sub_graph_wrapper_demo < dimacs_max_flow_file
     1.7 -// This program computes a maximum number of disjoint shortest paths
     1.8 +// This program computes a maximum number of edge-disjoint shortest paths
     1.9  // between s and t.
    1.10  
    1.11  #include <iostream>