equal
deleted
inserted
replaced
497 |
497 |
498 /// \brief Start Edmonds' algorithm |
498 /// \brief Start Edmonds' algorithm |
499 /// |
499 /// |
500 /// This function runs the original Edmonds' algorithm. |
500 /// This function runs the original Edmonds' algorithm. |
501 /// |
501 /// |
502 /// \pre \ref Init(), \ref greedyInit() or \ref matchingInit() must be |
502 /// \pre \ref init(), \ref greedyInit() or \ref matchingInit() must be |
503 /// called before using this function. |
503 /// called before using this function. |
504 void startSparse() { |
504 void startSparse() { |
505 for(NodeIt n(_graph); n != INVALID; ++n) { |
505 for(NodeIt n(_graph); n != INVALID; ++n) { |
506 if ((*_status)[n] == UNMATCHED) { |
506 if ((*_status)[n] == UNMATCHED) { |
507 (*_blossom_rep)[_blossom_set->insert(n)] = n; |
507 (*_blossom_rep)[_blossom_set->insert(n)] = n; |
516 /// for dense graphs |
516 /// for dense graphs |
517 /// |
517 /// |
518 /// This function runs Edmonds' algorithm with a heuristic of postponing |
518 /// This function runs Edmonds' algorithm with a heuristic of postponing |
519 /// shrinks, therefore resulting in a faster algorithm for dense graphs. |
519 /// shrinks, therefore resulting in a faster algorithm for dense graphs. |
520 /// |
520 /// |
521 /// \pre \ref Init(), \ref greedyInit() or \ref matchingInit() must be |
521 /// \pre \ref init(), \ref greedyInit() or \ref matchingInit() must be |
522 /// called before using this function. |
522 /// called before using this function. |
523 void startDense() { |
523 void startDense() { |
524 for(NodeIt n(_graph); n != INVALID; ++n) { |
524 for(NodeIt n(_graph); n != INVALID; ++n) { |
525 if ((*_status)[n] == UNMATCHED) { |
525 if ((*_status)[n] == UNMATCHED) { |
526 (*_blossom_rep)[_blossom_set->insert(n)] = n; |
526 (*_blossom_rep)[_blossom_set->insert(n)] = n; |