This is an OCaml implementation of the blossom algorithm. It finds a maximum matching of vertices on general, undirected, weighted graphs.
-
-
Notifications
You must be signed in to change notification settings - Fork 0
johnridesabike/ocaml-blossom
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published