equal
deleted
inserted
replaced
1 // -*- C++ -*- |
1 // -*- C++ -*- |
2 #ifndef HUGO_MAX_FLOW_H |
2 #ifndef LEMON_MAX_FLOW_H |
3 #define HUGO_MAX_FLOW_H |
3 #define LEMON_MAX_FLOW_H |
4 |
4 |
5 #include <vector> |
5 #include <vector> |
6 #include <queue> |
6 #include <queue> |
7 #include <stack> |
7 #include <stack> |
8 |
8 |
9 #include <hugo/graph_wrapper.h> |
9 #include <lemon/graph_wrapper.h> |
10 #include <bfs_dfs.h> |
10 #include <bfs_dfs.h> |
11 #include <hugo/invalid.h> |
11 #include <lemon/invalid.h> |
12 #include <hugo/maps.h> |
12 #include <lemon/maps.h> |
13 #include <hugo/for_each_macros.h> |
13 #include <lemon/for_each_macros.h> |
14 |
14 |
15 /// \file |
15 /// \file |
16 /// \brief Maximum flow algorithms. |
16 /// \brief Maximum flow algorithms. |
17 /// \ingroup galgs |
17 /// \ingroup galgs |
18 |
18 |
19 namespace hugo { |
19 namespace lemon { |
20 |
20 |
21 /// \addtogroup galgs |
21 /// \addtogroup galgs |
22 /// @{ |
22 /// @{ |
23 ///Maximum flow algorithms class. |
23 ///Maximum flow algorithms class. |
24 |
24 |
1191 |
1191 |
1192 typename ErasingResGW::template NodeMap<Num> |
1192 typename ErasingResGW::template NodeMap<Num> |
1193 free1(erasing_res_graph); |
1193 free1(erasing_res_graph); |
1194 |
1194 |
1195 dfs.pushAndSetReached |
1195 dfs.pushAndSetReached |
1196 ///\bug hugo 0.2 |
1196 ///\bug lemon 0.2 |
1197 (typename ErasingResGW::Node |
1197 (typename ErasingResGW::Node |
1198 (typename FilterResGW::Node |
1198 (typename FilterResGW::Node |
1199 (typename ResGW::Node(s) |
1199 (typename ResGW::Node(s) |
1200 ) |
1200 ) |
1201 ) |
1201 ) |
1258 status=AFTER_AUGMENTING; |
1258 status=AFTER_AUGMENTING; |
1259 return _augment; |
1259 return _augment; |
1260 } |
1260 } |
1261 |
1261 |
1262 |
1262 |
1263 } //namespace hugo |
1263 } //namespace lemon |
1264 |
1264 |
1265 #endif //HUGO_MAX_FLOW_H |
1265 #endif //LEMON_MAX_FLOW_H |
1266 |
1266 |
1267 |
1267 |
1268 |
1268 |
1269 |
1269 |