The algorithm works by first finding a maximum matching in the bipartite graph, which is a set of edges that pairs as many nodes as possible without sharing any common nodes. Then, the maximum matching is converted into a vertex cover, which is a set of nodes that covers all the edges in the graph. Since the vertex cover alternates between the sets X and Y, it represents the minimum number of nodes required to cover all the edges in the graph.
- Install virtualenv:
pip install virtualenv
- Create a virtual environment:
python -m virtualenv env
- Activate the virtual environment:
- On Windows:
env\Scripts\activate
- On macOS and Linux:
source env/bin/activate
Install the required packages:
pip install -r requirements.txt
Run the main script:
python main.py
Build the project:
python setup.py
Click here to download the installation file.