diff -r e5c0c5cc477f -r 17eb3eaad9f8 lemon/dimacs.h
--- a/lemon/dimacs.h	Thu Feb 02 17:09:09 2006 +0000
+++ b/lemon/dimacs.h	Thu Feb 02 17:43:24 2006 +0000
@@ -44,9 +44,9 @@
 
   /// This function reads a min cost flow instance from dimacs format,
   /// i.e. from dimacs files having a line starting with
-  /// \code
+  ///\code
   /// p "min"
-  /// \endcode
+  ///\endcode
   /// At the beginning \c g is cleared by \c g.clear(). The edge
   /// capacities are written to \c capacity, \c s and \c t are set to
   /// the source and the target nodes resp. and the cost of the edges
@@ -124,9 +124,9 @@
 
   /// This function reads a max flow instance from dimacs format,
   /// i.e. from dimacs files having a line starting with
-  /// \code
+  ///\code
   /// p "max"
-  /// \endcode
+  ///\endcode
   ///At the beginning \c g is cleared by \c g.clear(). The
   /// edge capacities are written to \c capacity and \c s and \c t are
   /// set to the source and the target nodes.
@@ -144,9 +144,9 @@
 
   /// This function reads a shortest path instance from dimacs format,
   /// i.e. from dimacs files having a line starting with
-  /// \code
+  ///\code
   /// p "sp"
-  /// \endcode
+  ///\endcode
   /// At the beginning \c g is cleared by \c g.clear(). The edge
   /// capacities are written to \c capacity and \c s is set to the
   /// source node.
@@ -180,9 +180,9 @@
   /// This function reads a graph without any designated nodes and
   /// maps from dimacs format, i.e. from dimacs files having a line
   /// starting with
-  /// \code
+  ///\code
   /// p "mat"
-  /// \endcode
+  ///\endcode
   /// At the beginning \c g is cleared
   /// by \c g.clear().
   ///