3 * This file is a part of LEMON, a generic C++ optimization library
5 * Copyright (C) 2003-2008
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
20 #include<lemon/concept_check.h>
22 #include<lemon/smart_graph.h>
23 #include<lemon/concepts/graph.h>
24 #include<lemon/concepts/ugraph.h>
25 #include<lemon/concepts/bpugraph.h>
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>
33 #include"test/test_tools.h"
34 #include"test/graph_test.h"
38 This test makes consistency checks of graph adaptors.
40 \todo More extensive tests are needed
43 using namespace lemon;
44 using namespace lemon::concepts;
52 checkConcept<Graph, GraphAdaptor<Graph> >();
54 checkConcept<Graph, RevGraphAdaptor<Graph> >();
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> > >();
63 checkConcept<Graph, ResGraphAdaptor<Graph, int,
64 Graph::EdgeMap<int>, Graph::EdgeMap<int> > >();
66 checkConcept<Graph, ErasingFirstGraphAdaptor<Graph,
67 Graph::NodeMap<Graph::Edge> > >();
69 checkConcept<Graph, SplitGraphAdaptor<Graph> >();
71 checkConcept<UGraph, UndirGraphAdaptor<Graph> >();
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> > >();
80 checkConcept<Graph, DirUGraphAdaptor<UGraph,
81 UGraph::UEdgeMap<bool> > >();
83 checkConcept<BpUGraph, BpUGraphAdaptor<BpUGraph> >();
85 checkConcept<BpUGraph, SwapBpUGraphAdaptor<BpUGraph> >();
88 std::cout << __FILE__ ": All tests passed.\n";