# HG changeset patch
# User marci
# Date 1095347905 0
# Node ID 88e20db5410250e78fb9f6d152720c3aba85b175
# Parent  9bde6cd8e3da7c4e03134323995b8a3d9e507e11


diff -r 9bde6cd8e3da -r 88e20db54102 src/demo/sub_graph_wrapper_demo.cc
--- a/src/demo/sub_graph_wrapper_demo.cc	Thu Sep 16 15:05:10 2004 +0000
+++ b/src/demo/sub_graph_wrapper_demo.cc	Thu Sep 16 15:18:25 2004 +0000
@@ -2,7 +2,7 @@
 
 // Use a DIMACS max flow file as stdin.
 // sub_graph_wrapper_demo < dimacs_max_flow_file
-// This program computes a maximum number of disjoint shortest paths
+// This program computes a maximum number of edge-disjoint shortest paths
 // between s and t.
 
 #include <iostream>