marci@849: #include<iostream>
marci@849: #include<hugo/smart_graph.h>
marci@849: #include<hugo/skeletons/graph.h>
marci@849: #include<hugo/list_graph.h>
marci@849: #include<hugo/full_graph.h>
marci@849: #include<hugo/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
marci@849: This test makes consistency checks of list graph structures.
marci@849: 
marci@849: G.addNode(), G.addEdge(), G.tail(), G.head()
marci@849: 
marci@849: \todo Checks for empty graphs and isolated points.
marci@849: conversion.
marci@849: */
marci@849: 
marci@849: using namespace hugo;
marci@849: 
marci@870: // template<class Graph> void bidirPetersen(Graph &G)
marci@870: // {
marci@870: //   typedef typename Graph::Edge Edge;
marci@870: //   typedef typename Graph::EdgeIt EdgeIt;
marci@849:   
marci@870: //   checkGraphEdgeList(G,15);
marci@849:   
marci@870: //   std::vector<Edge> ee;
marci@849:   
marci@870: //   for(EdgeIt e(G);e!=INVALID;++e) ee.push_back(e);
marci@849: 
marci@870: //   for(typename std::vector<Edge>::iterator p=ee.begin();p!=ee.end();p++)
marci@870: //     G.addEdge(G.head(*p),G.tail(*p));
marci@870: // }
marci@849: 
marci@870: // template<class Graph> void checkPetersen(Graph &G)
marci@870: // {
marci@870: //   typedef typename Graph::Node Node;
marci@849: 
marci@870: //   typedef typename Graph::EdgeIt EdgeIt;
marci@870: //   typedef typename Graph::NodeIt NodeIt;
marci@849: 
marci@870: //   checkGraphNodeList(G,10);
marci@870: //   checkGraphEdgeList(G,30);
marci@849: 
marci@870: //   for(NodeIt n(G);n!=INVALID;++n) {
marci@870: //     checkGraphInEdgeList(G,n,3);
marci@870: //     checkGraphOutEdgeList(G,n,3);
marci@870: //     ++n;
marci@870: //   }  
marci@870: // }
marci@849: 
marci@870: // //Compile GraphSkeleton
marci@870: // template void checkCompileStaticGraph<skeleton::StaticGraphSkeleton>
marci@870: // (skeleton::StaticGraphSkeleton &);
marci@849: 
alpar@873: // template void checkCompileGraph<skeleton::ExtendableGraphSkeleton>
alpar@873: // (skeleton::ExtendableGraphSkeleton &);
marci@849: 
marci@870: // template void checkCompileErasableGraph<skeleton::ErasableGraphSkeleton>
marci@870: // (skeleton::ErasableGraphSkeleton &);
marci@849: 
marci@849: //Compile SmartGraph
marci@849: typedef SmartGraph Graph;
marci@849: typedef GraphWrapper<Graph> GW;
marci@849: template void checkCompileStaticGraph<GW>(GW &);
marci@849: //template void checkCompileGraphFindEdge<SmartGraph>(SmartGraph &);
marci@849: 
marci@849: //Compile SymSmartGraph
marci@849: typedef RevGraphWrapper<Graph> RevGW;
marci@849: template void checkCompileStaticGraph<RevGW>(RevGW &);
marci@849: //template void checkCompileGraphFindEdge<SymSmartGraph>(SymSmartGraph &);
marci@849: 
marci@849: // //Compile ListGraph
marci@849: // template void checkCompileGraph<ListGraph>(ListGraph &);
marci@849: // template void checkCompileErasableGraph<ListGraph>(ListGraph &);
marci@849: // template void checkCompileGraphFindEdge<ListGraph>(ListGraph &);
marci@849: 
marci@849: 
marci@849: // //Compile SymListGraph
marci@849: // template void checkCompileGraph<SymListGraph>(SymListGraph &);
marci@849: // template void checkCompileErasableGraph<SymListGraph>(SymListGraph &);
marci@849: // template void checkCompileGraphFindEdge<SymListGraph>(SymListGraph &);
marci@849: 
marci@849: // //Compile FullGraph
marci@849: // template void checkCompileStaticGraph<FullGraph>(FullGraph &);
marci@849: // template void checkCompileGraphFindEdge<FullGraph>(FullGraph &);
marci@849: 
marci@849: // //Compile EdgeSet <ListGraph>
marci@849: // template void checkCompileGraph<EdgeSet <ListGraph> >(EdgeSet <ListGraph> &);
marci@849: // template void checkCompileGraphEraseEdge<EdgeSet <ListGraph> >
marci@849: // (EdgeSet <ListGraph> &);
marci@849: // template void checkCompileGraphFindEdge<EdgeSet <ListGraph> >
marci@849: // (EdgeSet <ListGraph> &);
marci@849: 
marci@849: // //Compile EdgeSet <NodeSet>
marci@849: // template void checkCompileGraph<EdgeSet <NodeSet> >(EdgeSet <NodeSet> &);
marci@849: // template void checkCompileGraphEraseEdge<EdgeSet <NodeSet> >
marci@849: // (EdgeSet <NodeSet> &);
marci@849: // template void checkCompileGraphFindEdge<EdgeSet <NodeSet> >
marci@849: // (EdgeSet <NodeSet> &);
marci@849: 
marci@849: 
marci@849: int main() 
marci@849: {
marci@849:  //  {
marci@849: //     SmartGraph G;
marci@849: //     addPetersen(G);
marci@849: //     bidirPetersen(G);
marci@849: //     checkPetersen(G);
marci@849: //   }
marci@849: //   {
marci@849: //     ListGraph G;
marci@849: //     addPetersen(G);
marci@849: //     bidirPetersen(G);
marci@849: //     checkPetersen(G);
marci@849: //   }
marci@849: //   {
marci@849: //     SymSmartGraph G;
marci@849: //     addPetersen(G);
marci@849: //     checkPetersen(G);
marci@849: //   }
marci@849: //   {
marci@849: //     SymListGraph G;
marci@849: //     addPetersen(G);
marci@849: //     checkPetersen(G);
marci@849: //   }
marci@849: 
marci@849:   ///\file
marci@849:   ///\todo map tests.
marci@849:   ///\todo copy constr tests.
marci@849: 
marci@849:   std::cout << __FILE__ ": All tests passed.\n";
marci@849: 
marci@849:   return 0;
marci@849: }