COIN-OR::LEMON - Graph Library

source: lemon-0.x/test/dijkstra_test.cc @ 2288:ef8af928c54e

Last change on this file since 2288:ef8af928c54e was 2260:4274224f8a7d, checked in by Alpar Juttner, 14 years ago

concept -> concepts (namespace & directory)

File size: 3.8 KB
RevLine 
[906]1/* -*- C++ -*-
2 *
[1956]3 * This file is a part of LEMON, a generic C++ optimization library
4 *
5 * Copyright (C) 2003-2006
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
[1359]7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
[906]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
[578]19#include "test_tools.h"
[921]20#include <lemon/smart_graph.h>
21#include <lemon/dijkstra.h>
[1283]22#include <lemon/path.h>
[1148]23#include <lemon/maps.h>
[2260]24#include <lemon/concepts/graph.h>
25#include <lemon/concepts/maps.h>
[921]26using namespace lemon;
[568]27
28const int PET_SIZE =5;
29
[570]30
[793]31void check_Dijkstra_BinHeap_Compile()
[570]32{
33  typedef int VType;
[2260]34  typedef concepts::Graph Graph;
[570]35
36  typedef Graph::Edge Edge;
37  typedef Graph::Node Node;
38  typedef Graph::EdgeIt EdgeIt;
39  typedef Graph::NodeIt NodeIt;
[2260]40  typedef concepts::ReadMap<Edge,VType> LengthMap;
[570]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);
[1148]51  //  DType::PredNodeMap pn(G);
[793]52  LengthMap cap;
[570]53
54  DType dijkstra_test(G,cap);
55
56  dijkstra_test.run(n);
57
58  l  = dijkstra_test.dist(n);
[1763]59  e  = dijkstra_test.predEdge(n);
[570]60  n  = dijkstra_test.predNode(n);
61  d  = dijkstra_test.distMap();
62  p  = dijkstra_test.predMap();
[1148]63  //  pn = dijkstra_test.predNodeMap();
[570]64  b  = dijkstra_test.reached(n);
[1283]65
[2247]66  Path<Graph> pp(G);
[1283]67  dijkstra_test.getPath(pp,n);
[570]68}
69
[1220]70void check_Dijkstra_Function_Compile()
71{
72  typedef int VType;
[2260]73  typedef concepts::Graph Graph;
[1220]74
75  typedef Graph::Edge Edge;
76  typedef Graph::Node Node;
77  typedef Graph::EdgeIt EdgeIt;
78  typedef Graph::NodeIt NodeIt;
[2260]79  typedef concepts::ReadMap<Edge,VType> LengthMap;
[1220]80   
[2135]81  Graph g;
82  dijkstra(g,LengthMap(),Node()).run();
83  dijkstra(g,LengthMap()).source(Node()).run();
84  dijkstra(g,LengthMap())
[2260]85    .predMap(concepts::WriteMap<Node,Edge>())
86    .distMap(concepts::WriteMap<Node,VType>())
[1220]87    .run(Node());
88 
89}
90
91
[568]92int main()
93{
94   
95  typedef SmartGraph Graph;
96
97  typedef Graph::Edge Edge;
98  typedef Graph::Node Node;
99  typedef Graph::EdgeIt EdgeIt;
100  typedef Graph::NodeIt NodeIt;
101  typedef Graph::EdgeMap<int> LengthMap;
102
103  Graph G;
104  Node s, t;
105  LengthMap cap(G);
106  PetStruct<Graph> ps = addPetersen(G,PET_SIZE);
[578]107   
[568]108  for(int i=0;i<PET_SIZE;i++) {
109    cap[ps.outcir[i]]=4;
110    cap[ps.incir[i]]=1;
111    cap[ps.chords[i]]=10;
112  }
113  s=ps.outer[0];
114  t=ps.inner[1];
115 
116  Dijkstra<Graph, LengthMap>
117        dijkstra_test(G, cap);
118  dijkstra_test.run(s);
119 
120  check(dijkstra_test.dist(t)==13,"Dijkstra found a wrong path.");
[585]121
122
[2247]123  Path<Graph> p(G);
[1283]124  check(dijkstra_test.getPath(p,t),"getPath() failed to set the path.");
125  check(p.length()==4,"getPath() found a wrong path.");
126 
127
[776]128  for(EdgeIt e(G); e!=INVALID; ++e) {
[986]129    Node u=G.source(e);
130    Node v=G.target(e);
[585]131    check( !dijkstra_test.reached(u) ||
132           (dijkstra_test.dist(v) - dijkstra_test.dist(u) <= cap[e]),
[986]133           "dist(target)-dist(source)- edge_length= "
[585]134           << dijkstra_test.dist(v) - dijkstra_test.dist(u)
135           - cap[e]);
136  }
137
138  ///\bug This works only for integer lengths
[780]139  for(NodeIt v(G); v!=INVALID; ++v){
140    check(dijkstra_test.reached(v),"Each node should be reached.");
[1763]141    if ( dijkstra_test.predEdge(v)!=INVALID ) {
142      Edge e=dijkstra_test.predEdge(v);
[986]143      Node u=G.source(e);
[780]144      check(u==dijkstra_test.predNode(v),"Wrong tree.");
[585]145      check(dijkstra_test.dist(v) - dijkstra_test.dist(u) == cap[e],
[780]146            "Wrong distance! Difference: "
[585]147            << std::abs(dijkstra_test.dist(v) - dijkstra_test.dist(u)
148                            - cap[e]));
149    }
[780]150  }
[1148]151
152 
153  {
[1218]154    NullMap<Node,Edge> myPredMap;
155    dijkstra(G,cap).predMap(myPredMap).run(s);
[1148]156  }
157  return 0;
[568]158}
Note: See TracBrowser for help on using the repository browser.