1.1 --- a/lemon/nauty_reader.h	Mon Nov 03 16:59:14 2008 +0100
     1.2 +++ b/lemon/nauty_reader.h	Mon Nov 03 17:03:13 2008 +0100
     1.3 @@ -35,16 +35,16 @@
     1.4    ///
     1.5    /// The \e geng program is in the \e gtools suite of the nauty
     1.6    /// package. This tool can generate all non-isomorphic undirected
     1.7 -  /// graphs with given node number from several classes (for example,
     1.8 +  /// graphs of several classes with given node number (e.g.
     1.9    /// general, connected, biconnected, triangle-free, 4-cycle-free,
    1.10    /// bipartite and graphs with given edge number and degree
    1.11 -  /// constraints). This function reads a \e nauty \e graph6 \e format
    1.12 +  /// constraints). This function reads a \e nauty \e graph \e format
    1.13    /// line from the given stream and builds it in the given graph.
    1.14    ///
    1.15    /// The site of nauty package: http://cs.anu.edu.au/~bdm/nauty/
    1.16    ///
    1.17 -  /// For example, the number of all non-isomorphic connected graphs
    1.18 -  /// can be computed with following code.
    1.19 +  /// For example, the number of all non-isomorphic planar graphs
    1.20 +  /// can be computed with the following code.
    1.21    ///\code
    1.22    /// int num = 0;
    1.23    /// SmartGraph graph;
    1.24 @@ -56,12 +56,12 @@
    1.25    ///\endcode
    1.26    ///
    1.27    /// The nauty files are quite huge, therefore instead of the direct
    1.28 -  /// file generation the pipelining is recommended.
    1.29 +  /// file generation pipelining is recommended. For example,
    1.30    ///\code
    1.31 -  /// ./geng -c 10 | ./num_of_pg
    1.32 +  /// ./geng -c 10 | ./num_of_planar_graphs
    1.33    ///\endcode
    1.34    template <typename Graph>
    1.35 -  std::istream& readNauty(Graph& graph, std::istream& is) {
    1.36 +  std::istream& readNauty(Graph& graph, std::istream& is = std::cin) {
    1.37      graph.clear();
    1.38  
    1.39      std::string line;