equal
deleted
inserted
replaced
1 // -*- C++ -*- |
1 // -*- C++ -*- |
2 #ifndef HUGO_AUGMENTING_FLOW_H |
2 #ifndef LEMON_AUGMENTING_FLOW_H |
3 #define HUGO_AUGMENTING_FLOW_H |
3 #define LEMON_AUGMENTING_FLOW_H |
4 |
4 |
5 #include <vector> |
5 #include <vector> |
6 #include <iostream> |
6 #include <iostream> |
7 |
7 |
8 #include <hugo/graph_wrapper.h> |
8 #include <lemon/graph_wrapper.h> |
9 #include <bfs_dfs.h> |
9 #include <bfs_dfs.h> |
10 #include <hugo/invalid.h> |
10 #include <lemon/invalid.h> |
11 #include <hugo/maps.h> |
11 #include <lemon/maps.h> |
12 #include <hugo/tight_edge_filter_map.h> |
12 #include <lemon/tight_edge_filter_map.h> |
13 |
13 |
14 /// \file |
14 /// \file |
15 /// \brief Maximum flow algorithms. |
15 /// \brief Maximum flow algorithms. |
16 /// \ingroup galgs |
16 /// \ingroup galgs |
17 |
17 |
18 namespace hugo { |
18 namespace lemon { |
19 |
19 |
20 /// \addtogroup galgs |
20 /// \addtogroup galgs |
21 /// @{ |
21 /// @{ |
22 /// Class for augmenting path flow algorithms. |
22 /// Class for augmenting path flow algorithms. |
23 |
23 |
534 |
534 |
535 typename ErasingResGW::template NodeMap<Num> |
535 typename ErasingResGW::template NodeMap<Num> |
536 free1(erasing_res_graph); |
536 free1(erasing_res_graph); |
537 |
537 |
538 dfs.pushAndSetReached |
538 dfs.pushAndSetReached |
539 /// \bug hugo 0.2 |
539 /// \bug lemon 0.2 |
540 (typename ErasingResGW::Node |
540 (typename ErasingResGW::Node |
541 (typename FilterResGW::Node |
541 (typename FilterResGW::Node |
542 (typename ResGW::Node(s) |
542 (typename ResGW::Node(s) |
543 ) |
543 ) |
544 ) |
544 ) |
592 status=AFTER_AUGMENTING; |
592 status=AFTER_AUGMENTING; |
593 return _augment; |
593 return _augment; |
594 } |
594 } |
595 |
595 |
596 |
596 |
597 } //namespace hugo |
597 } //namespace lemon |
598 |
598 |
599 #endif //HUGO_AUGMENTING_FLOW_H |
599 #endif //LEMON_AUGMENTING_FLOW_H |
600 |
600 |
601 |
601 |