lemon-0.x: test/graph_factory_test.cc@054566ac0934

     1 /* -*- C++ -*-

     2  *

     3  * This file is a part of LEMON, a generic C++ optimization library

     4  *

     5  * Copyright (C) 2003-2008

     6  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

     7  * (Egervary Research Group on Combinatorial Optimization, EGRES).

     8  *

     9  * Permission to use, modify and distribute this software is granted

    10  * provided that this copyright notice appears in all copies. For

    11  * precise terms see the accompanying LICENSE file.

    12  *

    13  * This software is provided "AS IS" with no warranty of any kind,

    14  * express or implied, and with no claim as to its suitability for any

    15  * purpose.

    16  *

    17  */

    19 #include<iostream>

    20 #include<lemon/smart_graph.h>

    21 #include<lemon/concepts/graph.h>

    22 #include<lemon/concepts/maps.h>

    23 #include<lemon/list_graph_base.h>

    24 #include<lemon/full_graph.h>

    26 #include"test_tools.h"

    27 #include"graph_test.h"

    29 /**

    30 \file

    31 This test makes consistency checks of list graph structures.

    33 G.addNode(), G.addEdge(), G.source(), G.target()

    35 \todo Checks for empty graphs and isolated points.

    36 conversion.

    37 */

    39 using namespace lemon;

    41 template<class Graph> void bidirPetersen(Graph &G)

    42 {

    43   typedef typename Graph::Edge Edge;

    44   typedef typename Graph::EdgeIt EdgeIt;

    46   checkGraphEdgeList(G,15);

    48   std::vector<Edge> ee;

    50   for(EdgeIt e(G);e!=INVALID;++e) ee.push_back(e);

    52   for(typename std::vector<Edge>::iterator p=ee.begin();p!=ee.end();p++)

    53     G.addEdge(G.target(*p),G.source(*p));

    54 }

    56 template<class Graph> void checkPetersen(Graph &G)

    57 {

    58   typedef typename Graph::Node Node;

    60   typedef typename Graph::EdgeIt EdgeIt;

    61   typedef typename Graph::NodeIt NodeIt;

    63   checkGraphNodeList(G,10);

    64   checkGraphEdgeList(G,30);

    66   for(NodeIt n(G);n!=INVALID;++n) {

    67     checkGraphInEdgeList(G,n,3);

    68     checkGraphOutEdgeList(G,n,3);

    69   }

    70 }

    72 //Compile Graph

    73 template void lemon::concepts::checkCompileGraph<concepts::Graph>

    74 (concepts::Graph &);

    76 template

    77 void lemon::concepts::checkCompileGraph<concepts::Graph>

    78 (concepts::Graph &);

    80 template

    81 void lemon::concepts::checkCompileGraph<concepts::Graph>

    82 (concepts::Graph &);

    84 //Compile SmartGraph

    85 template

    86 void lemon::concepts::checkCompileGraph<SmartGraph>(SmartGraph &);

    87 template

    88 void lemon::concepts::checkCompileGraphFindEdge<SmartGraph>(SmartGraph &);

    90 //Compile SymSmartGraph

    91 //template void hugo::checkCompileGraph<SymSmartGraph>(SymSmartGraph &);

    92 //template void hugo::checkCompileGraphFindEdge<SymSmartGraph>(SymSmartGraph &);

    94 //Compile ListGraph

    95 template

    96 void lemon::concepts::checkCompileGraph<ListGraph>(ListGraph &);

    97 template

    98 void lemon::concepts::checkCompileGraph<ListGraph>(ListGraph &);

    99 template

   100 void lemon::concepts::checkCompileGraphFindEdge<ListGraph>(ListGraph &);

   103 //Compile SymListGraph

   104 //template void hugo::checkCompileGraph<SymListGraph>(SymListGraph &);

   105 //template void hugo::checkCompileGraph<SymListGraph>(SymListGraph &);

   106 //template void hugo::checkCompileGraphFindEdge<SymListGraph>(SymListGraph &);

   108 //Compile FullGraph

   109 template void lemon::concepts::checkCompileGraph<FullGraph>(FullGraph &);

   110 template

   111 void lemon::concepts::checkCompileGraphFindEdge<FullGraph>(FullGraph &);

   114 int main()

   115 {

   116   {

   117     SmartGraph G;

   118     addPetersen(G);

   119     bidirPetersen(G);

   120     checkPetersen(G);

   121   }

   122   {

   123     ListGraph G;

   124     addPetersen(G);

   125     bidirPetersen(G);

   126     checkPetersen(G);

   127   }

   128   {

   129     //    SymSmartGraph G;

   130     //    addPetersen(G);

   131     //    checkPetersen(G);

   132   }

   133   {

   134     //    SymListGraph G;

   135     //    addPetersen(G);

   136     //    checkPetersen(G);

   137   }

   139   ///\file

   140   ///\todo map tests.

   141   ///\todo copy constr tests.

   144   // Some map tests.

   145   // FIXME: These shouldn't be here.

   146   using namespace concepts;

   147   function_requires< ReadMapConcept< ReadMap<int,int> > >();

   148   function_requires< WriteMapConcept< WriteMap<int,int> > >();

   149   function_requires< ReadWriteMapConcept< ReadWriteMap<int,int> > >();

   150   function_requires< ReferenceMapConcept< ReferenceMap<int,int> > >();

   153   std::cout << __FILE__ ": All tests passed.\n";

   155   return 0;

   156 }

author	kpeter
	Thu, 28 Feb 2008 02:54:27 +0000
changeset 2581	054566ac0934
parent 2391	14a343be7a5a
permissions	-rw-r--r--