Six-coloring in plan graphs.
6 #include <lemon/graph_utils.h>
8 #include <lemon/list_graph.h>
9 #include <lemon/smart_graph.h>
10 #include <lemon/full_graph.h>
12 #include "test_tools.h"
13 #include "graph_utils_test.h"
16 using namespace lemon;
21 { // checking list graph
22 checkGraphCounters<ListGraph>();
24 { // checking smart graph
25 checkGraphCounters<SmartGraph>();
30 check(countNodes(fg) == num, "FullGraph: wrong node number.");
31 check(countEdges(fg) == num*num, "FullGraph: wrong edge number.");
34 std::cout << __FILE__ ": All tests passed.\n";