equal
deleted
inserted
replaced
17 */ |
17 */ |
18 |
18 |
19 #include <iostream> |
19 #include <iostream> |
20 #include "test_tools.h" |
20 #include "test_tools.h" |
21 #include <lemon/list_graph.h> |
21 #include <lemon/list_graph.h> |
22 #include <lemon/min_cost_flow.h> |
22 #include <lemon/ssp_min_cost_flow.h> |
23 //#include <path.h> |
23 //#include <path.h> |
24 //#include <maps.h> |
24 //#include <maps.h> |
25 |
25 |
26 using namespace lemon; |
26 using namespace lemon; |
27 |
27 |
90 capacity.set(v5_t, 2); |
90 capacity.set(v5_t, 2); |
91 |
91 |
92 // ConstMap<Edge, int> const1map(1); |
92 // ConstMap<Edge, int> const1map(1); |
93 std::cout << "Mincostflows algorithm test..." << std::endl; |
93 std::cout << "Mincostflows algorithm test..." << std::endl; |
94 |
94 |
95 MinCostFlow< Graph, Graph::EdgeMap<int>, Graph::EdgeMap<int> > |
95 SspMinCostFlow< Graph, Graph::EdgeMap<int>, Graph::EdgeMap<int> > |
96 surb_test(graph, length, capacity, s, t); |
96 surb_test(graph, length, capacity, s, t); |
97 |
97 |
98 int k=1; |
98 int k=1; |
99 |
99 |
100 surb_test.augment(); |
100 surb_test.augment(); |