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