MaxMatching<SmartGraph> mm(graph);

     bool perfect;

     mm.run();

     {

     checkMatching(graph, mm);

       MaxMatching<SmartGraph> mm(graph);

       mm.run();

     MaxWeightedMatching<SmartGraph> mwm(graph, weight);

       checkMatching(graph, mm);

     mwm.run();

       perfect = 2 * mm.matchingSize() == countNodes(graph);

     checkWeightedMatching(graph, weight, mwm);

     }

     MaxWeightedPerfectMatching<SmartGraph> mwpm(graph, weight);

     {

     bool perfect = mwpm.run();

       MaxWeightedMatching<SmartGraph> mwm(graph, weight);

       mwm.run();

     check(perfect == (mm.matchingSize() * 2 == countNodes(graph)),

       checkWeightedMatching(graph, weight, mwm);

           "Perfect matching found");

     }

     if (perfect) {

     {

       checkWeightedPerfectMatching(graph, weight, mwpm);

       MaxWeightedMatching<SmartGraph> mwm(graph, weight);

       mwm.init();

       mwm.start();

       checkWeightedMatching(graph, weight, mwm);

     }

     {

       MaxWeightedPerfectMatching<SmartGraph> mwpm(graph, weight);

       bool result = mwpm.run();

       check(result == perfect, "Perfect matching found");

       if (perfect) {

         checkWeightedPerfectMatching(graph, weight, mwpm);

       }

     }

     {

       MaxWeightedPerfectMatching<SmartGraph> mwpm(graph, weight);

       mwpm.init();

       bool result = mwpm.start();

       check(result == perfect, "Perfect matching found");

       if (perfect) {

         checkWeightedPerfectMatching(graph, weight, mwpm);

       }