1.1 --- a/lemon/dimacs.h Thu Feb 02 17:09:09 2006 +0000
1.2 +++ b/lemon/dimacs.h Thu Feb 02 17:43:24 2006 +0000
1.3 @@ -44,9 +44,9 @@
1.4
1.5 /// This function reads a min cost flow instance from dimacs format,
1.6 /// i.e. from dimacs files having a line starting with
1.7 - /// \code
1.8 + ///\code
1.9 /// p "min"
1.10 - /// \endcode
1.11 + ///\endcode
1.12 /// At the beginning \c g is cleared by \c g.clear(). The edge
1.13 /// capacities are written to \c capacity, \c s and \c t are set to
1.14 /// the source and the target nodes resp. and the cost of the edges
1.15 @@ -124,9 +124,9 @@
1.16
1.17 /// This function reads a max flow instance from dimacs format,
1.18 /// i.e. from dimacs files having a line starting with
1.19 - /// \code
1.20 + ///\code
1.21 /// p "max"
1.22 - /// \endcode
1.23 + ///\endcode
1.24 ///At the beginning \c g is cleared by \c g.clear(). The
1.25 /// edge capacities are written to \c capacity and \c s and \c t are
1.26 /// set to the source and the target nodes.
1.27 @@ -144,9 +144,9 @@
1.28
1.29 /// This function reads a shortest path instance from dimacs format,
1.30 /// i.e. from dimacs files having a line starting with
1.31 - /// \code
1.32 + ///\code
1.33 /// p "sp"
1.34 - /// \endcode
1.35 + ///\endcode
1.36 /// At the beginning \c g is cleared by \c g.clear(). The edge
1.37 /// capacities are written to \c capacity and \c s is set to the
1.38 /// source node.
1.39 @@ -180,9 +180,9 @@
1.40 /// This function reads a graph without any designated nodes and
1.41 /// maps from dimacs format, i.e. from dimacs files having a line
1.42 /// starting with
1.43 - /// \code
1.44 + ///\code
1.45 /// p "mat"
1.46 - /// \endcode
1.47 + ///\endcode
1.48 /// At the beginning \c g is cleared
1.49 /// by \c g.clear().
1.50 ///