COIN-OR::LEMON - Graph Library

Changeset 352:7c5d8de2eac7 in lemon-1.2


Ignore:
Timestamp:
11/03/08 17:03:13 (16 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Small improvements for the nauty reader (#55)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/nauty_reader.h

    r351 r352  
    3636  /// The \e geng program is in the \e gtools suite of the nauty
    3737  /// 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.
    3939  /// general, connected, biconnected, triangle-free, 4-cycle-free,
    4040  /// 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
    4242  /// line from the given stream and builds it in the given graph.
    4343  ///
    4444  /// The site of nauty package: http://cs.anu.edu.au/~bdm/nauty/
    4545  ///
    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.
    4848  ///\code
    4949  /// int num = 0;
     
    5757  ///
    5858  /// 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,
    6060  ///\code
    61   /// ./geng -c 10 | ./num_of_pg
     61  /// ./geng -c 10 | ./num_of_planar_graphs
    6262  ///\endcode
    6363  template <typename Graph>
    64   std::istream& readNauty(Graph& graph, std::istream& is) {
     64  std::istream& readNauty(Graph& graph, std::istream& is = std::cin) {
    6565    graph.clear();
    6666
Note: See TracChangeset for help on using the changeset viewer.