author | deba |
Thu, 11 Nov 2004 09:31:55 +0000 | |
changeset 980 | 0f1044b7a3af |
parent 959 | c80ef5912903 |
child 989 | ca95f8b5c931 |
permissions | -rw-r--r-- |
klao@946 | 1 |
// -*- c++ -*- |
alpar@906 | 2 |
|
klao@946 | 3 |
#include <iostream> |
klao@946 | 4 |
#include <vector> |
alpar@578 | 5 |
|
klao@959 | 6 |
#include <lemon/concept/graph.h> |
klao@946 | 7 |
#include <lemon/list_graph.h> |
klao@946 | 8 |
#include <lemon/smart_graph.h> |
klao@946 | 9 |
#include <lemon/full_graph.h> |
alpar@567 | 10 |
|
klao@946 | 11 |
#include "test_tools.h" |
klao@946 | 12 |
#include "graph_test.h" |
klao@946 | 13 |
#include "map_test.h" |
alpar@503 | 14 |
|
alpar@503 | 15 |
|
alpar@921 | 16 |
using namespace lemon; |
klao@959 | 17 |
using namespace lemon::concept; |
alpar@503 | 18 |
|
alpar@503 | 19 |
|
klao@946 | 20 |
int main() { |
klao@946 | 21 |
///\file |
klao@946 | 22 |
{ // checking graph components |
klao@946 | 23 |
function_requires<BaseGraphComponentConcept<BaseGraphComponent> >(); |
alpar@503 | 24 |
|
klao@946 | 25 |
function_requires<BaseIterableGraphComponentConcept<BaseIterableGraphComponent> >(); |
alpar@503 | 26 |
|
klao@946 | 27 |
function_requires<IDableGraphComponentConcept<IDableGraphComponent> >(); |
klao@946 | 28 |
function_requires<MaxIDableGraphComponentConcept<MaxIDableGraphComponent> >(); |
alpar@503 | 29 |
|
klao@946 | 30 |
function_requires<BaseExtendableGraphComponentConcept<BaseExtendableGraphComponent> >(); |
klao@946 | 31 |
function_requires<BaseErasableGraphComponentConcept<BaseErasableGraphComponent> >(); |
klao@946 | 32 |
function_requires<BaseClearableGraphComponentConcept<BaseClearableGraphComponent> >(); |
alpar@503 | 33 |
|
klao@946 | 34 |
function_requires<IterableGraphComponentConcept<IterableGraphComponent> >(); |
alpar@503 | 35 |
|
klao@946 | 36 |
function_requires<MappableGraphComponentConcept<MappableGraphComponent> >(); |
alpar@793 | 37 |
|
klao@946 | 38 |
function_requires<ExtendableGraphComponentConcept<ExtendableGraphComponent> >(); |
klao@946 | 39 |
function_requires<ErasableGraphComponentConcept<ErasableGraphComponent> >(); |
klao@946 | 40 |
function_requires<ClearableGraphComponentConcept<ClearableGraphComponent> >(); |
klao@946 | 41 |
} |
klao@946 | 42 |
{ // checking skeleton graphs |
klao@946 | 43 |
function_requires<StaticGraphConcept<StaticGraph> >(); |
klao@946 | 44 |
function_requires<ExtendableGraphConcept<ExtendableGraph> >(); |
klao@946 | 45 |
function_requires<ErasableGraphConcept<ErasableGraph> >(); |
klao@946 | 46 |
} |
klao@946 | 47 |
{ // checking list graph |
klao@946 | 48 |
function_requires<ErasableGraphConcept<ListGraph> >(); |
alpar@793 | 49 |
|
klao@946 | 50 |
checkGraph<ListGraph>(); |
klao@946 | 51 |
checkGraphNodeMap<ListGraph>(); |
klao@946 | 52 |
checkGraphEdgeMap<ListGraph>(); |
klao@946 | 53 |
} |
klao@946 | 54 |
{ // checking smart graph |
klao@946 | 55 |
function_requires<ExtendableGraphConcept<SmartGraph> >(); |
alpar@733 | 56 |
|
klao@946 | 57 |
checkGraph<SmartGraph>(); |
klao@946 | 58 |
checkGraphNodeMap<SmartGraph>(); |
klao@946 | 59 |
checkGraphEdgeMap<SmartGraph>(); |
alpar@503 | 60 |
} |
klao@946 | 61 |
{ // checking full graph |
klao@946 | 62 |
function_requires<StaticGraphConcept<FullGraph> >(); |
alpar@578 | 63 |
} |
alpar@503 | 64 |
|
alpar@503 | 65 |
std::cout << __FILE__ ": All tests passed.\n"; |
alpar@503 | 66 |
|
alpar@579 | 67 |
return 0; |
alpar@503 | 68 |
} |