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
22 #include <lemon/concept/graph.h>
23 #include <lemon/list_graph.h>
24 #include <lemon/smart_graph.h>
25 #include <lemon/full_graph.h>
26 #include <lemon/hypercube_graph.h>
28 #include "test_tools.h"
29 #include "graph_test.h"
33 using namespace lemon;
34 using namespace lemon::concept;
38 { // checking graph components
39 checkConcept<BaseGraphComponent, BaseGraphComponent >();
41 checkConcept<BaseIterableGraphComponent, BaseIterableGraphComponent >();
43 checkConcept<IDableGraphComponent, IDableGraphComponent >();
44 checkConcept<MaxIDableGraphComponent, MaxIDableGraphComponent >();
46 checkConcept<IterableGraphComponent, IterableGraphComponent >();
48 checkConcept<MappableGraphComponent, MappableGraphComponent >();
51 { // checking skeleton graphs
52 checkConcept<Graph, Graph >();
54 { // checking list graph
55 checkConcept<Graph, ListGraph >();
57 checkGraph<ListGraph>();
58 checkGraphNodeMap<ListGraph>();
59 checkGraphEdgeMap<ListGraph>();
61 { // checking smart graph
62 checkConcept<Graph, SmartGraph >();
64 checkGraph<SmartGraph>();
65 checkGraphNodeMap<SmartGraph>();
66 checkGraphEdgeMap<SmartGraph>();
68 { // checking full graph
69 checkConcept<Graph, FullGraph >();
71 { // checking full graph
72 checkConcept<Graph, HyperCubeGraph >();
75 std::cout << __FILE__ ": All tests passed.\n";