In this project I coded up the randomized contraction algorithm and used it to compute the min cut (the minimum possible number of crossing edges) of an undirected graph.
The java codes I wrote are in the src folder.
-
Notifications
You must be signed in to change notification settings - Fork 0
License
EmpiricalAnalysis/Randomized-Contraction-Algorithm-for-The-Minimum-Cut-Problem
About
No description, website, or topics provided.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published