Skip to content

Latest commit

 

History

History
11 lines (7 loc) · 370 Bytes

README.md

File metadata and controls

11 lines (7 loc) · 370 Bytes

Parallel Egervary’s Algorithm

Implemented parallel and sequencial versions of the Egervary's algorithm for finding a maximum matching in a bipartite graph. The school project for the Graph Algorithms Course (GAL).

Used: C, pthread, Python, python-igraph

Authors: