0
6
0
... | ... |
@@ -296,16 +296,20 @@ |
296 | 296 |
template <typename T> |
297 | 297 |
struct SetHeap |
298 | 298 |
: public CapacityScaling<GR, V, C, SetHeapTraits<T> > { |
299 | 299 |
typedef CapacityScaling<GR, V, C, SetHeapTraits<T> > Create; |
300 | 300 |
}; |
301 | 301 |
|
302 | 302 |
/// @} |
303 | 303 |
|
304 |
protected: |
|
305 |
|
|
306 |
CapacityScaling() {} |
|
307 |
|
|
304 | 308 |
public: |
305 | 309 |
|
306 | 310 |
/// \brief Constructor. |
307 | 311 |
/// |
308 | 312 |
/// The constructor of the class. |
309 | 313 |
/// |
310 | 314 |
/// \param graph The digraph the algorithm runs on. |
311 | 315 |
CapacityScaling(const GR& graph) : |
... | ... |
@@ -320,16 +320,20 @@ |
320 | 320 |
template <typename T> |
321 | 321 |
struct SetLargeCost |
322 | 322 |
: public CostScaling<GR, V, C, SetLargeCostTraits<T> > { |
323 | 323 |
typedef CostScaling<GR, V, C, SetLargeCostTraits<T> > Create; |
324 | 324 |
}; |
325 | 325 |
|
326 | 326 |
/// @} |
327 | 327 |
|
328 |
protected: |
|
329 |
|
|
330 |
CostScaling() {} |
|
331 |
|
|
328 | 332 |
public: |
329 | 333 |
|
330 | 334 |
/// \brief Constructor. |
331 | 335 |
/// |
332 | 336 |
/// The constructor of the class. |
333 | 337 |
/// |
334 | 338 |
/// \param graph The digraph the algorithm runs on. |
335 | 339 |
CostScaling(const GR& graph) : |
... | ... |
@@ -236,16 +236,20 @@ |
236 | 236 |
template <typename T> |
237 | 237 |
struct SetPath |
238 | 238 |
: public HartmannOrlin<GR, LEN, SetPathTraits<T> > { |
239 | 239 |
typedef HartmannOrlin<GR, LEN, SetPathTraits<T> > Create; |
240 | 240 |
}; |
241 | 241 |
|
242 | 242 |
/// @} |
243 | 243 |
|
244 |
protected: |
|
245 |
|
|
246 |
HartmannOrlin() {} |
|
247 |
|
|
244 | 248 |
public: |
245 | 249 |
|
246 | 250 |
/// \brief Constructor. |
247 | 251 |
/// |
248 | 252 |
/// The constructor of the class. |
249 | 253 |
/// |
250 | 254 |
/// \param digraph The digraph the algorithm runs on. |
251 | 255 |
/// \param length The lengths (costs) of the arcs. |
... | ... |
@@ -226,16 +226,20 @@ |
226 | 226 |
template <typename T> |
227 | 227 |
struct SetPath |
228 | 228 |
: public Howard<GR, LEN, SetPathTraits<T> > { |
229 | 229 |
typedef Howard<GR, LEN, SetPathTraits<T> > Create; |
230 | 230 |
}; |
231 | 231 |
|
232 | 232 |
/// @} |
233 | 233 |
|
234 |
protected: |
|
235 |
|
|
236 |
Howard() {} |
|
237 |
|
|
234 | 238 |
public: |
235 | 239 |
|
236 | 240 |
/// \brief Constructor. |
237 | 241 |
/// |
238 | 242 |
/// The constructor of the class. |
239 | 243 |
/// |
240 | 244 |
/// \param digraph The digraph the algorithm runs on. |
241 | 245 |
/// \param length The lengths (costs) of the arcs. |
... | ... |
@@ -232,16 +232,20 @@ |
232 | 232 |
template <typename T> |
233 | 233 |
struct SetPath |
234 | 234 |
: public Karp<GR, LEN, SetPathTraits<T> > { |
235 | 235 |
typedef Karp<GR, LEN, SetPathTraits<T> > Create; |
236 | 236 |
}; |
237 | 237 |
|
238 | 238 |
/// @} |
239 | 239 |
|
240 |
protected: |
|
241 |
|
|
242 |
Karp() {} |
|
243 |
|
|
240 | 244 |
public: |
241 | 245 |
|
242 | 246 |
/// \brief Constructor. |
243 | 247 |
/// |
244 | 248 |
/// The constructor of the class. |
245 | 249 |
/// |
246 | 250 |
/// \param digraph The digraph the algorithm runs on. |
247 | 251 |
/// \param length The lengths (costs) of the arcs. |
... | ... |
@@ -398,16 +398,20 @@ |
398 | 398 |
// The pred arc map |
399 | 399 |
PredMap _pred; |
400 | 400 |
|
401 | 401 |
// Data for full init |
402 | 402 |
PotentialMap *_init_dist; |
403 | 403 |
PredMap *_init_pred; |
404 | 404 |
bool _full_init; |
405 | 405 |
|
406 |
protected: |
|
407 |
|
|
408 |
Suurballe() {} |
|
409 |
|
|
406 | 410 |
public: |
407 | 411 |
|
408 | 412 |
/// \brief Constructor. |
409 | 413 |
/// |
410 | 414 |
/// Constructor. |
411 | 415 |
/// |
412 | 416 |
/// \param graph The digraph the algorithm runs on. |
413 | 417 |
/// \param length The length (cost) values of the arcs. |
0 comments (0 inline)