Skip to content
master
Go to file
Code

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
src
 
 
 
 
 
 
 
 
 
 

README.md

Randomized Contraction Algorithm for The Minimum Cut Problem

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.

About

No description, website, or topics provided.

Resources

License

Releases

No releases published

Packages

No packages published

Languages

You can’t perform that action at this time.