# HG changeset patch
# User marci
# Date 1116280175 0
# Node ID f3717c08e2bea75f3a61f76d7d795ce061ead679
# Parent  c3d754f5e6312825d35212e8d33993528d3b2bfb
minor modifications

diff -r c3d754f5e631 -r f3717c08e2be src/lemon/graph_adaptor.h
--- a/src/lemon/graph_adaptor.h	Sat May 14 21:13:00 2005 +0000
+++ b/src/lemon/graph_adaptor.h	Mon May 16 21:49:35 2005 +0000
@@ -446,8 +446,13 @@
   only such edges is a shortest one. Thus we have to compute a maximum number 
   of edge-disjoint paths between \c s and \c t in the graph which has edge-set 
   all the tight edges. The computation will be demonstrated on the following 
-  graph, which is read from a dimacs file.
-  
+  graph, which is read from the dimacs file \ref sub_graph_adaptor_demo.dim. 
+  The full source code is available in \ref sub_graph_adaptor_demo.cc. 
+  If you are interested in more demo programs, you can use 
+  \ref dim_to_dot.cc to generate .dot files from dimacs files. 
+  The .dot file of the following figure of was generated generated by  
+  the demo program \ref dim_to_dot.cc.
+
   \dot
   digraph lemon_dot_example {
   node [ shape=ellipse, fontname=Helvetica, fontsize=10 ];