r357:3fb8ed1322de
Tue, 04 Nov 2008 11:25:47
[Not Reviewed]
0 comments (0 inline)
0
2
0
| ... | ... |
@@ -465,5 +465,5 @@ |
| 465 | 465 |
|
| 466 | 466 |
/** |
| 467 |
@defgroup lemon_io LEMON |
|
| 467 |
@defgroup lemon_io LEMON Graph Format |
|
| 468 | 468 |
@ingroup io_group |
| 469 | 469 |
\brief Reading and writing LEMON Graph Format. |
| ... | ... |
@@ -483,4 +483,11 @@ |
| 483 | 483 |
|
| 484 | 484 |
/** |
| 485 |
@defgroup nauty_group NAUTY Format |
|
| 486 |
@ingroup io_group |
|
| 487 |
\brief Read \e Nauty format |
|
| 488 |
Tool to read graphs from \e Nauty format data. |
|
| 489 |
*/ |
|
| 490 |
|
|
| 491 |
/** |
|
| 485 | 492 |
@defgroup concept Concepts |
| 486 | 493 |
\brief Skeleton classes and concept checking classes |
| ... | ... |
@@ -24,15 +24,8 @@ |
| 24 | 24 |
#include <string> |
| 25 | 25 |
|
| 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 |
|
|
| 34 | 26 |
/// \ingroup nauty_group |
| 35 | 27 |
/// \file |
| 36 | 28 |
/// \brief Nauty file reader. |
| 29 |
|
|
| 37 | 30 |
namespace lemon {
|
| 38 | 31 |
|
| ... | ... |
@@ -43,14 +36,14 @@ |
| 43 | 36 |
/// The \e geng program is in the \e gtools suite of the nauty |
| 44 | 37 |
/// package. This tool can generate all non-isomorphic undirected |
| 45 |
/// graphs with given node number |
|
| 38 |
/// graphs of several classes with given node number (e.g. |
|
| 46 | 39 |
/// general, connected, biconnected, triangle-free, 4-cycle-free, |
| 47 | 40 |
/// bipartite and graphs with given edge number and degree |
| 48 |
/// constraints). This function reads a \e nauty \e |
|
| 41 |
/// constraints). This function reads a \e nauty \e graph \e format |
|
| 49 | 42 |
/// line from the given stream and builds it in the given graph. |
| 50 | 43 |
/// |
| 51 | 44 |
/// The site of nauty package: http://cs.anu.edu.au/~bdm/nauty/ |
| 52 | 45 |
/// |
| 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. |
|
| 55 | 48 |
///\code |
| 56 | 49 |
/// int num = 0; |
| ... | ... |
@@ -64,10 +57,10 @@ |
| 64 | 57 |
/// |
| 65 | 58 |
/// The nauty files are quite huge, therefore instead of the direct |
| 66 |
/// file generation |
|
| 59 |
/// file generation pipelining is recommended. For example, |
|
| 67 | 60 |
///\code |
| 68 |
/// ./geng -c 10 | ./ |
|
| 61 |
/// ./geng -c 10 | ./num_of_planar_graphs |
|
| 69 | 62 |
///\endcode |
| 70 | 63 |
template <typename Graph> |
| 71 |
std::istream& readNauty(Graph& graph, std::istream& is) {
|
|
| 64 |
std::istream& readNauty(Graph& graph, std::istream& is = std::cin) {
|
|
| 72 | 65 |
graph.clear(); |
| 73 | 66 |
|
0 comments (0 inline)