0
2
0
... | ... |
@@ -47,9 +47,9 @@ |
47 | 47 |
/// can be computed with the following code. |
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 |
/// } |
55 | 55 |
/// std::cout << "Number of planar graphs: " << num << std::endl; |
... | ... |
@@ -60,9 +60,9 @@ |
60 | 60 |
///\code |
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; |
68 | 68 |
if (getline(is, line)) { |
0 comments (0 inline)