diff -r 692948b894e8 -r 984723507b86 doc/quicktour.dox
--- a/doc/quicktour.dox	Fri Apr 01 08:28:51 2005 +0000
+++ b/doc/quicktour.dox	Fri Apr 01 08:47:40 2005 +0000
@@ -120,7 +120,7 @@
     std::cout << g.id(s) << std::endl;	
 \endcode
 
-See the whole program in \file dijkstra_demo.cc.
+See the whole program in \ref dijkstra_demo.cc.
 
 The first part of the code is self-explanatory: we build the graph and set the
 length values of the edges. Then we instantiate a member of the Dijkstra class