1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
|
// ==========================================================================
// SeqAn - The Library for Sequence Analysis
// ==========================================================================
// Copyright (c) 2006-2018, Knut Reinert, FU Berlin
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
// * Neither the name of Knut Reinert or the FU Berlin nor the names of
// its contributors may be used to endorse or promote products derived
// from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL KNUT REINERT OR THE FU BERLIN BE LIABLE
// FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
// SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
// CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
// LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
// OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
// DAMAGE.
//
// ==========================================================================
// Author: Tobias Raussch <rausch@embl.de>
// ==========================================================================
// Implementation of Dijkstra's algorithm.
// ==========================================================================
#ifndef INCLUDE_SEQAN_GRAPH_ALGORITHMS_DIJKSTRA_H_
#define INCLUDE_SEQAN_GRAPH_ALGORITHMS_DIJKSTRA_H_
namespace seqan {
// ============================================================================
// Forwards
// ============================================================================
// ============================================================================
// Tags, Classes, Enums
// ============================================================================
// ============================================================================
// Metafunctions
// ============================================================================
// ============================================================================
// Functions
// ============================================================================
// ----------------------------------------------------------------------------
// Function dijkstra()
// ----------------------------------------------------------------------------
/*!
* @fn dijkstra
* @headerfile <seqan/graph_algorithms.h>
* @brief Computes shortest paths from a single source in a graph.
* @signature void dijkstra(predecessor, distance, g, source, weight);
*
* @param[out] predecessor A property map. A property map that represents predecessor relationships among vertices.
* It determines a shortest-paths tree.
* @param[out] distance A property map.Indicates for each vertex the distance from the source.
* @param[in] g A graph. Types: Directed Graph
* @param[in] source A source vertex. Types: VertexDescriptor
* @param[in] weight A weight map. A property map with edge weights. Edge weights have to be nonnegative.
*
* @section Remarks
*
* Edge weights have to be nonnegative.
*
* @section Example
*
* @include demos/dox/graph_algorithms/dijkstra.cpp
*
* @include demos/dox/graph_algorithms/dijkstra.cpp.stdout
*
* @see dagShortestPath
* @see bellmanFordAlgorithm
*/
template <typename TSpec, typename TVertexDescriptor, typename TWeightMap,
typename TPredecessorMap, typename TDistanceMap>
void dijkstra(TPredecessorMap & predecessor,
TDistanceMap & distance,
Graph<TSpec> const & g,
TVertexDescriptor const source,
TWeightMap const & weight)
{
typedef Graph<TSpec> TGraph;
typedef typename Value<TDistanceMap>::Type TDistVal;
typedef typename Iterator<TGraph, VertexIterator>::Type TVertexIterator;
typedef typename Iterator<TGraph, OutEdgeIterator>::Type TOutEdgeIterator;
// Initialization
resizeVertexMap(predecessor, g);
resizeVertexMap(distance, g);
// S is initially empty
String<bool> setS;
resize(setS, getIdUpperBound(_getVertexIdManager(g)), false);
// Set-up the priority queue
typedef Pair<TVertexDescriptor, TDistVal> TKeyValue;
typedef HeapTree<TKeyValue, std::less<TDistVal>, KeyedHeap<> > TKeyedHeap;
TKeyedHeap priorityQueue;
TDistVal infDist = _getInfinityDistance(weight);
TVertexDescriptor nilVertex = getNil<typename VertexDescriptor<TGraph>::Type>();
TVertexIterator it(g);
for(;!atEnd(it);goNext(it)) {
assignProperty(predecessor, value(it), nilVertex);
assignProperty(distance, value(it), infDist);
heapInsert(priorityQueue, TKeyValue(value(it), infDist));
}
assignProperty(distance, source, 0);
heapChangeValue(priorityQueue, source, 0);
// Run Dijkstra
while (!empty(priorityQueue)) {
// Extract min
TVertexDescriptor u = heapExtractRoot(priorityQueue).i1;
assignProperty(setS, u, true);
TOutEdgeIterator itout(g, u);
for(;!atEnd(itout);++itout) {
TVertexDescriptor v = targetVertex(itout);
if (property(setS, v) == true) continue;
if (getProperty(distance, v) > getProperty(distance,u) + getProperty(weight,value(itout))) {
assignProperty(distance, v, getProperty(distance,u) + getProperty(weight,value(itout)));
assignProperty(predecessor, v, u);
heapChangeValue(priorityQueue, v, getProperty(distance,u) + getProperty(weight,value(itout)));
}
}
}
}
} // namespace seqan
#endif // #ifndef INCLUDE_SEQAN_GRAPH_ALGORITHMS_DIJKSTRA_H_
|
