1 // -*- c++ -*- |
1 // -*- c++ -*- |
2 #ifndef HUGO_MINLENGTHPATHS_H |
2 #ifndef LEMON_MINLENGTHPATHS_H |
3 #define HUGO_MINLENGTHPATHS_H |
3 #define LEMON_MINLENGTHPATHS_H |
4 |
4 |
5 ///\ingroup galgs |
5 ///\ingroup galgs |
6 ///\file |
6 ///\file |
7 ///\brief An algorithm for finding k paths of minimal total length. |
7 ///\brief An algorithm for finding k paths of minimal total length. |
8 |
8 |
9 #include <iostream> |
9 #include <iostream> |
10 #include <hugo/dijkstra.h> |
10 #include <lemon/dijkstra.h> |
11 #include <hugo/graph_wrapper.h> |
11 #include <lemon/graph_wrapper.h> |
12 #include <hugo/maps.h> |
12 #include <lemon/maps.h> |
13 #include <vector> |
13 #include <vector> |
14 |
14 |
15 |
15 |
16 namespace hugo { |
16 namespace lemon { |
17 |
17 |
18 /// \addtogroup galgs |
18 /// \addtogroup galgs |
19 /// @{ |
19 /// @{ |
20 |
20 |
21 ///\brief Implementation of an algorithm for finding k paths between 2 nodes |
21 ///\brief Implementation of an algorithm for finding k paths between 2 nodes |
22 /// of minimal total length |
22 /// of minimal total length |
23 /// |
23 /// |
24 /// The class \ref hugo::MinLengthPaths "MinLengthPaths" implements |
24 /// The class \ref lemon::MinLengthPaths "MinLengthPaths" implements |
25 /// an algorithm for finding k edge-disjoint paths |
25 /// an algorithm for finding k edge-disjoint paths |
26 /// from a given source node to a given target node in an |
26 /// from a given source node to a given target node in an |
27 /// edge-weighted directed graph having minimal total weigth (length). |
27 /// edge-weighted directed graph having minimal total weigth (length). |
28 /// |
28 /// |
29 ///\author Attila Bernath |
29 ///\author Attila Bernath |