Skip to content

AGT course project on maximum matching in bipartite and general graphs

License

Notifications You must be signed in to change notification settings

bhargeymehta/agt-max-matchings

Repository files navigation

agt-max-matchings

Contains the files related to the course project on Maximum Matchings for the course CS406 Algorithmic Graph Theory offered at DA-IICT'20.

  1. Hopcroft Karp Algorithm
  2. Hungarian Algorithm
  3. Blossom Algorithm