equal
deleted
inserted
replaced
43 /// finding arc-disjoint paths having minimum total length (cost) |
43 /// finding arc-disjoint paths having minimum total length (cost) |
44 /// from a given source node to a given target node in a digraph. |
44 /// from a given source node to a given target node in a digraph. |
45 /// |
45 /// |
46 /// Note that this problem is a special case of the \ref min_cost_flow |
46 /// Note that this problem is a special case of the \ref min_cost_flow |
47 /// "minimum cost flow problem". This implementation is actually an |
47 /// "minimum cost flow problem". This implementation is actually an |
48 /// efficient specialized version of the \ref CapacityScaling |
48 /// efficient specialized version of the Successive Shortest Path |
49 /// "Successive Shortest Path" algorithm directly for this problem. |
49 /// algorithm directly for this problem. |
50 /// Therefore this class provides query functions for flow values and |
50 /// Therefore this class provides query functions for flow values and |
51 /// node potentials (the dual solution) just like the minimum cost flow |
51 /// node potentials (the dual solution) just like the minimum cost flow |
52 /// algorithms. |
52 /// algorithms. |
53 /// |
53 /// |
54 /// \tparam GR The digraph type the algorithm runs on. |
54 /// \tparam GR The digraph type the algorithm runs on. |