Java implementation of Edmonds blossom algorithm to find minimal 1-factor in a weighted graph inspired by http://kedrigern.dcs.fmph.uniba.sk/kralovic/new/documents/2-inf-221-apx/dualita.pdf (page 64) It's a netbeans project.
Primary LanguageJava