1.1 --- a/lemon/lgf_reader.h Fri Aug 09 11:07:27 2013 +0200
1.2 +++ b/lemon/lgf_reader.h Sun Aug 11 15:28:12 2013 +0200
1.3 @@ -427,7 +427,7 @@
1.4 /// run();
1.5 ///\endcode
1.6 ///
1.7 - /// By default the reader uses the first section in the file of the
1.8 + /// By default, the reader uses the first section in the file of the
1.9 /// proper type. If a section has an optional name, then it can be
1.10 /// selected for reading by giving an optional name parameter to the
1.11 /// \c nodes(), \c arcs() or \c attributes() functions.
1.12 @@ -562,7 +562,7 @@
1.13 template <typename TDGR>
1.14 friend DigraphReader<TDGR> digraphReader(TDGR& digraph, std::istream& is);
1.15 template <typename TDGR>
1.16 - friend DigraphReader<TDGR> digraphReader(TDGR& digraph,
1.17 + friend DigraphReader<TDGR> digraphReader(TDGR& digraph,
1.18 const std::string& fn);
1.19 template <typename TDGR>
1.20 friend DigraphReader<TDGR> digraphReader(TDGR& digraph, const char *fn);
1.21 @@ -1194,14 +1194,14 @@
1.22 /// @}
1.23
1.24 };
1.25 -
1.26 +
1.27 /// \ingroup lemon_io
1.28 ///
1.29 /// \brief Return a \ref DigraphReader class
1.30 ///
1.31 /// This function just returns a \ref DigraphReader class.
1.32 ///
1.33 - /// With this function a digraph can be read from an
1.34 + /// With this function a digraph can be read from an
1.35 /// \ref lgf-format "LGF" file or input stream with several maps and
1.36 /// attributes. For example, there is network flow problem on a
1.37 /// digraph, i.e. a digraph with a \e capacity map on the arcs and
1.38 @@ -1256,7 +1256,7 @@
1.39
1.40 template <typename GR>
1.41 class GraphReader;
1.42 -
1.43 +
1.44 template <typename TGR>
1.45 GraphReader<TGR> graphReader(TGR& graph, std::istream& is = std::cin);
1.46 template <typename TGR>
1.47 @@ -1393,7 +1393,7 @@
1.48 template <typename TGR>
1.49 friend GraphReader<TGR> graphReader(TGR& graph, std::istream& is);
1.50 template <typename TGR>
1.51 - friend GraphReader<TGR> graphReader(TGR& graph, const std::string& fn);
1.52 + friend GraphReader<TGR> graphReader(TGR& graph, const std::string& fn);
1.53 template <typename TGR>
1.54 friend GraphReader<TGR> graphReader(TGR& graph, const char *fn);
1.55
1.56 @@ -2077,9 +2077,9 @@
1.57 ///
1.58 /// \brief Return a \ref GraphReader class
1.59 ///
1.60 - /// This function just returns a \ref GraphReader class.
1.61 + /// This function just returns a \ref GraphReader class.
1.62 ///
1.63 - /// With this function a graph can be read from an
1.64 + /// With this function a graph can be read from an
1.65 /// \ref lgf-format "LGF" file or input stream with several maps and
1.66 /// attributes. For example, there is weighted matching problem on a
1.67 /// graph, i.e. a graph with a \e weight map on the edges. This
1.68 @@ -2235,7 +2235,7 @@
1.69 /// and the comment lines are filtered out, and the leading
1.70 /// whitespaces are trimmed from each processed string.
1.71 ///
1.72 - /// For example let's see a section, which contain several
1.73 + /// For example, let's see a section, which contain several
1.74 /// integers, which should be inserted into a vector.
1.75 ///\code
1.76 /// @numbers