Skip to content
#

minimum-cut

Star

Here is 1 public repository matching this topic...

Language: Kotlin
Filter by language
All 20 C++ 6 Python 5 Java 2 C 1 HTML 1 JavaScript 1 Jupyter Notebook 1 Kotlin 1 Rust 1 TeX 1

darian-catalin-cucer / minimum-cut

Star 0

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.

ruby kotlin java html algorithm js algorithms cpp minimum minimum-spanning-trees algorithms-and-data-structures minimum-spanning-tree minimum-cut minumum
  • Updated Feb 9, 2023
  • Kotlin

Improve this page

Add a description, image, and links to the minimum-cut topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the minimum-cut topic, visit your repo's landing page and select "manage topics."

Learn more