src/work/athos/old/minlengthpaths.h
changeset 723 7ded6acc2dfe
parent 601 6c6c0eb89b47
child 921 818510fa3d99
equal deleted inserted replaced
0:d1e356195c36 1:e230b6fc85d0
     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 <dijkstra.h>
    10 #include <hugo/dijkstra.h>
    11 #include <graph_wrapper.h>
    11 #include <hugo/graph_wrapper.h>
    12 #include <maps.h>
    12 #include <hugo/maps.h>
    13 #include <vector.h>
    13 #include <vector>
    14 
    14 
    15 
    15 
    16 namespace hugo {
    16 namespace hugo {
    17 
    17 
    18 /// \addtogroup galgs
    18 /// \addtogroup galgs