https://github.com/samuela/karger

Karger's min-cut algorithm in OCaml
https://github.com/samuela/karger

functional-programming karger ocaml

Last synced: 29 days ago
JSON representation

Karger's min-cut algorithm in OCaml

• Host: GitHub
• URL: https://github.com/samuela/karger
• Owner: samuela
• Created: 2018-10-17T05:41:14.000Z (over 6 years ago)
• Default Branch: master
• Last Pushed: 2018-10-17T05:41:37.000Z (over 6 years ago)
• Last Synced: 2024-12-23T22:11:30.321Z (about 1 month ago)
• Topics: functional-programming, karger, ocaml
• Language: OCaml
• Size: 2.18 MB
• Stars: 0
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Karger's min-cut algorithm in OCaml

This is an implementation of Karger's min-cut algorithm implemented in OCaml. Check out the *.in files in this repo for some example graphs. You can run them with

```

$ ocaml karger.ml b0.in

starting...

Best cut so far: 14

Best cut so far: 8

...

```

The program will keep searching for min-cuts and print updates each time it finds a better one.

See https://en.wikipedia.org/wiki/Karger%27s_algorithm for more information.