1.1 --- a/lemon/fractional_matching.h	Wed Mar 17 10:29:57 2010 +0100
     1.2 +++ b/lemon/fractional_matching.h	Wed Mar 17 12:35:52 2010 +0100
     1.3 @@ -1166,6 +1166,11 @@
     1.4          (*_delta3_index)[e] = _delta3->PRE_HEAP;
     1.5        }
     1.6  
     1.7 +      _delta1->clear();
     1.8 +      _delta2->clear();
     1.9 +      _delta3->clear();
    1.10 +      _tree_set->clear();
    1.11 +
    1.12        for (NodeIt n(_graph); n != INVALID; ++n) {
    1.13          Value max = 0;
    1.14          for (OutArcIt e(_graph, n); e != INVALID; ++e) {
    1.15 @@ -1905,6 +1910,10 @@
    1.16          (*_delta3_index)[e] = _delta3->PRE_HEAP;
    1.17        }
    1.18  
    1.19 +      _delta2->clear();
    1.20 +      _delta3->clear();
    1.21 +      _tree_set->clear();
    1.22 +
    1.23        for (NodeIt n(_graph); n != INVALID; ++n) {
    1.24          Value max = - std::numeric_limits<Value>::max();
    1.25          for (OutArcIt e(_graph, n); e != INVALID; ++e) {