alpar@906: /* -*- C++ -*-
alpar@921:  * src/test/graph_wrapper_test.cc - Part of LEMON, a generic C++ optimization library
alpar@906:  *
alpar@906:  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
alpar@906:  * (Egervary Combinatorial Optimization Research Group, 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@946: 
alpar@921: #include<lemon/list_graph.h>
alpar@921: #include<lemon/full_graph.h>
alpar@921: #include<lemon/graph_wrapper.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@878: This test makes consistency checks of graph wrappers.
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: typedef SmartGraph Graph;
deba@891: 
marci@849: 
marci@849: int main() 
marci@849: {
klao@946:   {
klao@946:     function_requires<StaticGraphConcept<GraphWrapper<Graph> > >();
klao@946: 
marci@970: //     function_requires<StaticGraphConcept<RevGraphWrapper<Graph> > >();
klao@946: 
marci@970: //     function_requires<StaticGraphConcept<SubGraphWrapper<Graph, Graph::NodeMap<bool> , Graph::EdgeMap<bool> > > >();
marci@970: //     function_requires<StaticGraphConcept<NodeSubGraphWrapper<Graph, Graph::NodeMap<bool> > > >();
marci@970: //     function_requires<StaticGraphConcept<EdgeSubGraphWrapper<Graph, Graph::EdgeMap<bool> > > >();
klao@946: 
marci@970: //     function_requires<StaticGraphConcept<SubBidirGraphWrapper<Graph, Graph::EdgeMap<bool>, Graph::EdgeMap<bool> > > > ();
klao@946: 
marci@970: //     function_requires<StaticGraphConcept<BidirGraph<Graph> > >();
klao@946: 
marci@970: //     function_requires<StaticGraphConcept<ResGraphWrapper<Graph, int, Graph::EdgeMap<int>, Graph::EdgeMap<int> > > >();
klao@946: 
marci@970: //     function_requires<StaticGraphConcept<ErasingFirstGraphWrapper<Graph, Graph::NodeMap<Graph::Edge> > > >();
klao@946:   }
marci@849:   std::cout << __FILE__ ": All tests passed.\n";
marci@849: 
marci@849:   return 0;
marci@849: }