equal
deleted
inserted
replaced
1 /* -*- C++ -*- |
1 /* -*- C++ -*- |
2 * src/hugo/kruskal.h - Part of HUGOlib, a generic C++ optimization library |
2 * src/lemon/kruskal.h - Part of LEMON, a generic C++ optimization library |
3 * |
3 * |
4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
5 * (Egervary Combinatorial Optimization Research Group, EGRES). |
5 * (Egervary Combinatorial Optimization Research Group, EGRES). |
6 * |
6 * |
7 * Permission to use, modify and distribute this software is granted |
7 * Permission to use, modify and distribute this software is granted |
12 * express or implied, and with no claim as to its suitability for any |
12 * express or implied, and with no claim as to its suitability for any |
13 * purpose. |
13 * purpose. |
14 * |
14 * |
15 */ |
15 */ |
16 |
16 |
17 #ifndef HUGO_KRUSKAL_H |
17 #ifndef LEMON_KRUSKAL_H |
18 #define HUGO_KRUSKAL_H |
18 #define LEMON_KRUSKAL_H |
19 |
19 |
20 #include <algorithm> |
20 #include <algorithm> |
21 #include <hugo/unionfind.h> |
21 #include <lemon/unionfind.h> |
22 |
22 |
23 /** |
23 /** |
24 @defgroup spantree Minimum Cost Spanning Tree Algorithms |
24 @defgroup spantree Minimum Cost Spanning Tree Algorithms |
25 @ingroup galgs |
25 @ingroup galgs |
26 \brief This group containes the algorithms for finding a minimum cost spanning |
26 \brief This group containes the algorithms for finding a minimum cost spanning |
34 ///\file |
34 ///\file |
35 ///\brief Kruskal's algorithm to compute a minimum cost tree |
35 ///\brief Kruskal's algorithm to compute a minimum cost tree |
36 /// |
36 /// |
37 ///Kruskal's algorithm to compute a minimum cost tree. |
37 ///Kruskal's algorithm to compute a minimum cost tree. |
38 |
38 |
39 namespace hugo { |
39 namespace lemon { |
40 |
40 |
41 /// \addtogroup spantree |
41 /// \addtogroup spantree |
42 /// @{ |
42 /// @{ |
43 |
43 |
44 /// Kruskal's algorithm to find a minimum cost tree of a graph. |
44 /// Kruskal's algorithm to find a minimum cost tree of a graph. |
341 return kruskal(G, KruskalMapInput<GR,IN>(G, in), _out); |
341 return kruskal(G, KruskalMapInput<GR,IN>(G, in), _out); |
342 } |
342 } |
343 |
343 |
344 /// @} |
344 /// @} |
345 |
345 |
346 } //namespace hugo |
346 } //namespace lemon |
347 |
347 |
348 #endif //HUGO_KRUSKAL_H |
348 #endif //LEMON_KRUSKAL_H |