Changeset 2549:88b81ec599ed in lemon-0.x for lemon/max_matching.h
- Timestamp:
- 12/29/07 16:11:41 (16 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3426
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/max_matching.h
r2548 r2549 31 31 ///\ingroup matching 32 32 ///\file 33 ///\brief Maximum matching algorithm in undirected graph.33 ///\brief Maximum matching algorithms in undirected graph. 34 34 35 35 namespace lemon { … … 1468 1468 int d = _blossom_set->find(_ugraph.source(next)); 1469 1469 1470 int ib , id;1470 int ib = -1, id = -1; 1471 1471 for (int i = 0; i < int(subblossoms.size()); ++i) { 1472 1472 if (subblossoms[i] == b) ib = i; … … 2655 2655 int d = _blossom_set->find(_ugraph.source(next)); 2656 2656 2657 int ib , id;2657 int ib = -1, id = -1; 2658 2658 for (int i = 0; i < int(subblossoms.size()); ++i) { 2659 2659 if (subblossoms[i] == b) ib = i;
Note: See TracChangeset
for help on using the changeset viewer.