Small fixes in README.
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
22 #include <lemon/concepts/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::concepts;
38 { // checking graph components
39 checkConcept<BaseGraphComponent, BaseGraphComponent >();
41 checkConcept<IDableGraphComponent<>,
42 IDableGraphComponent<> >();
44 checkConcept<IterableGraphComponent<>,
45 IterableGraphComponent<> >();
47 checkConcept<MappableGraphComponent<>,
48 MappableGraphComponent<> >();
51 { // checking skeleton graphs
52 checkConcept<Graph, Graph>();
54 { // checking list graph
55 checkConcept<Graph, ListGraph >();
56 checkConcept<AlterableGraphComponent<>, ListGraph>();
57 checkConcept<ExtendableGraphComponent<>, ListGraph>();
58 checkConcept<ClearableGraphComponent<>, ListGraph>();
59 checkConcept<ErasableGraphComponent<>, ListGraph>();
61 checkGraph<ListGraph>();
62 checkGraphNodeMap<ListGraph>();
63 checkGraphEdgeMap<ListGraph>();
65 { // checking smart graph
66 checkConcept<Graph, SmartGraph >();
68 checkGraph<SmartGraph>();
69 checkGraphNodeMap<SmartGraph>();
70 checkGraphEdgeMap<SmartGraph>();
72 { // checking full graph
73 checkConcept<Graph, FullGraph >();
75 { // checking full graph
76 checkConcept<Graph, HyperCubeGraph >();
79 std::cout << __FILE__ ": All tests passed.\n";