Skip to content

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.

Notifications You must be signed in to change notification settings

darian-catalin-cucer/minimum-cut

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 

Repository files navigation

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

  1. Clone the repository: git clone https://github.com/cucerdariancatalin/MinimumCut.git
  2. Open the project in Android Studio
  3. 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.

About

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.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages