1.1 --- a/lemon/max_matching.h	Fri Dec 28 11:00:51 2007 +0000
     1.2 +++ b/lemon/max_matching.h	Sat Dec 29 15:11:41 2007 +0000
     1.3 @@ -30,7 +30,7 @@
     1.4  
     1.5  ///\ingroup matching
     1.6  ///\file
     1.7 -///\brief Maximum matching algorithm in undirected graph.
     1.8 +///\brief Maximum matching algorithms in undirected graph.
     1.9  
    1.10  namespace lemon {
    1.11  
    1.12 @@ -1467,7 +1467,7 @@
    1.13        int b = _blossom_set->find(_ugraph.source(pred));
    1.14        int d = _blossom_set->find(_ugraph.source(next));
    1.15        
    1.16 -      int ib, id;
    1.17 +      int ib = -1, id = -1;
    1.18        for (int i = 0; i < int(subblossoms.size()); ++i) {
    1.19  	if (subblossoms[i] == b) ib = i;
    1.20  	if (subblossoms[i] == d) id = i;
    1.21 @@ -2654,7 +2654,7 @@
    1.22        int b = _blossom_set->find(_ugraph.source(pred));
    1.23        int d = _blossom_set->find(_ugraph.source(next));
    1.24        
    1.25 -      int ib, id;
    1.26 +      int ib = -1, id = -1;
    1.27        for (int i = 0; i < int(subblossoms.size()); ++i) {
    1.28  	if (subblossoms[i] == b) ib = i;
    1.29  	if (subblossoms[i] == d) id = i;