# HG changeset patch
# User athos
# Date 1121072071 0
# Node ID 955e8e83f6b15cbb653ddf67f8a00a997ebaebab
# Parent  a88ccf686a61322811f58f043f808bf28f6075f7
Typo.

diff -r a88ccf686a61 -r 955e8e83f6b1 demo/sub_graph_adaptor_demo.cc
--- a/demo/sub_graph_adaptor_demo.cc	Thu Jul 07 15:58:19 2005 +0000
+++ b/demo/sub_graph_adaptor_demo.cc	Mon Jul 11 08:54:31 2005 +0000
@@ -68,7 +68,7 @@
     preflow(gw, s, t, const_1_map, flow);
   preflow.run();
 
-  cout << "maximum number of edge-disjoint shortest path: " 
+  cout << "maximum number of edge-disjoint shortest paths: " 
        << preflow.flowValue() << endl;
   cout << "edges of the maximum number of edge-disjoint shortest s-t paths: " 
        << endl;