COIN-OR::LEMON - Graph Library

source: lemon-0.x/test/dijkstra_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.9 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 "test_tools.h"
20#include <lemon/smart_graph.h>
21#include <lemon/dijkstra.h>
22#include <lemon/path.h>
23#include <lemon/maps.h>
24#include <lemon/concepts/graph.h>
25#include <lemon/concepts/maps.h>
26using namespace lemon;
27
28const int PET_SIZE =5;
29
30
31void check_Dijkstra_BinHeap_Compile()
32{
33  typedef int VType;
34  typedef concepts::Graph Graph;
35
36  typedef Graph::Edge Edge;
37  typedef Graph::Node Node;
38  typedef Graph::EdgeIt EdgeIt;
39  typedef Graph::NodeIt NodeIt;
40  typedef concepts::ReadMap<Edge,VType> LengthMap;
41 
42  typedef Dijkstra<Graph, LengthMap> DType;
43 
44  Graph G;
45  Node n;
46  Edge e;
47  VType l;
48  bool b;
49  DType::DistMap d(G);
50  DType::PredMap p(G);
51  //  DType::PredNodeMap pn(G);
52  LengthMap cap;
53
54  DType dijkstra_test(G,cap);
55
56  dijkstra_test.run(n);
57
58  l  = dijkstra_test.dist(n);
59  e  = dijkstra_test.predEdge(n);
60  n  = dijkstra_test.predNode(n);
61  d  = dijkstra_test.distMap();
62  p  = dijkstra_test.predMap();
63  //  pn = dijkstra_test.predNodeMap();
64  b  = dijkstra_test.reached(n);
65
66  Path<Graph> pp = dijkstra_test.path(n);
67}
68
69void check_Dijkstra_Function_Compile()
70{
71  typedef int VType;
72  typedef concepts::Graph Graph;
73
74  typedef Graph::Edge Edge;
75  typedef Graph::Node Node;
76  typedef Graph::EdgeIt EdgeIt;
77  typedef Graph::NodeIt NodeIt;
78  typedef concepts::ReadMap<Edge,VType> LengthMap;
79   
80  Graph g;
81  dijkstra(g,LengthMap(),Node()).run();
82  dijkstra(g,LengthMap()).source(Node()).run();
83  dijkstra(g,LengthMap())
84    .predMap(concepts::WriteMap<Node,Edge>())
85    .distMap(concepts::WriteMap<Node,VType>())
86    .run(Node());
87 
88}
89
90
91int main()
92{
93   
94  typedef SmartGraph Graph;
95
96  typedef Graph::Edge Edge;
97  typedef Graph::Node Node;
98  typedef Graph::EdgeIt EdgeIt;
99  typedef Graph::NodeIt NodeIt;
100  typedef Graph::EdgeMap<int> LengthMap;
101
102  Graph G;
103  Node s, t;
104  LengthMap cap(G);
105  PetStruct<Graph> ps = addPetersen(G,PET_SIZE);
106   
107  for(int i=0;i<PET_SIZE;i++) {
108    cap[ps.outcir[i]]=4;
109    cap[ps.incir[i]]=1;
110    cap[ps.chords[i]]=10;
111  }
112  s=ps.outer[0];
113  t=ps.inner[1];
114 
115  Dijkstra<Graph, LengthMap>
116        dijkstra_test(G, cap);
117  dijkstra_test.run(s);
118 
119  check(dijkstra_test.dist(t)==13,"Dijkstra found a wrong path.");
120
121
122  Path<Graph> p = dijkstra_test.path(t);
123  check(p.length()==4,"getPath() found a wrong path.");
124  check(checkPath(G, p),"path() found a wrong path.");
125  check(pathSource(G, p) == s,"path() found a wrong path.");
126  check(pathTarget(G, p) == t,"path() found a wrong path.");
127 
128
129  for(EdgeIt e(G); e!=INVALID; ++e) {
130    Node u=G.source(e);
131    Node v=G.target(e);
132    check( !dijkstra_test.reached(u) ||
133           (dijkstra_test.dist(v) - dijkstra_test.dist(u) <= cap[e]),
134           "dist(target)-dist(source)- edge_length= "
135           << dijkstra_test.dist(v) - dijkstra_test.dist(u)
136           - cap[e]);
137  }
138
139  ///\bug This works only for integer lengths
140  for(NodeIt v(G); v!=INVALID; ++v){
141    check(dijkstra_test.reached(v),"Each node should be reached.");
142    if ( dijkstra_test.predEdge(v)!=INVALID ) {
143      Edge e=dijkstra_test.predEdge(v);
144      Node u=G.source(e);
145      check(u==dijkstra_test.predNode(v),"Wrong tree.");
146      check(dijkstra_test.dist(v) - dijkstra_test.dist(u) == cap[e],
147            "Wrong distance! Difference: "
148            << std::abs(dijkstra_test.dist(v) - dijkstra_test.dist(u)
149                            - cap[e]));
150    }
151  }
152
153 
154  {
155    NullMap<Node,Edge> myPredMap;
156    dijkstra(G,cap).predMap(myPredMap).run(s);
157  }
158  return 0;
159}
Note: See TracBrowser for help on using the repository browser.