equal
deleted
inserted
replaced
1 // -*- c++ -*- |
1 // -*- c++ -*- |
2 #ifndef HUGO_MINLENGTHPATHS_H |
2 #ifndef HUGO_MINLENGTHPATHS_H |
3 #define HUGO_MINLENGTHPATHS_H |
3 #define HUGO_MINLENGTHPATHS_H |
4 |
4 |
|
5 ///ingroup galgs |
5 ///\file |
6 ///\file |
6 ///\brief An algorithm for finding k paths of minimal total length. |
7 ///\brief An algorithm for finding k paths of minimal total length. |
7 |
8 |
8 #include <iostream> |
9 #include <iostream> |
9 #include <dijkstra.h> |
10 #include <dijkstra.h> |
12 #include <vector> |
13 #include <vector> |
13 |
14 |
14 |
15 |
15 namespace hugo { |
16 namespace hugo { |
16 |
17 |
17 |
18 /// \addtogroup galgs |
|
19 /// @{ |
18 |
20 |
19 ///\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 |
20 /// of minimal total length |
22 /// of minimal total length |
21 /// |
23 /// |
22 /// The class \ref hugo::MinLengthPaths "MinLengthPaths" implements |
24 /// The class \ref hugo::MinLengthPaths "MinLengthPaths" implements |
158 } |
160 } |
159 |
161 |
160 |
162 |
161 }; //class MinLengthPaths |
163 }; //class MinLengthPaths |
162 |
164 |
|
165 ///@} |
163 |
166 |
164 } //namespace hugo |
167 } //namespace hugo |
165 |
168 |
166 #endif //HUGO_MINLENGTHPATHS_H |
169 #endif //HUGO_MINLENGTHPATHS_H |