equal
deleted
inserted
replaced
20 |
20 |
21 ///\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 |
22 /// of minimal total length |
22 /// of minimal total length |
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 for finding 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 ///\author Attila Bernath |
30 template <typename Graph, typename LengthMap> |
30 template <typename Graph, typename LengthMap> |