[Lemon-commits] [lemon_svn] marci: r1896 - hugo/trunk/src/lemon

[Lemon SVN]

Author: marci
Date: Mon May 16 23:49:35 2005
New Revision: 1896

Modified:
   hugo/trunk/src/lemon/graph_adaptor.h

Log:
minor modifications


Modified: hugo/trunk/src/lemon/graph_adaptor.h
==============================================================================
--- hugo/trunk/src/lemon/graph_adaptor.h	(original)
+++ hugo/trunk/src/lemon/graph_adaptor.h	Mon May 16 23:49:35 2005
@@ -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 ];