The graph adadptors can be alteration observed.
In most cases it uses the adapted graph alteration notifiers.
Only special case is now the UndirGraphAdaptor, where
we have to proxy the signals from the graph.
The SubBidirGraphAdaptor is removed, because it doest not
gives more feature than the EdgeSubGraphAdaptor<UndirGraphAdaptor<Graph>>.
The ResGraphAdaptor is based on this composition.
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
22 #include <lemon/concept/graph.h>
23 #include <lemon/list_graph.h>
24 #include <lemon/smart_graph.h>
25 #include <lemon/full_graph.h>
26 #include <lemon/hypercube_graph.h>
28 #include "test_tools.h"
29 #include "graph_test.h"
33 using namespace lemon;
34 using namespace lemon::concept;
38 { // checking graph components
39 checkConcept<BaseGraphComponent, BaseGraphComponent >();
41 checkConcept<BaseIterableGraphComponent, BaseIterableGraphComponent >();
43 checkConcept<IDableGraphComponent, IDableGraphComponent >();
44 checkConcept<MaxIDableGraphComponent, MaxIDableGraphComponent >();
46 checkConcept<BaseExtendableGraphComponent, BaseExtendableGraphComponent >();
47 checkConcept<BaseErasableGraphComponent, BaseErasableGraphComponent >();
49 checkConcept<IterableGraphComponent, IterableGraphComponent >();
51 checkConcept<MappableGraphComponent, MappableGraphComponent >();
53 checkConcept<ExtendableGraphComponent, ExtendableGraphComponent >();
54 checkConcept<ErasableGraphComponent, ErasableGraphComponent >();
55 checkConcept<ClearableGraphComponent, ClearableGraphComponent >();
57 { // checking skeleton graphs
58 checkConcept<StaticGraph, StaticGraph >();
59 checkConcept<ExtendableGraph, ExtendableGraph >();
60 checkConcept<ErasableGraph, ErasableGraph >();
62 { // checking list graph
63 checkConcept<ErasableGraph, ListGraph >();
65 checkGraph<ListGraph>();
66 checkGraphNodeMap<ListGraph>();
67 checkGraphEdgeMap<ListGraph>();
69 { // checking smart graph
70 checkConcept<ExtendableGraph, SmartGraph >();
72 checkGraph<SmartGraph>();
73 checkGraphNodeMap<SmartGraph>();
74 checkGraphEdgeMap<SmartGraph>();
76 { // checking full graph
77 checkConcept<StaticGraph, FullGraph >();
79 { // checking full graph
80 checkConcept<StaticGraph, HyperCubeGraph >();
83 std::cout << __FILE__ ": All tests passed.\n";