1 | /* -*- C++ -*- |
---|
2 | * |
---|
3 | * This file is a part of LEMON, a generic C++ optimization library |
---|
4 | * |
---|
5 | * Copyright (C) 2003-2008 |
---|
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 | */ |
---|
18 | |
---|
19 | #include<iostream> |
---|
20 | #include<lemon/concept_check.h> |
---|
21 | |
---|
22 | #include<lemon/smart_graph.h> |
---|
23 | #include<lemon/concepts/graph.h> |
---|
24 | #include<lemon/concepts/ugraph.h> |
---|
25 | #include<lemon/concepts/bpugraph.h> |
---|
26 | |
---|
27 | #include<lemon/list_graph.h> |
---|
28 | #include<lemon/full_graph.h> |
---|
29 | #include<lemon/graph_adaptor.h> |
---|
30 | #include<lemon/ugraph_adaptor.h> |
---|
31 | #include<lemon/bpugraph_adaptor.h> |
---|
32 | |
---|
33 | #include"test/test_tools.h" |
---|
34 | #include"test/graph_test.h" |
---|
35 | |
---|
36 | /** |
---|
37 | \file |
---|
38 | This test makes consistency checks of graph adaptors. |
---|
39 | |
---|
40 | \todo More extensive tests are needed |
---|
41 | */ |
---|
42 | |
---|
43 | using namespace lemon; |
---|
44 | using namespace lemon::concepts; |
---|
45 | |
---|
46 | |
---|
47 | |
---|
48 | int main() |
---|
49 | { |
---|
50 | { |
---|
51 | typedef Graph Graph; |
---|
52 | checkConcept<Graph, GraphAdaptor<Graph> >(); |
---|
53 | |
---|
54 | checkConcept<Graph, RevGraphAdaptor<Graph> >(); |
---|
55 | |
---|
56 | checkConcept<Graph, SubGraphAdaptor<Graph, |
---|
57 | Graph::NodeMap<bool> , Graph::EdgeMap<bool> > >(); |
---|
58 | checkConcept<Graph, NodeSubGraphAdaptor<Graph, |
---|
59 | Graph::NodeMap<bool> > >(); |
---|
60 | checkConcept<Graph, EdgeSubGraphAdaptor<Graph, |
---|
61 | Graph::EdgeMap<bool> > >(); |
---|
62 | |
---|
63 | checkConcept<Graph, ResGraphAdaptor<Graph, int, |
---|
64 | Graph::EdgeMap<int>, Graph::EdgeMap<int> > >(); |
---|
65 | |
---|
66 | checkConcept<Graph, ErasingFirstGraphAdaptor<Graph, |
---|
67 | Graph::NodeMap<Graph::Edge> > >(); |
---|
68 | |
---|
69 | checkConcept<Graph, SplitGraphAdaptor<Graph> >(); |
---|
70 | |
---|
71 | checkConcept<UGraph, UndirGraphAdaptor<Graph> >(); |
---|
72 | |
---|
73 | checkConcept<UGraph, SubUGraphAdaptor<UGraph, |
---|
74 | UGraph::NodeMap<bool> , UGraph::UEdgeMap<bool> > >(); |
---|
75 | checkConcept<UGraph, NodeSubUGraphAdaptor<UGraph, |
---|
76 | UGraph::NodeMap<bool> > >(); |
---|
77 | checkConcept<UGraph, EdgeSubUGraphAdaptor<UGraph, |
---|
78 | UGraph::UEdgeMap<bool> > >(); |
---|
79 | |
---|
80 | checkConcept<Graph, DirUGraphAdaptor<UGraph, |
---|
81 | UGraph::UEdgeMap<bool> > >(); |
---|
82 | |
---|
83 | checkConcept<BpUGraph, BpUGraphAdaptor<BpUGraph> >(); |
---|
84 | |
---|
85 | checkConcept<BpUGraph, SwapBpUGraphAdaptor<BpUGraph> >(); |
---|
86 | |
---|
87 | } |
---|
88 | std::cout << __FILE__ ": All tests passed.\n"; |
---|
89 | |
---|
90 | return 0; |
---|
91 | } |
---|