alpar@906: /* -*- C++ -*-
alpar@906:  *
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@1359:  * (Egervary Research Group on Combinatorial Optimization, EGRES).
alpar@906:  *
alpar@906:  * Permission to use, modify and distribute this software is granted
alpar@906:  * provided that this copyright notice appears in all copies. For
alpar@906:  * precise terms see the accompanying LICENSE file.
alpar@906:  *
alpar@906:  * This software is provided "AS IS" with no warranty of any kind,
alpar@906:  * express or implied, and with no claim as to its suitability for any
alpar@906:  * purpose.
alpar@906:  *
alpar@906:  */
alpar@906: 
marci@849: #include<iostream>
klao@946: #include<lemon/concept_check.h>
klao@946: 
alpar@921: #include<lemon/smart_graph.h>
klao@959: #include<lemon/concept/graph.h>
klao@1909: #include<lemon/concept/ugraph.h>
deba@2231: #include<lemon/concept/bpugraph.h>
klao@946: 
alpar@921: #include<lemon/list_graph.h>
alpar@921: #include<lemon/full_graph.h>
alpar@1401: #include<lemon/graph_adaptor.h>
deba@1980: #include<lemon/ugraph_adaptor.h>
deba@2231: #include<lemon/bpugraph_adaptor.h>
marci@849: 
marci@870: #include"test/test_tools.h"
marci@870: #include"test/graph_test.h"
marci@849: 
marci@849: /**
marci@849: \file
alpar@1401: This test makes consistency checks of graph adaptors.
marci@849: 
alpar@878: \todo More extensive tests are needed 
marci@849: */
marci@849: 
alpar@921: using namespace lemon;
klao@959: using namespace lemon::concept;
marci@849: 
marci@849: 
marci@849: 
marci@849: int main() 
marci@849: {
klao@946:   {
deba@2111:     typedef Graph Graph;
deba@2111:     checkConcept<Graph, GraphAdaptor<Graph> >();
klao@946: 
deba@2111:     checkConcept<Graph, RevGraphAdaptor<Graph> >();
klao@946: 
deba@2111:     checkConcept<Graph, SubGraphAdaptor<Graph, 
marci@998:       Graph::NodeMap<bool> , Graph::EdgeMap<bool> > >();
deba@2111:     checkConcept<Graph, NodeSubGraphAdaptor<Graph, 
marci@998:       Graph::NodeMap<bool> > >();
deba@2111:     checkConcept<Graph, EdgeSubGraphAdaptor<Graph, 
marci@998:       Graph::EdgeMap<bool> > >();
marci@992:     
deba@2111:     checkConcept<Graph, ResGraphAdaptor<Graph, int, 
marci@998:       Graph::EdgeMap<int>, Graph::EdgeMap<int> > >();
klao@946: 
deba@2111:     checkConcept<Graph, ErasingFirstGraphAdaptor<Graph, 
marci@998:       Graph::NodeMap<Graph::Edge> > >(); 
marci@1383: 
deba@1980:     checkConcept<UGraph, UndirGraphAdaptor<Graph> >();
deba@1980: 
deba@1980:     checkConcept<UGraph, SubUGraphAdaptor<UGraph, 
deba@1980:       UGraph::NodeMap<bool> , UGraph::UEdgeMap<bool> > >();
deba@1980:     checkConcept<UGraph, NodeSubUGraphAdaptor<UGraph, 
deba@1980:       UGraph::NodeMap<bool> > >();
deba@1980:     checkConcept<UGraph, EdgeSubUGraphAdaptor<UGraph, 
deba@1980:       UGraph::UEdgeMap<bool> > >();
deba@1980: 
deba@2111:     checkConcept<Graph, DirUGraphAdaptor<UGraph, 
deba@1980:       UGraph::UEdgeMap<bool> > >();
deba@2231: 
deba@2231:     checkConcept<BpUGraph, BpUGraphAdaptor<BpUGraph> >();
deba@2231: 
deba@2231:     checkConcept<BpUGraph, SwapBpUGraphAdaptor<BpUGraph> >();
deba@2231: 
klao@946:   }
marci@849:   std::cout << __FILE__ ": All tests passed.\n";
marci@849: 
marci@849:   return 0;
marci@849: }