COIN-OR::LEMON - Graph Library

source: lemon-0.x/test/graph_factory_test.cc @ 2391:14a343be7a5a

Last change on this file since 2391:14a343be7a5a was 2391:14a343be7a5a, checked in by Alpar Juttner, 12 years ago

Happy New Year to all source files!

File size: 3.8 KB
Line 
1/* -*- C++ -*-
2 *
3 * This file is a part of LEMON, a generic C++ optimization library
4 *
5 * Copyright (C) 2003-2007
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 */
18
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>
25
26#include"test_tools.h"
27#include"graph_test.h"
28
29/**
30\file
31This test makes consistency checks of list graph structures.
32
33G.addNode(), G.addEdge(), G.source(), G.target()
34
35\todo Checks for empty graphs and isolated points.
36conversion.
37*/
38
39using namespace lemon;
40
41template<class Graph> void bidirPetersen(Graph &G)
42{
43  typedef typename Graph::Edge Edge;
44  typedef typename Graph::EdgeIt EdgeIt;
45 
46  checkGraphEdgeList(G,15);
47 
48  std::vector<Edge> ee;
49 
50  for(EdgeIt e(G);e!=INVALID;++e) ee.push_back(e);
51
52  for(typename std::vector<Edge>::iterator p=ee.begin();p!=ee.end();p++)
53    G.addEdge(G.target(*p),G.source(*p));
54}
55
56template<class Graph> void checkPetersen(Graph &G)
57{
58  typedef typename Graph::Node Node;
59
60  typedef typename Graph::EdgeIt EdgeIt;
61  typedef typename Graph::NodeIt NodeIt;
62
63  checkGraphNodeList(G,10);
64  checkGraphEdgeList(G,30);
65
66  for(NodeIt n(G);n!=INVALID;++n) {
67    checkGraphInEdgeList(G,n,3);
68    checkGraphOutEdgeList(G,n,3);
69  } 
70}
71
72//Compile Graph
73template void lemon::concepts::checkCompileGraph<concepts::Graph>
74(concepts::Graph &);
75
76template
77void lemon::concepts::checkCompileGraph<concepts::Graph>
78(concepts::Graph &);
79
80template
81void lemon::concepts::checkCompileGraph<concepts::Graph>
82(concepts::Graph &);
83
84//Compile SmartGraph
85template
86void lemon::concepts::checkCompileGraph<SmartGraph>(SmartGraph &);
87template
88void lemon::concepts::checkCompileGraphFindEdge<SmartGraph>(SmartGraph &);
89
90//Compile SymSmartGraph
91//template void hugo::checkCompileGraph<SymSmartGraph>(SymSmartGraph &);
92//template void hugo::checkCompileGraphFindEdge<SymSmartGraph>(SymSmartGraph &);
93
94//Compile ListGraph
95template
96void lemon::concepts::checkCompileGraph<ListGraph>(ListGraph &);
97template
98void lemon::concepts::checkCompileGraph<ListGraph>(ListGraph &);
99template
100void lemon::concepts::checkCompileGraphFindEdge<ListGraph>(ListGraph &);
101
102
103//Compile SymListGraph
104//template void hugo::checkCompileGraph<SymListGraph>(SymListGraph &);
105//template void hugo::checkCompileGraph<SymListGraph>(SymListGraph &);
106//template void hugo::checkCompileGraphFindEdge<SymListGraph>(SymListGraph &);
107
108//Compile FullGraph
109template void lemon::concepts::checkCompileGraph<FullGraph>(FullGraph &);
110template
111void lemon::concepts::checkCompileGraphFindEdge<FullGraph>(FullGraph &);
112
113
114int 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  }
138
139  ///\file
140  ///\todo map tests.
141  ///\todo copy constr tests.
142
143
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> > >();
151
152
153  std::cout << __FILE__ ": All tests passed.\n";
154
155  return 0;
156}
Note: See TracBrowser for help on using the repository browser.