Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Implement Hopcroft-karp algorithm to find the maximum matching #655

Open
wants to merge 10 commits into
base: main
Choose a base branch
from
1 change: 1 addition & 0 deletions AUTHORS
Original file line number Diff line number Diff line change
Expand Up @@ -11,3 +11,4 @@ Pratik Goyal <[email protected]>
Jay Thorat <[email protected]>
Rajveer Singh Bharadwaj <[email protected]>
Kishan Ved <[email protected]>
Akshat Shukla <[email protected]>
3 changes: 3 additions & 0 deletions pydatastructs/graphs/__init__.py
Original file line number Diff line number Diff line change
Expand Up @@ -22,6 +22,9 @@
topological_sort,
topological_sort_parallel,
max_flow,
maximum_matching,
maximum_matching_parallel,
bipartite_coloring,
find_bridges
)

Expand Down
Loading
Loading