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 ///\ingroup flowalgs |
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 |
9 |
10 //#include <hugo/dijkstra.h> |
10 //#include <hugo/dijkstra.h> |
14 #include <hugo/mincostflows.h> |
14 #include <hugo/mincostflows.h> |
15 #include <for_each_macros.h> |
15 #include <for_each_macros.h> |
16 |
16 |
17 namespace hugo { |
17 namespace hugo { |
18 |
18 |
19 /// \addtogroup galgs |
19 /// \addtogroup flowalgs |
20 /// @{ |
20 /// @{ |
21 |
21 |
22 ///\brief Implementation of an algorithm for finding k paths between 2 nodes |
22 ///\brief Implementation of an algorithm for finding k paths between 2 nodes |
23 /// of minimal total length |
23 /// of minimal total length |
24 /// |
24 /// |