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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
|
// Copyright 2002 Rensselaer Polytechnic Institute
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
// Authors: Lauren Foutz
// Scott Hill
/*
This file implements the functions
template <class VertexListGraph, class DistanceMatrix,
class P, class T, class R>
bool floyd_warshall_initialized_all_pairs_shortest_paths(
const VertexListGraph& g, DistanceMatrix& d,
const bgl_named_params<P, T, R>& params)
AND
template <class VertexAndEdgeListGraph, class DistanceMatrix,
class P, class T, class R>
bool floyd_warshall_all_pairs_shortest_paths(
const VertexAndEdgeListGraph& g, DistanceMatrix& d,
const bgl_named_params<P, T, R>& params)
*/
#ifndef BOOST_GRAPH_FLOYD_WARSHALL_HPP
#define BOOST_GRAPH_FLOYD_WARSHALL_HPP
#include <boost/property_map/property_map.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/named_function_params.hpp>
#include <boost/graph/graph_concepts.hpp>
#include <boost/graph/relax.hpp>
#include <boost/concept/assert.hpp>
namespace boost
{
namespace detail {
template<typename T, typename BinaryPredicate>
T min_with_compare(const T& x, const T& y, const BinaryPredicate& compare)
{
if (compare(x, y)) return x;
else return y;
}
template<typename VertexListGraph, typename DistanceMatrix,
typename BinaryPredicate, typename BinaryFunction,
typename Infinity, typename Zero>
bool floyd_warshall_dispatch(const VertexListGraph& g,
DistanceMatrix& d, const BinaryPredicate &compare,
const BinaryFunction &combine, const Infinity& inf,
const Zero& zero)
{
typename graph_traits<VertexListGraph>::vertex_iterator
i, lasti, j, lastj, k, lastk;
for (boost::tie(k, lastk) = vertices(g); k != lastk; k++)
for (boost::tie(i, lasti) = vertices(g); i != lasti; i++)
if(d[*i][*k] != inf)
for (boost::tie(j, lastj) = vertices(g); j != lastj; j++)
if(d[*k][*j] != inf)
d[*i][*j] =
detail::min_with_compare(d[*i][*j],
combine(d[*i][*k], d[*k][*j]),
compare);
for (boost::tie(i, lasti) = vertices(g); i != lasti; i++)
if (compare(d[*i][*i], zero))
return false;
return true;
}
}
template <typename VertexListGraph, typename DistanceMatrix,
typename BinaryPredicate, typename BinaryFunction,
typename Infinity, typename Zero>
bool floyd_warshall_initialized_all_pairs_shortest_paths(
const VertexListGraph& g, DistanceMatrix& d,
const BinaryPredicate& compare,
const BinaryFunction& combine, const Infinity& inf,
const Zero& zero)
{
BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<VertexListGraph> ));
return detail::floyd_warshall_dispatch(g, d, compare, combine,
inf, zero);
}
template <typename VertexAndEdgeListGraph, typename DistanceMatrix,
typename WeightMap, typename BinaryPredicate,
typename BinaryFunction, typename Infinity, typename Zero>
bool floyd_warshall_all_pairs_shortest_paths(
const VertexAndEdgeListGraph& g,
DistanceMatrix& d, const WeightMap& w,
const BinaryPredicate& compare, const BinaryFunction& combine,
const Infinity& inf, const Zero& zero)
{
BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<VertexAndEdgeListGraph> ));
BOOST_CONCEPT_ASSERT(( EdgeListGraphConcept<VertexAndEdgeListGraph> ));
BOOST_CONCEPT_ASSERT(( IncidenceGraphConcept<VertexAndEdgeListGraph> ));
typename graph_traits<VertexAndEdgeListGraph>::vertex_iterator
firstv, lastv, firstv2, lastv2;
typename graph_traits<VertexAndEdgeListGraph>::edge_iterator first, last;
for(boost::tie(firstv, lastv) = vertices(g); firstv != lastv; firstv++)
for(boost::tie(firstv2, lastv2) = vertices(g); firstv2 != lastv2; firstv2++)
d[*firstv][*firstv2] = inf;
for(boost::tie(firstv, lastv) = vertices(g); firstv != lastv; firstv++)
d[*firstv][*firstv] = zero;
for(boost::tie(first, last) = edges(g); first != last; first++)
{
if (d[source(*first, g)][target(*first, g)] != inf) {
d[source(*first, g)][target(*first, g)] =
detail::min_with_compare(
get(w, *first),
d[source(*first, g)][target(*first, g)],
compare);
} else
d[source(*first, g)][target(*first, g)] = get(w, *first);
}
bool is_undirected = is_same<typename
graph_traits<VertexAndEdgeListGraph>::directed_category,
undirected_tag>::value;
if (is_undirected)
{
for(boost::tie(first, last) = edges(g); first != last; first++)
{
if (d[target(*first, g)][source(*first, g)] != inf)
d[target(*first, g)][source(*first, g)] =
detail::min_with_compare(
get(w, *first),
d[target(*first, g)][source(*first, g)],
compare);
else
d[target(*first, g)][source(*first, g)] = get(w, *first);
}
}
return detail::floyd_warshall_dispatch(g, d, compare, combine,
inf, zero);
}
namespace detail {
template <class VertexListGraph, class DistanceMatrix,
class WeightMap, class P, class T, class R>
bool floyd_warshall_init_dispatch(const VertexListGraph& g,
DistanceMatrix& d, WeightMap /*w*/,
const bgl_named_params<P, T, R>& params)
{
typedef typename property_traits<WeightMap>::value_type WM;
WM inf =
choose_param(get_param(params, distance_inf_t()),
std::numeric_limits<WM>::max BOOST_PREVENT_MACRO_SUBSTITUTION());
return floyd_warshall_initialized_all_pairs_shortest_paths(g, d,
choose_param(get_param(params, distance_compare_t()),
std::less<WM>()),
choose_param(get_param(params, distance_combine_t()),
closed_plus<WM>(inf)),
inf,
choose_param(get_param(params, distance_zero_t()),
WM()));
}
template <class VertexAndEdgeListGraph, class DistanceMatrix,
class WeightMap, class P, class T, class R>
bool floyd_warshall_noninit_dispatch(const VertexAndEdgeListGraph& g,
DistanceMatrix& d, WeightMap w,
const bgl_named_params<P, T, R>& params)
{
typedef typename property_traits<WeightMap>::value_type WM;
WM inf =
choose_param(get_param(params, distance_inf_t()),
std::numeric_limits<WM>::max BOOST_PREVENT_MACRO_SUBSTITUTION());
return floyd_warshall_all_pairs_shortest_paths(g, d, w,
choose_param(get_param(params, distance_compare_t()),
std::less<WM>()),
choose_param(get_param(params, distance_combine_t()),
closed_plus<WM>(inf)),
inf,
choose_param(get_param(params, distance_zero_t()),
WM()));
}
} // namespace detail
template <class VertexListGraph, class DistanceMatrix, class P,
class T, class R>
bool floyd_warshall_initialized_all_pairs_shortest_paths(
const VertexListGraph& g, DistanceMatrix& d,
const bgl_named_params<P, T, R>& params)
{
return detail::floyd_warshall_init_dispatch(g, d,
choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
params);
}
template <class VertexListGraph, class DistanceMatrix>
bool floyd_warshall_initialized_all_pairs_shortest_paths(
const VertexListGraph& g, DistanceMatrix& d)
{
bgl_named_params<int,int> params(0);
return detail::floyd_warshall_init_dispatch(g, d,
get(edge_weight, g), params);
}
template <class VertexAndEdgeListGraph, class DistanceMatrix,
class P, class T, class R>
bool floyd_warshall_all_pairs_shortest_paths(
const VertexAndEdgeListGraph& g, DistanceMatrix& d,
const bgl_named_params<P, T, R>& params)
{
return detail::floyd_warshall_noninit_dispatch(g, d,
choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
params);
}
template <class VertexAndEdgeListGraph, class DistanceMatrix>
bool floyd_warshall_all_pairs_shortest_paths(
const VertexAndEdgeListGraph& g, DistanceMatrix& d)
{
bgl_named_params<int,int> params(0);
return detail::floyd_warshall_noninit_dispatch(g, d,
get(edge_weight, g), params);
}
} // namespace boost
#endif
|
