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>
alpar@921: #include<lemon/smart_graph.h>
alpar@921: #include<lemon/skeletons/graph.h>
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;
marci@849: 
marci@849: 
marci@849: typedef SmartGraph Graph;
deba@891: 
deba@891: //Compile GraphWrapper
marci@849: typedef GraphWrapper<Graph> GW;
marci@849: template void checkCompileStaticGraph<GW>(GW &);
marci@849: 
deba@891: //Compile RevGraphWrapper
marci@849: typedef RevGraphWrapper<Graph> RevGW;
marci@849: template void checkCompileStaticGraph<RevGW>(RevGW &);
deba@891: 
deba@891: //Compile SubGraphWrapper
deba@891: typedef SubGraphWrapper<Graph, Graph::NodeMap<bool>, 
deba@891: 			Graph::EdgeMap<bool> > SubGW;
deba@891: template void checkCompileStaticGraph<SubGW>(SubGW &);
deba@891: 
marci@933: //Compile NodeSubGraphWrapper
marci@933: typedef NodeSubGraphWrapper<Graph, Graph::NodeMap<bool> > NodeSubGW;
marci@933: template void checkCompileStaticGraph<NodeSubGW>(NodeSubGW &);
marci@933: 
marci@933: //Compile EdgeSubGraphWrapper
marci@933: typedef EdgeSubGraphWrapper<Graph, Graph::EdgeMap<bool> > EdgeSubGW;
marci@933: template void checkCompileStaticGraph<EdgeSubGW>(EdgeSubGW &);
marci@933: 
deba@891: //Compile UndirGraphWrapper
deba@891: /// \bug UndirGraphWrapper cannot pass the StaticGraph test
deba@891: //typedef UndirGraphWrapper<Graph> UndirGW;
deba@891: //template void checkCompileStaticGraph<UndirGW>(UndirGW &);
deba@891: 
deba@891: //Compile UndirGraph
deba@891: //typedef UndirGraph<Graph> UndirG;
deba@891: //template void checkCompileStaticGraph<UndirG>(UndirG &);
deba@891: 
marci@892: //Compile SubBidirGraphWrapper
marci@892: typedef SubBidirGraphWrapper<Graph, Graph::EdgeMap<bool>, 
marci@892: 			     Graph::EdgeMap<bool> > SubBDGW;
marci@892: template void checkCompileStaticGraph<SubBDGW>(SubBDGW &);
deba@891: 
deba@891: //Compile BidirGraphWrapper
marci@892: typedef BidirGraphWrapper<Graph> BidirGW;
marci@892: template void checkCompileStaticGraph<BidirGW>(BidirGW &);
deba@891: 
deba@891: //Compile BidirGraph
marci@892: typedef BidirGraph<Graph> BidirG;
marci@892: template void checkCompileStaticGraph<BidirG>(BidirG &);
deba@891: 
deba@891: //Compile ResGraphWrapper
marci@892: typedef ResGraphWrapper<Graph, int, Graph::EdgeMap<int>, 
marci@892: 			Graph::EdgeMap<int> > ResGW;
marci@892: template void checkCompileStaticGraph<ResGW>(ResGW &);
deba@891: 
deba@891: //Compile ErasingFirstGraphWrapper
deba@891: typedef ErasingFirstGraphWrapper<Graph, Graph::NodeMap<Graph::Edge> > ErasingFirstGW;
deba@891: template void checkCompileStaticGraph<ErasingFirstGW>(ErasingFirstGW &);
marci@849: 
marci@849: 
marci@849: int main() 
marci@849: {
marci@849:   std::cout << __FILE__ ": All tests passed.\n";
marci@849: 
marci@849:   return 0;
marci@849: }