diff -r 43c7b3085212 -r b86aad11f842 doc/quicktour.dox
--- a/doc/quicktour.dox	Mon Jul 04 16:11:00 2005 +0000
+++ b/doc/quicktour.dox	Mon Jul 04 16:11:33 2005 +0000
@@ -38,7 +38,7 @@
 read a graph (and perhaps maps on it) from a stream (e.g. a file). Of course
 we also have routines that write a graph (and perhaps maps) to a stream
 (file): this will also be shown. LEMON supports the DIMACS file formats to
-store network optimization problems, but more importantly we also have our own
+read network optimization problems, but more importantly we also have our own
 file format that gives a more flexible way to store data related to network
 optimization.
 
@@ -86,9 +86,8 @@
 
 One can also store network (graph+capacity on the edges) instances and
 other things (minimum cost flow instances etc.) in DIMACS format and
-use these in LEMON: to see the details read the documentation of the
-\ref dimacs.h "Dimacs file format reader". There you will also find
-the details about the output routines into files of the DIMACS format.
+read these in LEMON: to see the details read the documentation of the
+\ref dimacs.h "Dimacs file format reader". 
 
 </ol>
 <li> If you want to solve some transportation problems in a network then