1.1 --- a/demo/sub_graph_adaptor_demo.cc	Thu Jul 07 15:58:19 2005 +0000
     1.2 +++ b/demo/sub_graph_adaptor_demo.cc	Mon Jul 11 08:54:31 2005 +0000
     1.3 @@ -68,7 +68,7 @@
     1.4      preflow(gw, s, t, const_1_map, flow);
     1.5    preflow.run();
     1.6  
     1.7 -  cout << "maximum number of edge-disjoint shortest path: " 
     1.8 +  cout << "maximum number of edge-disjoint shortest paths: " 
     1.9         << preflow.flowValue() << endl;
    1.10    cout << "edges of the maximum number of edge-disjoint shortest s-t paths: " 
    1.11         << endl;