[1956] | 1 | /* -*- C++ -*- |
---|
| 2 | * |
---|
| 3 | * This file is a part of LEMON, a generic C++ optimization library |
---|
| 4 | * |
---|
| 5 | * Copyright (C) 2003-2006 |
---|
| 6 | * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
---|
| 7 | * (Egervary Research Group on Combinatorial Optimization, EGRES). |
---|
| 8 | * |
---|
| 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. |
---|
| 12 | * |
---|
| 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 |
---|
| 15 | * purpose. |
---|
| 16 | * |
---|
| 17 | */ |
---|
[906] | 18 | |
---|
[946] | 19 | #include <iostream> |
---|
| 20 | #include <vector> |
---|
[578] | 21 | |
---|
[959] | 22 | #include <lemon/concept/graph.h> |
---|
[946] | 23 | #include <lemon/list_graph.h> |
---|
| 24 | #include <lemon/smart_graph.h> |
---|
| 25 | #include <lemon/full_graph.h> |
---|
[1712] | 26 | #include <lemon/hypercube_graph.h> |
---|
[567] | 27 | |
---|
[946] | 28 | #include "test_tools.h" |
---|
| 29 | #include "graph_test.h" |
---|
| 30 | #include "map_test.h" |
---|
[503] | 31 | |
---|
| 32 | |
---|
[921] | 33 | using namespace lemon; |
---|
[959] | 34 | using namespace lemon::concept; |
---|
[503] | 35 | |
---|
| 36 | |
---|
[946] | 37 | int main() { |
---|
| 38 | { // checking graph components |
---|
[989] | 39 | checkConcept<BaseGraphComponent, BaseGraphComponent >(); |
---|
[503] | 40 | |
---|
[989] | 41 | checkConcept<BaseIterableGraphComponent, BaseIterableGraphComponent >(); |
---|
[503] | 42 | |
---|
[989] | 43 | checkConcept<IDableGraphComponent, IDableGraphComponent >(); |
---|
| 44 | checkConcept<MaxIDableGraphComponent, MaxIDableGraphComponent >(); |
---|
[503] | 45 | |
---|
[989] | 46 | checkConcept<BaseExtendableGraphComponent, BaseExtendableGraphComponent >(); |
---|
| 47 | checkConcept<BaseErasableGraphComponent, BaseErasableGraphComponent >(); |
---|
[503] | 48 | |
---|
[989] | 49 | checkConcept<IterableGraphComponent, IterableGraphComponent >(); |
---|
[503] | 50 | |
---|
[989] | 51 | checkConcept<MappableGraphComponent, MappableGraphComponent >(); |
---|
[793] | 52 | |
---|
[989] | 53 | checkConcept<ExtendableGraphComponent, ExtendableGraphComponent >(); |
---|
| 54 | checkConcept<ErasableGraphComponent, ErasableGraphComponent >(); |
---|
| 55 | checkConcept<ClearableGraphComponent, ClearableGraphComponent >(); |
---|
[946] | 56 | } |
---|
| 57 | { // checking skeleton graphs |
---|
[989] | 58 | checkConcept<StaticGraph, StaticGraph >(); |
---|
| 59 | checkConcept<ExtendableGraph, ExtendableGraph >(); |
---|
| 60 | checkConcept<ErasableGraph, ErasableGraph >(); |
---|
[946] | 61 | } |
---|
| 62 | { // checking list graph |
---|
[989] | 63 | checkConcept<ErasableGraph, ListGraph >(); |
---|
[793] | 64 | |
---|
[946] | 65 | checkGraph<ListGraph>(); |
---|
| 66 | checkGraphNodeMap<ListGraph>(); |
---|
| 67 | checkGraphEdgeMap<ListGraph>(); |
---|
| 68 | } |
---|
| 69 | { // checking smart graph |
---|
[989] | 70 | checkConcept<ExtendableGraph, SmartGraph >(); |
---|
[733] | 71 | |
---|
[946] | 72 | checkGraph<SmartGraph>(); |
---|
| 73 | checkGraphNodeMap<SmartGraph>(); |
---|
| 74 | checkGraphEdgeMap<SmartGraph>(); |
---|
[503] | 75 | } |
---|
[946] | 76 | { // checking full graph |
---|
[989] | 77 | checkConcept<StaticGraph, FullGraph >(); |
---|
[578] | 78 | } |
---|
[1712] | 79 | { // checking full graph |
---|
| 80 | checkConcept<StaticGraph, HyperCubeGraph >(); |
---|
| 81 | } |
---|
[503] | 82 | |
---|
| 83 | std::cout << __FILE__ ": All tests passed.\n"; |
---|
| 84 | |
---|
[579] | 85 | return 0; |
---|
[503] | 86 | } |
---|