
blossom5-v2.05.src:
  The newest version of the blossom library I could find.
  Note the licence does not allow you to use it for commercial applications!
  If you want to use a different matching library, please ask me first.
  NOTE: blossomV will SEGFAULT if no perfect matching exists (at least I was told so)!

src:
  Currently contains example code for finding a minimum weight perfect matching on a 
  complete (!) graph. Your task implement an algorithm also working on non-complete 
  graphs, so you need to change this when reading the file.
  You can look at how to use the matching algorithm after you created a modified graph
  having a perfect matching.

.compile.sh, clean.sh:
  simple bash scripts for compiling and cleaning


RUN: 
     ./bin/minimum-weight-perfect-matching <dimacs-file>
  Example:
     ./bin/minimum-weight-perfect-matching ./instances/K1024.dimacs  

