diff -r f58410582b9b -r 51597950d0fe lemon/nauty_reader.h
--- a/lemon/nauty_reader.h	Tue Nov 04 21:37:59 2008 +0100
+++ b/lemon/nauty_reader.h	Wed Nov 05 08:11:44 2008 +0000
@@ -38,7 +38,7 @@
   /// graphs of several classes with given node number (e.g.
   /// general, connected, biconnected, triangle-free, 4-cycle-free,
   /// bipartite and graphs with given edge number and degree
-  /// constraints). This function reads a \e nauty \e graph \e format
+  /// constraints). This function reads a \e nauty \e graph6 \e format
   /// line from the given stream and builds it in the given graph.
   ///
   /// The site of nauty package: http://cs.anu.edu.au/~bdm/nauty/
@@ -48,7 +48,7 @@
   ///\code
   /// int num = 0;
   /// SmartGraph graph;
-  /// while (readNauty(graph, std::cin)) {
+  /// while (readNautyGraph(graph, std::cin)) {
   ///   PlanarityChecking<SmartGraph> pc(graph);
   ///   if (pc.run()) ++num;
   /// }
@@ -61,7 +61,7 @@
   /// ./geng -c 10 | ./num_of_planar_graphs
   ///\endcode
   template <typename Graph>
-  std::istream& readNauty(Graph& graph, std::istream& is = std::cin) {
+  std::istream& readNautyGraph(Graph& graph, std::istream& is = std::cin) {
     graph.clear();
 
     std::string line;