equal
deleted
inserted
replaced
29 #include <lemon/path.h> |
29 #include <lemon/path.h> |
30 #include <lemon/ssp_min_cost_flow.h> |
30 #include <lemon/ssp_min_cost_flow.h> |
31 |
31 |
32 namespace lemon { |
32 namespace lemon { |
33 |
33 |
34 /// \addtogroup flowalgs |
34 /// \addtogroup shortest_path |
35 /// @{ |
35 /// @{ |
36 |
36 |
37 ///\brief Implementation of an algorithm for finding k edge-disjoint |
37 ///\brief Implementation of an algorithm for finding k edge-disjoint |
38 /// paths between 2 nodes of minimal total length |
38 /// paths between 2 nodes of minimal total length |
39 /// |
39 /// |