Fixed the mailinglist link and removed the gui section.
3 * This file is a part of LEMON, a generic C++ optimization library
5 * Copyright (C) 2003-2006
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
9 * Permission to use, modify and distribute this software is granted
10 * provided that this copyright notice appears in all copies. For
11 * precise terms see the accompanying LICENSE file.
13 * This software is provided "AS IS" with no warranty of any kind,
14 * express or implied, and with no claim as to its suitability for any
19 #include <lemon/bits/graph_extender.h>
20 #include <lemon/concept/ugraph.h>
21 #include <lemon/list_graph.h>
22 #include <lemon/smart_graph.h>
23 #include <lemon/full_graph.h>
24 #include <lemon/grid_ugraph.h>
26 #include <lemon/graph_utils.h>
28 #include "test_tools.h"
31 using namespace lemon;
32 using namespace lemon::concept;
34 void check_concepts() {
36 { // checking graph components
37 checkConcept<BaseUGraphComponent, BaseUGraphComponent >();
39 checkConcept<BaseIterableUGraphComponent<>,
40 BaseIterableUGraphComponent<> >();
42 checkConcept<IDableUGraphComponent<>,
43 IDableUGraphComponent<> >();
45 checkConcept<IterableUGraphComponent<>,
46 IterableUGraphComponent<> >();
48 checkConcept<MappableUGraphComponent<>,
49 MappableUGraphComponent<> >();
53 checkConcept<UGraph, ListUGraph>();
55 checkConcept<UGraph, SmartUGraph>();
57 checkConcept<UGraph, FullUGraph>();
59 checkConcept<UGraph, UGraph>();
61 checkConcept<UGraph, GridUGraph>();
65 template <typename Graph>
66 void check_item_counts(Graph &g, int n, int e) {
68 for (typename Graph::NodeIt it(g); it != INVALID; ++it) {
72 check(nn == n, "Wrong node number.");
73 check(countNodes(g) == n, "Wrong node number.");
76 for (typename Graph::EdgeIt it(g); it != INVALID; ++it) {
80 check(ee == 2*e, "Wrong edge number.");
81 check(countEdges(g) == 2*e, "Wrong edge number.");
84 for (typename Graph::UEdgeIt it(g); it != INVALID; ++it) {
88 check(uee == e, "Wrong uedge number.");
89 check(countUEdges(g) == e, "Wrong uedge number.");
92 template <typename Graph>
93 void print_items(Graph &g) {
95 typedef typename Graph::NodeIt NodeIt;
96 typedef typename Graph::UEdgeIt UEdgeIt;
97 typedef typename Graph::EdgeIt EdgeIt;
99 std::cout << "Nodes" << std::endl;
101 for(NodeIt it(g); it!=INVALID; ++it, ++i) {
102 std::cout << " " << i << ": " << g.id(it) << std::endl;
105 std::cout << "UEdge" << std::endl;
107 for(UEdgeIt it(g); it!=INVALID; ++it, ++i) {
108 std::cout << " " << i << ": " << g.id(it)
109 << " (" << g.id(g.source(it)) << ", " << g.id(g.target(it))
113 std::cout << "Edge" << std::endl;
115 for(EdgeIt it(g); it!=INVALID; ++it, ++i) {
116 std::cout << " " << i << ": " << g.id(it)
117 << " (" << g.id(g.source(it)) << ", " << g.id(g.target(it))
123 template <typename Graph>
126 typedef typename Graph::Node Node;
127 typedef typename Graph::UEdge UEdge;
128 typedef typename Graph::Edge Edge;
129 typedef typename Graph::NodeIt NodeIt;
130 typedef typename Graph::UEdgeIt UEdgeIt;
131 typedef typename Graph::EdgeIt EdgeIt;
135 check_item_counts(g,0,0);
143 e1 = g.addEdge(n1, n2),
144 e2 = g.addEdge(n2, n3);
148 check_item_counts(g,3,2);
151 void checkGridUGraph(const GridUGraph& g, int w, int h) {
152 check(g.width() == w, "Wrong width");
153 check(g.height() == h, "Wrong height");
155 for (int i = 0; i < w; ++i) {
156 for (int j = 0; j < h; ++j) {
157 check(g.col(g(i, j)) == i, "Wrong col");
158 check(g.row(g(i, j)) == j, "Wrong row");
162 for (int i = 0; i < w; ++i) {
163 for (int j = 0; j < h - 1; ++j) {
164 check(g.source(g.down(g(i, j))) == g(i, j), "Wrong down");
165 check(g.target(g.down(g(i, j))) == g(i, j + 1), "Wrong down");
167 check(g.down(g(i, h - 1)) == INVALID, "Wrong down");
170 for (int i = 0; i < w; ++i) {
171 for (int j = 1; j < h; ++j) {
172 check(g.source(g.up(g(i, j))) == g(i, j), "Wrong up");
173 check(g.target(g.up(g(i, j))) == g(i, j - 1), "Wrong up");
175 check(g.up(g(i, 0)) == INVALID, "Wrong up");
178 for (int j = 0; j < h; ++j) {
179 for (int i = 0; i < w - 1; ++i) {
180 check(g.source(g.right(g(i, j))) == g(i, j), "Wrong right");
181 check(g.target(g.right(g(i, j))) == g(i + 1, j), "Wrong right");
183 check(g.right(g(w - 1, j)) == INVALID, "Wrong right");
186 for (int j = 0; j < h; ++j) {
187 for (int i = 1; i < w; ++i) {
188 check(g.source(g.left(g(i, j))) == g(i, j), "Wrong left");
189 check(g.target(g.left(g(i, j))) == g(i - 1, j), "Wrong left");
191 check(g.left(g(0, j)) == INVALID, "Wrong left");
198 check_graph<ListUGraph>();
199 check_graph<SmartUGraph>();
203 check_item_counts(g, 5, 10);
208 check_item_counts(g, 30, 49);
209 checkGridUGraph(g, 5, 6);
212 std::cout << __FILE__ ": All tests passed.\n";