Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

A Python implementation of Edmond's blossom algorithm to find maximum matchings in general graphs

NotificationsYou must be signed in to change notification settings

adharshkamath/Edmonds-Algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

27 Commits
 
 
 
 
 
 

Repository files navigation

Code for the IT251 project - Implementing Edmonds blossom algorithm

To run the main file:

$ cd src$ pip3 install -r requirements.txt$ python3 main.py

Once the main file is run, a PNG image will be generated and opened, describing the input graph.

On closing this file, the algorithm will be run and the output graph will be generated and opened as another PNG image.

The edges in the matching will be colored red.

About

A Python implementation of Edmond's blossom algorithm to find maximum matchings in general graphs

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Contributors4

  •  
  •  
  •  
  •  

Languages


[8]ページ先頭

©2009-2025 Movatter.jp