Changeset 364:7c5d8de2eac7 in lemon for lemon
 Timestamp:
 11/03/08 17:03:13 (16 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/nauty_reader.h
r363 r364 36 36 /// The \e geng program is in the \e gtools suite of the nauty 37 37 /// package. This tool can generate all nonisomorphic 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, trianglefree, 4cyclefree, 40 40 /// bipartite and graphs with given edge number and degree 41 /// constraints). This function reads a \e nauty \e graph 6\e format41 /// 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. 43 43 /// 44 44 /// The site of nauty package: http://cs.anu.edu.au/~bdm/nauty/ 45 45 /// 46 /// For example, the number of all nonisomorphic connectedgraphs47 /// can be computed with following code.46 /// For example, the number of all nonisomorphic planar graphs 47 /// can be computed with the following code. 48 48 ///\code 49 49 /// int num = 0; … … 57 57 /// 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_p g61 /// ./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(); 66 66
Note: See TracChangeset
for help on using the changeset viewer.