1.1 --- a/lemon/pr_bipartite_matching.h	Mon Feb 25 12:35:06 2008 +0000
     1.2 +++ b/lemon/pr_bipartite_matching.h	Wed Feb 27 11:39:03 2008 +0000
     1.3 @@ -480,6 +480,7 @@
     1.4    int prBipartiteMatching(const Graph &g)
     1.5    {
     1.6      PrBipartiteMatching<Graph> bpm(g);
     1.7 +    bpm.run();
     1.8      return bpm.matchingSize();
     1.9    }
    1.10  
    1.11 @@ -549,7 +550,8 @@
    1.12    bool prPerfectBipartiteMatching(const Graph &g)
    1.13    {
    1.14      PrBipartiteMatching<Graph> bpm(g);
    1.15 -    return bpm.runPerfect();
    1.16 +    bpm.run();
    1.17 +    return bpm.checkedRunPerfect();
    1.18    }
    1.19  
    1.20    ///Perfect matching in a bipartite graph