diff -r e667cd5c0886 -r 308150155bb5 lemon/graph_adaptor.h
--- a/lemon/graph_adaptor.h	Mon Jul 04 16:18:11 2005 +0000
+++ b/lemon/graph_adaptor.h	Mon Jul 04 16:27:54 2005 +0000
@@ -451,7 +451,7 @@
   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 the dimacs file \ref sub_graph_adaptor_demo.dim. 
+  graph, which is read from the dimacs file \c 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.