1.1 --- a/lemon/graph_reader.h	Thu Feb 02 17:09:09 2006 +0000
     1.2 +++ b/lemon/graph_reader.h	Thu Feb 02 17:43:24 2006 +0000
     1.3 @@ -54,9 +54,9 @@
     1.4    /// whitespaces, therefore it has some extra possibilities to control how
     1.5    /// it should skip the values when the string representation contains spaces.
     1.6    ///
     1.7 -  /// \code
     1.8 +  ///\code
     1.9    /// GraphReader<ListGraph> reader(std::cin, graph);
    1.10 -  /// \endcode
    1.11 +  ///\endcode
    1.12    ///
    1.13    /// The \c readNodeMap() function reads a map from the \c \@nodeset section.
    1.14    /// If there is a map that you do not want to read from the file and there is
    1.15 @@ -64,31 +64,31 @@
    1.16    /// call the \c skipNodeMap() template member function with proper 
    1.17    /// parameters.
    1.18    ///
    1.19 -  /// \code
    1.20 +  ///\code
    1.21    /// reader.readNodeMap("coords", coords);
    1.22    ///
    1.23    /// reader.skipNodeMap("description", desc);
    1.24    ///
    1.25    /// reader.readNodeMap("color", colorMap);
    1.26 -  /// \endcode
    1.27 +  ///\endcode
    1.28    ///
    1.29    /// With the \c readEdgeMap() member function you can give an edge map
    1.30    /// reading command similar to the NodeMaps. 
    1.31    ///
    1.32 -  /// \code
    1.33 +  ///\code
    1.34    /// reader.readEdgeMap("weight", weightMap);
    1.35    /// reader.readEdgeMap("label", labelMap);
    1.36 -  /// \endcode
    1.37 +  ///\endcode
    1.38    ///
    1.39    /// With \c readNode() and \c readEdge() functions you can read 
    1.40    /// labeled Nodes and Edges.
    1.41    ///
    1.42 -  /// \code
    1.43 +  ///\code
    1.44    /// reader.readNode("source", sourceNode);
    1.45    /// reader.readNode("target", targetNode);
    1.46    ///
    1.47    /// reader.readEdge("observed", edge);
    1.48 -  /// \endcode
    1.49 +  ///\endcode
    1.50    ///
    1.51    /// With the \c readAttribute() functions you can read an attribute
    1.52    /// into a variable. You can specify the reader for the attribute as
    1.53 @@ -97,9 +97,9 @@
    1.54    /// After you give all read commands you must call the \c run() member
    1.55    /// function, which executes all the commands.
    1.56    ///
    1.57 -  /// \code
    1.58 +  ///\code
    1.59    /// reader.run();
    1.60 -  /// \endcode
    1.61 +  ///\endcode
    1.62    ///
    1.63    /// \see DefaultReaderTraits
    1.64    /// \see QuotedStringReader
    1.65 @@ -398,9 +398,9 @@
    1.66    /// whitespaces, therefore it has some extra possibilities to control how
    1.67    /// it should skip the values when the string representation contains spaces.
    1.68    ///
    1.69 -  /// \code
    1.70 +  ///\code
    1.71    /// UGraphReader<ListUGraph> reader(std::cin, graph);
    1.72 -  /// \endcode
    1.73 +  ///\endcode
    1.74    ///
    1.75    /// The \c readNodeMap() function reads a map from the \c \@nodeset section.
    1.76    /// If there is a map that you do not want to read from the file and there is
    1.77 @@ -408,39 +408,39 @@
    1.78    /// call the \c skipNodeMap() template member function with proper 
    1.79    /// parameters.
    1.80    ///
    1.81 -  /// \code
    1.82 +  ///\code
    1.83    /// reader.readNodeMap("coords", coords);
    1.84    ///
    1.85    /// reader.skipNodeMap("description", desc);
    1.86    ///
    1.87    /// reader.readNodeMap("color", colorMap);
    1.88 -  /// \endcode
    1.89 +  ///\endcode
    1.90    ///
    1.91    /// With the \c readUEdgeMap() member function you can give an 
    1.92    /// uedge map reading command similar to the NodeMaps. 
    1.93    ///
    1.94 -  /// \code
    1.95 +  ///\code
    1.96    /// reader.readUEdgeMap("capacity", capacityMap);
    1.97 -  /// \endcode
    1.98 +  ///\endcode
    1.99    ///
   1.100    /// The reading of the directed edge maps is just a syntactical sugar.
   1.101    /// It reads two undirected edgemaps into a directed edge map. The 
   1.102    /// undirected edge maps' name should be start with the \c '+' and the
   1.103    /// \c '-' character and the same.
   1.104    ///
   1.105 -  /// \code
   1.106 +  ///\code
   1.107    /// reader.readEdgeMap("flow", flowMap);
   1.108 -  /// \endcode 
   1.109 +  ///\endcode 
   1.110    ///
   1.111    /// With \c readNode() and \c readUEdge() functions you can read 
   1.112    /// labeled Nodes and UEdges.
   1.113    ///
   1.114 -  /// \code
   1.115 +  ///\code
   1.116    /// reader.readNode("source", sourceNode);
   1.117    /// reader.readNode("target", targetNode);
   1.118    ///
   1.119    /// reader.readUEdge("observed", uEdge);
   1.120 -  /// \endcode
   1.121 +  ///\endcode
   1.122    ///
   1.123    /// With the \c readAttribute() functions you can read an attribute
   1.124    /// in a variable. You can specify the reader for the attribute as
   1.125 @@ -449,9 +449,9 @@
   1.126    /// After you give all read commands you must call the \c run() member
   1.127    /// function, which execute all the commands.
   1.128    ///
   1.129 -  /// \code
   1.130 +  ///\code
   1.131    /// reader.run();
   1.132 -  /// \endcode
   1.133 +  ///\endcode
   1.134    ///
   1.135    /// \see GraphReader
   1.136    /// \see DefaultReaderTraits