deba@1018
|
1 |
/* -*- mode: C++; indent-tabs-mode: nil; -*-
|
deba@1018
|
2 |
*
|
deba@1018
|
3 |
* This file is a part of LEMON, a generic C++ optimization library.
|
deba@1018
|
4 |
*
|
deba@1018
|
5 |
* Copyright (C) 2003-2010
|
deba@1018
|
6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
|
deba@1018
|
7 |
* (Egervary Research Group on Combinatorial Optimization, EGRES).
|
deba@1018
|
8 |
*
|
deba@1018
|
9 |
* Permission to use, modify and distribute this software is granted
|
deba@1018
|
10 |
* provided that this copyright notice appears in all copies. For
|
deba@1018
|
11 |
* precise terms see the accompanying LICENSE file.
|
deba@1018
|
12 |
*
|
deba@1018
|
13 |
* This software is provided "AS IS" with no warranty of any kind,
|
deba@1018
|
14 |
* express or implied, and with no claim as to its suitability for any
|
deba@1018
|
15 |
* purpose.
|
deba@1018
|
16 |
*
|
deba@1018
|
17 |
*/
|
deba@1018
|
18 |
|
deba@1018
|
19 |
#include <lemon/concepts/bpgraph.h>
|
deba@1018
|
20 |
//#include <lemon/list_graph.h>
|
deba@1018
|
21 |
//#include <lemon/smart_graph.h>
|
deba@1018
|
22 |
//#include <lemon/full_graph.h>
|
deba@1018
|
23 |
//#include <lemon/grid_graph.h>
|
deba@1018
|
24 |
//#include <lemon/hypercube_graph.h>
|
deba@1018
|
25 |
|
deba@1018
|
26 |
#include "test_tools.h"
|
deba@1018
|
27 |
#include "graph_test.h"
|
deba@1018
|
28 |
|
deba@1018
|
29 |
using namespace lemon;
|
deba@1018
|
30 |
using namespace lemon::concepts;
|
deba@1018
|
31 |
|
deba@1018
|
32 |
void checkConcepts() {
|
deba@1018
|
33 |
{ // Checking graph components
|
deba@1018
|
34 |
checkConcept<BaseBpGraphComponent, BaseBpGraphComponent >();
|
deba@1018
|
35 |
|
deba@1018
|
36 |
checkConcept<IDableBpGraphComponent<>,
|
deba@1018
|
37 |
IDableBpGraphComponent<> >();
|
deba@1018
|
38 |
|
deba@1018
|
39 |
checkConcept<IterableBpGraphComponent<>,
|
deba@1018
|
40 |
IterableBpGraphComponent<> >();
|
deba@1018
|
41 |
|
deba@1018
|
42 |
checkConcept<AlterableBpGraphComponent<>,
|
deba@1018
|
43 |
AlterableBpGraphComponent<> >();
|
deba@1018
|
44 |
|
deba@1018
|
45 |
checkConcept<MappableBpGraphComponent<>,
|
deba@1018
|
46 |
MappableBpGraphComponent<> >();
|
deba@1018
|
47 |
|
deba@1018
|
48 |
checkConcept<ExtendableBpGraphComponent<>,
|
deba@1018
|
49 |
ExtendableBpGraphComponent<> >();
|
deba@1018
|
50 |
|
deba@1018
|
51 |
checkConcept<ErasableBpGraphComponent<>,
|
deba@1018
|
52 |
ErasableBpGraphComponent<> >();
|
deba@1018
|
53 |
|
deba@1018
|
54 |
checkConcept<ClearableGraphComponent<>,
|
deba@1018
|
55 |
ClearableGraphComponent<> >();
|
deba@1018
|
56 |
|
deba@1018
|
57 |
}
|
deba@1018
|
58 |
{ // Checking skeleton graph
|
deba@1018
|
59 |
checkConcept<BpGraph, BpGraph>();
|
deba@1018
|
60 |
}
|
deba@1018
|
61 |
}
|
deba@1018
|
62 |
|
deba@1018
|
63 |
void checkGraphs() {
|
deba@1018
|
64 |
}
|
deba@1018
|
65 |
|
deba@1018
|
66 |
int main() {
|
deba@1018
|
67 |
checkConcepts();
|
deba@1018
|
68 |
checkGraphs();
|
deba@1018
|
69 |
return 0;
|
deba@1018
|
70 |
}
|