CU

cucer-castellano/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.

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

Minimum Cut Android App

An open-source Android application that implements the minimum cut algorithm in Kotlin.

Features

User-friendly interface for inputting graph information
Implements the Karger's algorithm for finding minimum cut
Visual representation of the graph and cut
Can be used by students, computer scientists, and mathematicians alike

Getting Started

Clone the repository: git clone https://github.com/cucerdariancatalin/MinimumCut.git
Open the project in Android Studio
Build and run the app on an emulator or physical device

Contributing

We welcome contributions to the project. If you want to contribute, please fork the repository and submit a pull request with your changes.

License

This project is licensed under the MIT License. See LICENSE for details.

On this page

Contributors

Created February 6, 2023

Updated February 9, 2023