equal
deleted
inserted
replaced
1 // -*- c++ -*- |
1 // -*- c++ -*- |
2 #ifndef HUGO_MAX_BIPARTITE_MATCHING_H |
2 #ifndef LEMON_MAX_BIPARTITE_MATCHING_H |
3 #define HUGO_MAX_BIPARTITE_MATCHING_H |
3 #define LEMON_MAX_BIPARTITE_MATCHING_H |
4 |
4 |
5 /// \ingroup galgs |
5 /// \ingroup galgs |
6 /// \file |
6 /// \file |
7 /// \brief Maximum bipartite matchings, b-matchings and |
7 /// \brief Maximum bipartite matchings, b-matchings and |
8 /// capacitated b-matchings. |
8 /// capacitated b-matchings. |
12 /// |
12 /// |
13 // /// \author Marton Makai |
13 // /// \author Marton Makai |
14 |
14 |
15 //#include <for_each_macros.h> |
15 //#include <for_each_macros.h> |
16 #include <bipartite_graph_wrapper.h> |
16 #include <bipartite_graph_wrapper.h> |
17 //#include <hugo/maps.h> |
17 //#include <lemon/maps.h> |
18 #include <hugo/max_flow.h> |
18 #include <lemon/max_flow.h> |
19 |
19 |
20 namespace hugo { |
20 namespace lemon { |
21 |
21 |
22 // template <typename Graph, typename EdgeCap, typename NodeCap, |
22 // template <typename Graph, typename EdgeCap, typename NodeCap, |
23 // typename EdgeFlow, typename NodeFlow> |
23 // typename EdgeFlow, typename NodeFlow> |
24 // class MaxMatching : public MaxFlow<stGraphWrapper<Graph>, |
24 // class MaxMatching : public MaxFlow<stGraphWrapper<Graph>, |
25 // stGraphWrapper<Graph>:: EdgeMapWrapper<EdgeCan, NodeCap>, stGraphWrapper<Graph>::EdgeMapWrapper<EdgeFlow, NodeFlow> > { |
25 // stGraphWrapper<Graph>:: EdgeMapWrapper<EdgeCan, NodeCap>, stGraphWrapper<Graph>::EdgeMapWrapper<EdgeFlow, NodeFlow> > { |
133 } |
133 } |
134 /// The matching value after running \c run. |
134 /// The matching value after running \c run. |
135 int matchingValue() const { return mf.flowValue(); } |
135 int matchingValue() const { return mf.flowValue(); } |
136 }; |
136 }; |
137 |
137 |
138 } //namespace hugo |
138 } //namespace lemon |
139 |
139 |
140 #endif //HUGO_MAX_BIPARTITE_MATCHING_H |
140 #endif //LEMON_MAX_BIPARTITE_MATCHING_H |