About this project

This single-page demo implements the algorithm described in “Kőnig-Egerváry graphs, 2-bicritical graphs and fractional matchings” by Jean-Marie Bourjolly and William R. Pulleyblank (paper link). The core routine finds a maximum fractional matching while minimising the number of fractional (½) edges.

Author

Roi Sibony
B.Sc. Computer Science
Email: roisi20041@gmail.com

What you can do here

1. Paste or generate a graph.
2. Preview it instantly.
3. Run the algorithm — red edges have weight 1, green = ½, black = 0.
4. See a full debug log of every augmentation step.

Made as Research Algorithm Assignment 🙂