alpar@1956: /* -*- C++ -*-
alpar@1956:  *
alpar@1956:  * This file is a part of LEMON, a generic C++ optimization library
alpar@1956:  *
alpar@1956:  * Copyright (C) 2003-2006
alpar@1956:  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
alpar@1956:  * (Egervary Research Group on Combinatorial Optimization, EGRES).
alpar@1956:  *
alpar@1956:  * Permission to use, modify and distribute this software is granted
alpar@1956:  * provided that this copyright notice appears in all copies. For
alpar@1956:  * precise terms see the accompanying LICENSE file.
alpar@1956:  *
alpar@1956:  * This software is provided "AS IS" with no warranty of any kind,
alpar@1956:  * express or implied, and with no claim as to its suitability for any
alpar@1956:  * purpose.
alpar@1956:  *
alpar@1956:  */
alpar@906: 
klao@946: #include <iostream>
klao@946: #include <vector>
alpar@578: 
klao@959: #include <lemon/concept/graph.h>
klao@946: #include <lemon/list_graph.h>
klao@946: #include <lemon/smart_graph.h>
klao@946: #include <lemon/full_graph.h>
deba@1712: #include <lemon/hypercube_graph.h>
alpar@567: 
klao@946: #include "test_tools.h"
klao@946: #include "graph_test.h"
klao@946: #include "map_test.h"
alpar@503: 
alpar@503: 
alpar@921: using namespace lemon;
klao@959: using namespace lemon::concept;
alpar@503: 
alpar@503: 
klao@946: int main() {
klao@946:   { // checking graph components
deba@989:     checkConcept<BaseGraphComponent, BaseGraphComponent >();
alpar@503: 
deba@2121:     checkConcept<IDableGraphComponent<>, 
deba@2121:       IDableGraphComponent<> >();
alpar@503: 
deba@2121:     checkConcept<IterableGraphComponent<>, 
deba@2121:       IterableGraphComponent<> >();
alpar@503: 
deba@2121:     checkConcept<MappableGraphComponent<>, 
deba@2121:       MappableGraphComponent<> >();
alpar@793: 
klao@946:   }
klao@946:   { // checking skeleton graphs
deba@2121:     checkConcept<Graph, Graph>();
klao@946:   }
klao@946:   { // checking list graph
deba@2111:     checkConcept<Graph, ListGraph >();
deba@2121:     checkConcept<AlterableGraphComponent<>, ListGraph>();
deba@2121:     checkConcept<ExtendableGraphComponent<>, ListGraph>();
deba@2121:     checkConcept<ClearableGraphComponent<>, ListGraph>();
deba@2121:     checkConcept<ErasableGraphComponent<>, ListGraph>();
alpar@793: 
klao@946:     checkGraph<ListGraph>();
klao@946:     checkGraphNodeMap<ListGraph>();
klao@946:     checkGraphEdgeMap<ListGraph>();
klao@946:   }
klao@946:   { // checking smart graph
deba@2111:     checkConcept<Graph, SmartGraph >();
alpar@733: 
klao@946:     checkGraph<SmartGraph>();
klao@946:     checkGraphNodeMap<SmartGraph>();
klao@946:     checkGraphEdgeMap<SmartGraph>();
alpar@503:   }
klao@946:   { // checking full graph
deba@2111:     checkConcept<Graph, FullGraph >();
alpar@578:   }
deba@1712:   { // checking full graph
deba@2111:     checkConcept<Graph, HyperCubeGraph >();
deba@1712:   }
alpar@503: 
alpar@503:   std::cout << __FILE__ ": All tests passed.\n";
alpar@503: 
alpar@579:   return 0;
alpar@503: }