src/work/athos/minlengthpaths.h
changeset 462 0ab31578af67
parent 430 60e4627e8c74
child 491 4804c967543d
equal deleted inserted replaced
8:7e2282844e57 9:e8f7460c425c
    23   ///
    23   ///
    24   /// The class \ref hugo::MinLengthPaths "MinLengthPaths" implements
    24   /// The class \ref hugo::MinLengthPaths "MinLengthPaths" implements
    25   /// an algorithm which finds k edge-disjoint paths
    25   /// an algorithm which finds 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   template <typename Graph, typename LengthMap>
    30   template <typename Graph, typename LengthMap>
    30   class MinLengthPaths {
    31   class MinLengthPaths {
    31 
    32 
    32     typedef typename LengthMap::ValueType Length;
    33     typedef typename LengthMap::ValueType Length;
    33 
    34