equal
deleted
inserted
replaced
162 } |
162 } |
163 |
163 |
164 /// \brief An augmenting phase of the Hopcroft-Karp algorithm |
164 /// \brief An augmenting phase of the Hopcroft-Karp algorithm |
165 /// |
165 /// |
166 /// It runs an augmenting phase of the Hopcroft-Karp |
166 /// It runs an augmenting phase of the Hopcroft-Karp |
167 /// algorithm. The phase finds maximum count of edge disjoint |
167 /// algorithm. This phase finds maximum count of edge disjoint |
168 /// augmenting paths and augments on these paths. The algorithm |
168 /// augmenting paths and augments on these paths. The algorithm |
169 /// consists at most of \f$ O(\sqrt{n}) \f$ phase and one phase is |
169 /// consists at most of \f$ O(\sqrt{n}) \f$ phase and one phase is |
170 /// \f$ O(e) \f$ long. |
170 /// \f$ O(e) \f$ long. |
171 bool augment() { |
171 bool augment() { |
172 |
172 |
256 } |
256 } |
257 |
257 |
258 /// \brief An augmenting phase of the Ford-Fulkerson algorithm |
258 /// \brief An augmenting phase of the Ford-Fulkerson algorithm |
259 /// |
259 /// |
260 /// It runs an augmenting phase of the Ford-Fulkerson |
260 /// It runs an augmenting phase of the Ford-Fulkerson |
261 /// algorithm. The phase finds only one augmenting path and |
261 /// algorithm. This phase finds only one augmenting path and |
262 /// augments only on this paths. The algorithm consists at most |
262 /// augments only on this paths. The algorithm consists at most |
263 /// of \f$ O(n) \f$ simple phase and one phase is at most |
263 /// of \f$ O(n) \f$ simple phase and one phase is at most |
264 /// \f$ O(e) \f$ long. |
264 /// \f$ O(e) \f$ long. |
265 bool simpleAugment() { |
265 bool simpleAugment() { |
266 |
266 |
732 |
732 |
733 |
733 |
734 /// \brief An augmenting phase of the weighted matching algorithm |
734 /// \brief An augmenting phase of the weighted matching algorithm |
735 /// |
735 /// |
736 /// It runs an augmenting phase of the weighted matching |
736 /// It runs an augmenting phase of the weighted matching |
737 /// algorithm. The phase finds the best augmenting path and |
737 /// algorithm. This phase finds the best augmenting path and |
738 /// augments only on this paths. |
738 /// augments only on this paths. |
739 /// |
739 /// |
740 /// The algorithm consists at most |
740 /// The algorithm consists at most |
741 /// of \f$ O(n) \f$ phase and one phase is \f$ O(n\log(n)+e) \f$ |
741 /// of \f$ O(n) \f$ phase and one phase is \f$ O(n\log(n)+e) \f$ |
742 /// long with Fibonacci heap or \f$ O((n+e)\log(n)) \f$ long |
742 /// long with Fibonacci heap or \f$ O((n+e)\log(n)) \f$ long |