COIN-OR::LEMON - Graph Library

Changeset 2549:88b81ec599ed in lemon-0.x


Ignore:
Timestamp:
12/29/07 16:11:41 (11 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:
1 added
2 edited

Legend:

Unmodified
Added
Removed
  • lemon/max_matching.h

    r2548 r2549  
    3131///\ingroup matching
    3232///\file
    33 ///\brief Maximum matching algorithm in undirected graph.
     33///\brief Maximum matching algorithms in undirected graph.
    3434
    3535namespace lemon {
     
    14681468      int d = _blossom_set->find(_ugraph.source(next));
    14691469     
    1470       int ib, id;
     1470      int ib = -1, id = -1;
    14711471      for (int i = 0; i < int(subblossoms.size()); ++i) {
    14721472        if (subblossoms[i] == b) ib = i;
     
    26552655      int d = _blossom_set->find(_ugraph.source(next));
    26562656     
    2657       int ib, id;
     2657      int ib = -1, id = -1;
    26582658      for (int i = 0; i < int(subblossoms.size()); ++i) {
    26592659        if (subblossoms[i] == b) ib = i;
  • test/Makefile.am

    r2483 r2549  
    3131        test/matrix_maps_test \
    3232        test/max_matching_test \
     33        test/max_weighted_matching_test \
    3334        test/min_cost_flow_test \
    3435        test/path_test \
     
    8081test_matrix_maps_test_SOURCES = test/matrix_maps_test.cc
    8182test_max_matching_test_SOURCES = test/max_matching_test.cc
     83test_max_weighted_matching_test_SOURCES = test/max_weighted_matching_test.cc
    8284test_min_cost_flow_test_SOURCES = test/min_cost_flow_test.cc
    8385test_path_test_SOURCES = test/path_test.cc
Note: See TracChangeset for help on using the changeset viewer.