0
2
0
... | ... |
@@ -38,7 +38,7 @@ |
38 | 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 |
|
41 |
/// constraints). This function reads a \e nauty \e graph6 \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/ |
... | ... |
@@ -48,7 +48,7 @@ |
48 | 48 |
///\code |
49 | 49 |
/// int num = 0; |
50 | 50 |
/// SmartGraph graph; |
51 |
/// while ( |
|
51 |
/// while (readNautyGraph(graph, std::cin)) { |
|
52 | 52 |
/// PlanarityChecking<SmartGraph> pc(graph); |
53 | 53 |
/// if (pc.run()) ++num; |
54 | 54 |
/// } |
... | ... |
@@ -61,7 +61,7 @@ |
61 | 61 |
/// ./geng -c 10 | ./num_of_planar_graphs |
62 | 62 |
///\endcode |
63 | 63 |
template <typename Graph> |
64 |
std::istream& |
|
64 |
std::istream& readNautyGraph(Graph& graph, std::istream& is = std::cin) { |
|
65 | 65 |
graph.clear(); |
66 | 66 |
|
67 | 67 |
std::string line; |
0 comments (0 inline)