Skip to content

Latest commit

 

History

22 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 

Repository files navigation

Karger's algorithm

An implementation of the Karger's algorithm for finding a minimum cut in a graph with high probability.

image from wikipedia

About

Implement with C++ the karger's algorithm which designed to find a minimum cut in a connected graph with high probability.

Topics

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages