equal
deleted
inserted
replaced
22 #include <queue> |
22 #include <queue> |
23 #include <lemon/bits/invalid.h> |
23 #include <lemon/bits/invalid.h> |
24 #include <lemon/unionfind.h> |
24 #include <lemon/unionfind.h> |
25 #include <lemon/graph_utils.h> |
25 #include <lemon/graph_utils.h> |
26 |
26 |
27 ///\ingroup galgs |
27 ///\ingroup matching |
28 ///\file |
28 ///\file |
29 ///\brief Maximum matching algorithm. |
29 ///\brief Maximum matching algorithm in undirected graph. |
30 |
30 |
31 namespace lemon { |
31 namespace lemon { |
32 |
32 |
33 /// \addtogroup galgs |
33 /// \ingroup matching |
34 /// @{ |
|
35 |
34 |
36 ///Edmonds' alternating forest maximum matching algorithm. |
35 ///Edmonds' alternating forest maximum matching algorithm. |
37 |
36 |
38 ///This class provides Edmonds' alternating forest matching |
37 ///This class provides Edmonds' alternating forest matching |
39 ///algorithm. The starting matching (if any) can be passed to the |
38 ///algorithm. The starting matching (if any) can be passed to the |
562 } |
561 } |
563 tree.eraseClass(y); |
562 tree.eraseClass(y); |
564 |
563 |
565 } |
564 } |
566 |
565 |
567 /// @} |
|
568 |
566 |
569 } //END OF NAMESPACE LEMON |
567 } //END OF NAMESPACE LEMON |
570 |
568 |
571 #endif //LEMON_MAX_MATCHING_H |
569 #endif //LEMON_MAX_MATCHING_H |