diff -r a3ba22ebccc6 -r 88b81ec599ed lemon/max_matching.h
--- a/lemon/max_matching.h	Fri Dec 28 11:00:51 2007 +0000
+++ b/lemon/max_matching.h	Sat Dec 29 15:11:41 2007 +0000
@@ -30,7 +30,7 @@
 
 ///\ingroup matching
 ///\file
-///\brief Maximum matching algorithm in undirected graph.
+///\brief Maximum matching algorithms in undirected graph.
 
 namespace lemon {
 
@@ -1467,7 +1467,7 @@
       int b = _blossom_set->find(_ugraph.source(pred));
       int d = _blossom_set->find(_ugraph.source(next));
       
-      int ib, id;
+      int ib = -1, id = -1;
       for (int i = 0; i < int(subblossoms.size()); ++i) {
 	if (subblossoms[i] == b) ib = i;
 	if (subblossoms[i] == d) id = i;
@@ -2654,7 +2654,7 @@
       int b = _blossom_set->find(_ugraph.source(pred));
       int d = _blossom_set->find(_ugraph.source(next));
       
-      int ib, id;
+      int ib = -1, id = -1;
       for (int i = 0; i < int(subblossoms.size()); ++i) {
 	if (subblossoms[i] == b) ib = i;
 	if (subblossoms[i] == d) id = i;