Changeset - r352:7c5d8de2eac7
« 351:91e68d
357:3fb8ed »
gravatar
kpeter (Peter Kovacs)
kpeter@inf.elte.hu
Small improvements for the nauty reader (#55)
0 1 0
default
1 file changed with 7 insertions and 7 deletions:
lemon/nauty_reader.h
7
7
↑ Collapse diff ↑
lemon/nauty_reader.h
Show white space 6 line context
... ... 
@@ -37,6 +37,6 @@
37 37 
  /// package. This tool can generate all non-isomorphic undirected
38 
  /// graphs with given node number from several classes (for example,
38 
  /// graphs of several classes with given node number (e.g.
39 39 
  /// general, connected, biconnected, triangle-free, 4-cycle-free,
40 40 
  /// bipartite and graphs with given edge number and degree
41 
  /// constraints). This function reads a \e nauty \e graph6 \e format
41 
  /// constraints). This function reads a \e nauty \e graph \e format
42 42 
  /// line from the given stream and builds it in the given graph.
... ... 
@@ -45,4 +45,4 @@
45 45 
  ///
46 
  /// For example, the number of all non-isomorphic connected graphs
47 
  /// can be computed with following code.
46 
  /// For example, the number of all non-isomorphic planar graphs
47 
  /// can be computed with the following code.
48 48 
  ///\code
... ... 
@@ -58,8 +58,8 @@
58 58 
  /// The nauty files are quite huge, therefore instead of the direct
59 
  /// file generation the pipelining is recommended.
59 
  /// file generation pipelining is recommended. For example,
60 60 
  ///\code
61 
  /// ./geng -c 10 | ./num_of_pg
61 
  /// ./geng -c 10 | ./num_of_planar_graphs
62 62 
  ///\endcode
63 63 
  template <typename Graph>
64 
  std::istream& readNauty(Graph& graph, std::istream& is) {
64 
  std::istream& readNauty(Graph& graph, std::istream& is = std::cin) {
65 65 
    graph.clear();
0 comments (0 inline)