[906] | 1 | /* -*- C++ -*- |
---|
[921] | 2 | * src/test/graph_wrapper_test.cc - Part of LEMON, a generic C++ optimization library |
---|
[906] | 3 | * |
---|
[1164] | 4 | * Copyright (C) 2005 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
---|
[1359] | 5 | * (Egervary Research Group on Combinatorial Optimization, EGRES). |
---|
[906] | 6 | * |
---|
| 7 | * Permission to use, modify and distribute this software is granted |
---|
| 8 | * provided that this copyright notice appears in all copies. For |
---|
| 9 | * precise terms see the accompanying LICENSE file. |
---|
| 10 | * |
---|
| 11 | * This software is provided "AS IS" with no warranty of any kind, |
---|
| 12 | * express or implied, and with no claim as to its suitability for any |
---|
| 13 | * purpose. |
---|
| 14 | * |
---|
| 15 | */ |
---|
| 16 | |
---|
[849] | 17 | #include<iostream> |
---|
[946] | 18 | #include<lemon/concept_check.h> |
---|
| 19 | |
---|
[921] | 20 | #include<lemon/smart_graph.h> |
---|
[959] | 21 | #include<lemon/concept/graph.h> |
---|
[1383] | 22 | #include<lemon/concept/undir_graph.h> |
---|
[946] | 23 | |
---|
[921] | 24 | #include<lemon/list_graph.h> |
---|
| 25 | #include<lemon/full_graph.h> |
---|
| 26 | #include<lemon/graph_wrapper.h> |
---|
[849] | 27 | |
---|
[870] | 28 | #include"test/test_tools.h" |
---|
| 29 | #include"test/graph_test.h" |
---|
[849] | 30 | |
---|
| 31 | /** |
---|
| 32 | \file |
---|
[878] | 33 | This test makes consistency checks of graph wrappers. |
---|
[849] | 34 | |
---|
[878] | 35 | \todo More extensive tests are needed |
---|
[849] | 36 | */ |
---|
| 37 | |
---|
[921] | 38 | using namespace lemon; |
---|
[959] | 39 | using namespace lemon::concept; |
---|
[849] | 40 | |
---|
| 41 | |
---|
| 42 | |
---|
| 43 | int main() |
---|
| 44 | { |
---|
[946] | 45 | { |
---|
[998] | 46 | typedef StaticGraph Graph; |
---|
| 47 | checkConcept<StaticGraph, GraphWrapper<Graph> >(); |
---|
[946] | 48 | |
---|
[998] | 49 | checkConcept<StaticGraph, RevGraphWrapper<Graph> >(); |
---|
[946] | 50 | |
---|
[998] | 51 | checkConcept<StaticGraph, SubGraphWrapper<Graph, |
---|
| 52 | Graph::NodeMap<bool> , Graph::EdgeMap<bool> > >(); |
---|
| 53 | checkConcept<StaticGraph, NodeSubGraphWrapper<Graph, |
---|
| 54 | Graph::NodeMap<bool> > >(); |
---|
| 55 | checkConcept<StaticGraph, EdgeSubGraphWrapper<Graph, |
---|
| 56 | Graph::EdgeMap<bool> > >(); |
---|
[992] | 57 | |
---|
[998] | 58 | checkConcept<StaticGraph, SubBidirGraphWrapper<Graph, |
---|
| 59 | Graph::EdgeMap<bool>, Graph::EdgeMap<bool> > >(); |
---|
[1160] | 60 | // checkConcept<StaticGraph, BidirGraph<Graph> >(); |
---|
[998] | 61 | checkConcept<StaticGraph, ResGraphWrapper<Graph, int, |
---|
| 62 | Graph::EdgeMap<int>, Graph::EdgeMap<int> > >(); |
---|
[946] | 63 | |
---|
[998] | 64 | checkConcept<StaticGraph, ErasingFirstGraphWrapper<Graph, |
---|
| 65 | Graph::NodeMap<Graph::Edge> > >(); |
---|
[1383] | 66 | |
---|
| 67 | /// \bug why does not compile with StaticGraph |
---|
| 68 | checkConcept<BaseIterableUndirGraphConcept, UndirGraphWrapper<ListGraph> >(); |
---|
| 69 | checkConcept<IterableUndirGraphConcept, UndirGraphWrapper<ListGraph> >(); |
---|
| 70 | checkConcept<MappableUndirGraphConcept, UndirGraphWrapper<ListGraph> >(); |
---|
[946] | 71 | } |
---|
[849] | 72 | std::cout << __FILE__ ": All tests passed.\n"; |
---|
| 73 | |
---|
| 74 | return 0; |
---|
| 75 | } |
---|