[906] | 1 | /* -*- C++ -*- |
---|
[921] | 2 | * src/test/graph_wrapper_test.cc - Part of LEMON, a generic C++ optimization library |
---|
[906] | 3 | * |
---|
| 4 | * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
---|
| 5 | * (Egervary Combinatorial Optimization Research Group, EGRES). |
---|
| 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> |
---|
[946] | 22 | |
---|
[921] | 23 | #include<lemon/list_graph.h> |
---|
| 24 | #include<lemon/full_graph.h> |
---|
| 25 | #include<lemon/graph_wrapper.h> |
---|
[849] | 26 | |
---|
[870] | 27 | #include"test/test_tools.h" |
---|
| 28 | #include"test/graph_test.h" |
---|
[849] | 29 | |
---|
| 30 | /** |
---|
| 31 | \file |
---|
[878] | 32 | This test makes consistency checks of graph wrappers. |
---|
[849] | 33 | |
---|
[878] | 34 | \todo More extensive tests are needed |
---|
[849] | 35 | */ |
---|
| 36 | |
---|
[921] | 37 | using namespace lemon; |
---|
[959] | 38 | using namespace lemon::concept; |
---|
[849] | 39 | |
---|
| 40 | |
---|
| 41 | |
---|
| 42 | int main() |
---|
| 43 | { |
---|
[946] | 44 | { |
---|
[989] | 45 | checkConcept<StaticGraph, GraphWrapper<StaticGraph> >(); |
---|
[946] | 46 | |
---|
[997] | 47 | checkConcept<StaticGraph, RevGraphWrapper<StaticGraph> >(); |
---|
[946] | 48 | |
---|
[992] | 49 | checkConcept<StaticGraph, SubGraphWrapper<StaticGraph, |
---|
| 50 | StaticGraph::NodeMap<bool> , StaticGraph::EdgeMap<bool> > >(); |
---|
| 51 | checkConcept<StaticGraph, NodeSubGraphWrapper<StaticGraph, |
---|
| 52 | StaticGraph::NodeMap<bool> > >(); |
---|
| 53 | checkConcept<StaticGraph, EdgeSubGraphWrapper<StaticGraph, |
---|
| 54 | StaticGraph::EdgeMap<bool> > >(); |
---|
| 55 | |
---|
| 56 | checkConcept<StaticGraph, SubBidirGraphWrapper<StaticGraph, |
---|
| 57 | StaticGraph::EdgeMap<bool>, StaticGraph::EdgeMap<bool> > >(); |
---|
[946] | 58 | |
---|
[992] | 59 | checkConcept<StaticGraph, BidirGraph<StaticGraph> >(); |
---|
[946] | 60 | |
---|
[992] | 61 | checkConcept<StaticGraph, ResGraphWrapper<StaticGraph, int, |
---|
| 62 | StaticGraph::EdgeMap<int>, StaticGraph::EdgeMap<int> > >(); |
---|
[946] | 63 | |
---|
[970] | 64 | // function_requires<StaticGraphConcept<ErasingFirstGraphWrapper<Graph, Graph::NodeMap<Graph::Edge> > > >(); |
---|
[946] | 65 | } |
---|
[849] | 66 | std::cout << __FILE__ ": All tests passed.\n"; |
---|
| 67 | |
---|
| 68 | return 0; |
---|
| 69 | } |
---|