equal
deleted
inserted
replaced
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 |
10 //#include <hugo/dijkstra.h> |
10 //#include <hugo/dijkstra.h> |
11 //#include <hugo/graph_wrapper.h> |
11 //#include <hugo/graph_wrapper.h> |
12 #include <hugo/maps.h> |
12 #include <hugo/maps.h> |
13 #include <vector> |
13 #include <vector> |
14 #include <hugo/mincostflows.h> |
14 #include <hugo/mincostflows.h> |