[url=http://64.233.183.104/search?q=cache:3ApUO60jWRkJ:www.cs.ucsb.edu/~cappello/janet/examples/tsp/upperbounders/matching/mincostmaxmatch/MinCostMaxMatch.java+edmonds+filetype:java&hl=en]Edmonds' algorithm[/url]
[url=http://classes.engr.oregonstate.edu/eecs/winter2005/cs325/clrs2e/EdmondsKarp.java]Edmonds-Karp algorithm[/url]
They both make use of 3rd party packages, but maybe it's of help to you.
> Thanks.This is the whole algorithm but unfortunately
> it is not yet implemented the blossom
> procedure.Can you send me the link?
Unfortenatelly I could't find an implementation of the Edmonds' Blossom algortihm. I did find an article about efficient graph algorithms [url=zuseex.algo.informatik.tu-darmstadt.de/lehre/2004ws/graphalgo/mat/all.pdf]here[/url] where on pages 145/146 there's given a pseudo-code version of the algorithm.
Good luck.