COIN-OR::LEMON - Graph Library

source: lemon-0.x/src/test/test_tools.h @ 878:86b42ec55f3e

Last change on this file since 878:86b42ec55f3e was 844:9bf990cb066d, checked in by Balazs Dezso, 17 years ago

Bug fix in the symmetric maps.
Faster map initialization.
Iterators and Containers STL compatible.

File size: 2.0 KB
RevLine 
[844]1// -*- c++ -*-
[574]2#ifndef HUGO_TEST_TEST_TOOLS_H
3#define HUGO_TEST_TEST_TOOLS_H
4
5//! \ingroup misc
6//! \file
7//! \brief Some utility to write test programs.
8
9
10#include<iostream>
11#include<vector>
12
[679]13///If \c rc is fail, writes an error message end exit.
[574]14
15///If \c rc is fail, writes an error message end exit.
16///The error message contains the file name and the line number of the
[679]17///source code in a standard from, which makes it possible to go there
[574]18///using good source browsers like e.g. \c emacs.
19///
20///For example
21///\code check(0==1,"This is obviously false.");\endcode will
22///print this (and then exits).
23///\verbatim graph_test.cc:123: error: This is obviously false. \endverbatim
[774]24///
25///\todo It should be in \c error.h
[574]26#define check(rc, msg) \
27  if(!(rc)) { \
28    std::cerr << __FILE__ ":" << __LINE__ << ": error: " << msg << std::endl; \
29    exit(1); \
30  } else { } \
31
32///Structure returned by \ref addPetersen().
33
34///Structure returned by \ref addPetersen().
35///
36template<class Graph> struct PetStruct
37{
[825]38  ///Vector containing the outer nodes.
39  std::vector<typename Graph::Node> outer;
40  ///Vector containing the inner nodes.
41  std::vector<typename Graph::Node> inner;
42  ///Vector containing the edges of the inner circle.
43  std::vector<typename Graph::Edge> incir;
44  ///Vector containing the edges of the outer circle.
45  std::vector<typename Graph::Edge> outcir;
46  ///Vector containing the chord edges.
47  std::vector<typename Graph::Edge> chords;
[574]48};
49
[721]50
51
[574]52///Adds a Petersen graph to \c G.
53
54///Adds a Petersen graph to \c G.
[825]55///\return The nodes end edges og the generated graph.
[721]56
57template<typename Graph>
58PetStruct<Graph> addPetersen(Graph &G,int num=5)
[574]59{
60  PetStruct<Graph> n;
61
62  for(int i=0;i<num;i++) {
63    n.outer.push_back(G.addNode());
64    n.inner.push_back(G.addNode());
65  }
66
67 for(int i=0;i<num;i++) {
68   n.chords.push_back(G.addEdge(n.outer[i],n.inner[i]));
69   n.outcir.push_back(G.addEdge(n.outer[i],n.outer[(i+1)%5]));
70   n.incir.push_back(G.addEdge(n.inner[i],n.inner[(i+2)%5]));
71  }
72 return n;
73}
74
75
76
77#endif
Note: See TracBrowser for help on using the repository browser.