We describe a new implementation of the Edmonds' algorithm for computing a perfect matching
of minimum cost, to which we refer as Blossom V. A key feature of our implementation
is a combination of two ideas that were shown to be effective
for this problem:
the "variable dual updates" approach of Cook and Rohe  and the use of priority queues.
We achieve this by maintaining an auxiliary graph whose nodes correspond to
alternating trees in the Edmonds' algorithm. While our use of priority queues
does not improve the worst-case complexity, it appears to lead to an efficient
In the majority of our tests Blossom V outperformed previous implementations
of Cook and Rohe  and of Mehlhorn and Schaefer , sometimes by an order of magnitude.
We also show that for large VLSI instances it is beneficial to update duals by solving a linear program,
contrary to a conjecture by Cook and Rohe.