equal
deleted
inserted
replaced
11 |
11 |
12 //#include <bfs_iterator.hh> |
12 //#include <bfs_iterator.hh> |
13 |
13 |
14 namespace lemon { |
14 namespace lemon { |
15 template <typename Graph, typename FlowMap, typename CapacityMap> |
15 template <typename Graph, typename FlowMap, typename CapacityMap> |
16 typename FlowMap::ValueType maxFlow(Graph &G, |
16 typename FlowMap::Value maxFlow(Graph &G, |
17 FlowMap &f, |
17 FlowMap &f, |
18 CapacityMap &c, |
18 CapacityMap &c, |
19 typename Graph::NodeIt s, |
19 typename Graph::NodeIt s, |
20 typename Graph::NodeIt t) |
20 typename Graph::NodeIt t) |
21 { |
21 { |
23 typedef typename Graph::EachNodeIt EachNodeIt; |
23 typedef typename Graph::EachNodeIt EachNodeIt; |
24 typedef typename Graph::EdgeIt EdgeIt; |
24 typedef typename Graph::EdgeIt EdgeIt; |
25 typedef typename Graph::EachEdgeIt EachEdgeIt; |
25 typedef typename Graph::EachEdgeIt EachEdgeIt; |
26 typedef typename Graph::OutEdgeIt OutEdgeIt; |
26 typedef typename Graph::OutEdgeIt OutEdgeIt; |
27 typedef typename Graph::InEdgeIt InEdgeIt; |
27 typedef typename Graph::InEdgeIt InEdgeIt; |
28 typedef typename FlowMap::ValueType T; |
28 typedef typename FlowMap::Value T; |
29 |
29 |
30 T flow_val = 0; |
30 T flow_val = 0; |
31 T aug_val; |
31 T aug_val; |
32 |
32 |
33 for(EachEdgeIt e(G);G.valid(e);G.goNext(e)) |
33 for(EachEdgeIt e(G);G.valid(e);G.goNext(e)) |