GitHub / darian-catalin-cucer / minimum-cut

The Minimum Cut problem is a fundamental concept in computer science and graph theory. It involves finding the minimum number of edges that must be removed from a graph to separate the graph into two disjoint sets of vertices. The solution to this problem has important applications in various fields, such as network design, image processing, etc.

JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/darian-catalin-cucer%2Fminimum-cut
PURL: pkg:github/darian-catalin-cucer/minimum-cut

Topics: algorithm, algorithms, algorithms-and-data-structures, cpp, html, java, js, kotlin, minimum, minimum-cut, minimum-spanning-tree, minimum-spanning-trees, minumum, ruby

• Files
• Readme
• Dependencies