COIN-OR::LEMON - Graph Library

source: lemon-0.x/test/dijkstra_test.cc @ 2100:6fbe90faf02a

Last change on this file since 2100:6fbe90faf02a was 1956:a055123339d5, checked in by Alpar Juttner, 14 years ago

Unified copyright notices

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>
[959]24#include <lemon/concept/graph.h>
25#include <lemon/concept/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;
[959]34  typedef concept::StaticGraph Graph;
[570]35
36  typedef Graph::Edge Edge;
37  typedef Graph::Node Node;
38  typedef Graph::EdgeIt EdgeIt;
39  typedef Graph::NodeIt NodeIt;
[959]40  typedef concept::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
66  DirPath<Graph> pp(G);
67  dijkstra_test.getPath(pp,n);
[570]68}
69
[1220]70void check_Dijkstra_Function_Compile()
71{
72  typedef int VType;
73  typedef concept::StaticGraph Graph;
74
75  typedef Graph::Edge Edge;
76  typedef Graph::Node Node;
77  typedef Graph::EdgeIt EdgeIt;
78  typedef Graph::NodeIt NodeIt;
79  typedef concept::ReadMap<Edge,VType> LengthMap;
80   
81  dijkstra(Graph(),LengthMap(),Node()).run();
82  dijkstra(Graph(),LengthMap()).source(Node()).run();
83  dijkstra(Graph(),LengthMap())
84    .predMap(concept::WriteMap<Node,Edge>())
85    .distMap(concept::WriteMap<Node,VType>())
86    .run(Node());
87 
88}
89
90
[568]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);
[578]106   
[568]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.");
[585]120
121
[1283]122  DirPath<Graph> p(G);
123  check(dijkstra_test.getPath(p,t),"getPath() failed to set the path.");
124  check(p.length()==4,"getPath() found a wrong path.");
125 
126
[776]127  for(EdgeIt e(G); e!=INVALID; ++e) {
[986]128    Node u=G.source(e);
129    Node v=G.target(e);
[585]130    check( !dijkstra_test.reached(u) ||
131           (dijkstra_test.dist(v) - dijkstra_test.dist(u) <= cap[e]),
[986]132           "dist(target)-dist(source)- edge_length= "
[585]133           << dijkstra_test.dist(v) - dijkstra_test.dist(u)
134           - cap[e]);
135  }
136
137  ///\bug This works only for integer lengths
[780]138  for(NodeIt v(G); v!=INVALID; ++v){
139    check(dijkstra_test.reached(v),"Each node should be reached.");
[1763]140    if ( dijkstra_test.predEdge(v)!=INVALID ) {
141      Edge e=dijkstra_test.predEdge(v);
[986]142      Node u=G.source(e);
[780]143      check(u==dijkstra_test.predNode(v),"Wrong tree.");
[585]144      check(dijkstra_test.dist(v) - dijkstra_test.dist(u) == cap[e],
[780]145            "Wrong distance! Difference: "
[585]146            << std::abs(dijkstra_test.dist(v) - dijkstra_test.dist(u)
147                            - cap[e]));
148    }
[780]149  }
[1148]150
151 
152  {
[1218]153    NullMap<Node,Edge> myPredMap;
154    dijkstra(G,cap).predMap(myPredMap).run(s);
[1148]155  }
156  return 0;
[568]157}
Note: See TracBrowser for help on using the repository browser.