COIN-OR::LEMON - Graph Library

Changes in / [356:99f1bdf8f7db:357:3fb8ed1322de] in lemon-1.1


Ignore:
Files:
2 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r318 r351  
    465465
    466466/**
    467 @defgroup lemon_io LEMON Input-Output
     467@defgroup lemon_io LEMON Graph Format
    468468@ingroup io_group
    469469\brief Reading and writing LEMON Graph Format.
     
    480480This group describes general \c EPS drawing methods and special
    481481graph exporting tools.
     482*/
     483
     484/**
     485@defgroup nauty_group NAUTY Format
     486@ingroup io_group
     487\brief Read \e Nauty format
     488Tool to read graphs from \e Nauty format data.
    482489*/
    483490
  • lemon/nauty_reader.h

    r350 r352  
    2424#include <string>
    2525
    26 /// \ingroup io_group
    27 ///
    28 /// @defgroup nauty_group NAUTY format
    29 ///
    30 /// \brief Read \e Nauty format
    31 ///
    32 /// Tool to read graphs from \e Nauty format data
    33 
    3426/// \ingroup nauty_group
    3527/// \file
    3628/// \brief Nauty file reader.
     29
    3730namespace lemon {
    3831
     
    4336  /// The \e geng program is in the \e gtools suite of the nauty
    4437  /// package. This tool can generate all non-isomorphic undirected
    45   /// graphs with given node number from several classes (for example,
     38  /// graphs of several classes with given node number (e.g.
    4639  /// general, connected, biconnected, triangle-free, 4-cycle-free,
    4740  /// bipartite and graphs with given edge number and degree
    48   /// constraints). This function reads a \e nauty \e graph6 \e format
     41  /// constraints). This function reads a \e nauty \e graph \e format
    4942  /// line from the given stream and builds it in the given graph.
    5043  ///
    5144  /// The site of nauty package: http://cs.anu.edu.au/~bdm/nauty/
    5245  ///
    53   /// For example, the number of all non-isomorphic connected graphs
    54   /// 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.
    5548  ///\code
    5649  /// int num = 0;
     
    6457  ///
    6558  /// The nauty files are quite huge, therefore instead of the direct
    66   /// file generation the pipelining is recommended.
     59  /// file generation pipelining is recommended. For example,
    6760  ///\code
    68   /// ./geng -c 10 | ./num_of_pg
     61  /// ./geng -c 10 | ./num_of_planar_graphs
    6962  ///\endcode
    7063  template <typename Graph>
    71   std::istream& readNauty(Graph& graph, std::istream& is) {
     64  std::istream& readNauty(Graph& graph, std::istream& is = std::cin) {
    7265    graph.clear();
    7366
Note: See TracChangeset for help on using the changeset viewer.