Changeset 2549:88b81ec599ed in lemon-0.x

Timestamp:

12/29/07 16:11:41 (16 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3426

Message:

Test program for max weighted matchings

Files:

• lemon/max_matching.h (modified) (3 diffs)
• test/Makefile.am (modified) (2 diffs)
• test/max_weighted_matching_test.cc (added)

lemon/max_matching.h

@@ -31 +31 @@
 ///\ingroup matching
 ///\file
-///\brief Maximum matching algorithm in undirected graph.
+///\brief Maximum matching algorithms in undirected graph.
 
 namespace lemon {
@@ -1468 +1468 @@
       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;
@@ -2655 +2655 @@
       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;

test/Makefile.am

@@ -31 +31 @@
         test/matrix_maps_test \
         test/max_matching_test \
+        test/max_weighted_matching_test \
         test/min_cost_flow_test \
         test/path_test \
@@ -80 +81 @@
 test_matrix_maps_test_SOURCES = test/matrix_maps_test.cc
 test_max_matching_test_SOURCES = test/max_matching_test.cc
+test_max_weighted_matching_test_SOURCES = test/max_weighted_matching_test.cc
 test_min_cost_flow_test_SOURCES = test/min_cost_flow_test.cc
 test_path_test_SOURCES = test/path_test.cc