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
20 #include<lemon/concept_check.h>
22 #include<lemon/smart_graph.h>
23 #include<lemon/concept/graph.h>
24 #include<lemon/concept/ugraph.h>
26 #include<lemon/list_graph.h>
27 #include<lemon/full_graph.h>
28 #include<lemon/graph_adaptor.h>
29 #include<lemon/ugraph_adaptor.h>
31 #include"test/test_tools.h"
32 #include"test/graph_test.h"
36 This test makes consistency checks of graph adaptors.
38 \todo More extensive tests are needed
41 using namespace lemon;
42 using namespace lemon::concept;
49 typedef StaticGraph Graph;
50 checkConcept<StaticGraph, GraphAdaptor<Graph> >();
52 checkConcept<StaticGraph, RevGraphAdaptor<Graph> >();
54 checkConcept<StaticGraph, SubGraphAdaptor<Graph,
55 Graph::NodeMap<bool> , Graph::EdgeMap<bool> > >();
56 checkConcept<StaticGraph, NodeSubGraphAdaptor<Graph,
57 Graph::NodeMap<bool> > >();
58 checkConcept<StaticGraph, EdgeSubGraphAdaptor<Graph,
59 Graph::EdgeMap<bool> > >();
61 checkConcept<StaticGraph, ResGraphAdaptor<Graph, int,
62 Graph::EdgeMap<int>, Graph::EdgeMap<int> > >();
64 checkConcept<StaticGraph, ErasingFirstGraphAdaptor<Graph,
65 Graph::NodeMap<Graph::Edge> > >();
67 checkConcept<UGraph, UndirGraphAdaptor<Graph> >();
69 checkConcept<UGraph, SubUGraphAdaptor<UGraph,
70 UGraph::NodeMap<bool> , UGraph::UEdgeMap<bool> > >();
71 checkConcept<UGraph, NodeSubUGraphAdaptor<UGraph,
72 UGraph::NodeMap<bool> > >();
73 checkConcept<UGraph, EdgeSubUGraphAdaptor<UGraph,
74 UGraph::UEdgeMap<bool> > >();
76 checkConcept<StaticGraph, DirUGraphAdaptor<UGraph,
77 UGraph::UEdgeMap<bool> > >();
79 std::cout << __FILE__ ": All tests passed.\n";