/maximum-matching

The Maximum Matching algorithm finds the largest possible set of edges in a graph with no common vertices. It has applications in computer science, mathematics, and operations research and can be solved efficiently with algorithms such as augmenting path and Hopcroft-Karp with a time complexity of O(E√V).

Primary LanguageKotlin

Maximum Matching Android App

An open-source Android application that implements the maximum matching algorithm in Kotlin.

Features

  • User-friendly interface for inputting graph information
  • Implements the Hopcroft-Karp algorithm for finding maximum matching
  • Visual representation of the graph and matching
  • Can be used by students, computer scientists, and mathematicians alike

Getting Started

  1. Clone the repository: git clone https://github.com/cucerdariancatalin/MaximumMatching.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.