Graph Theory algorithms: Vertex Coloring, Bellman-Ford, Dijkstra's, Hopcroft-Karp, Prim's, Topological Sorting, Floyd-Warshall
Advance algorithm implementations
Z- algorithm for pattern matching, Trie-Aho-Corasick Automaton(FGREP), Hungarian Algorithm for the Munkres Assignment Problem, Binary Lifting, Eulerian Tour for Least Common Ancestor(LCA) using Sparse Table coupled with Farach-Colton and Bender optimization, Wellsh Powell Algorithm for Graph Coloring, Kahn's Agorithm for TopSort and Cycle detect…
Hopcroft-Karp matching Implementation in Apex
AGT course project on maximum matching in bipartite and general graphs
The Hopcroft-Karp Algorithm Finds the Maximum Matching in a Bipartite Graph, A Graph whose Vertices can be Separated into Two Disjoint Sets, with Every Edge Connecting Vertices between These sets and None Within a Set. The goal is to Select as Many Edges as Possible so that No Two Edges Share a Vertex
A memory-efficient matching algorithm (Kuhn–Munkres and Hopcroft–Karp) implementation based on JGraphT in Java
A small CLI to get a bisimulation relation between two processes
Graph-based seminar topic allocation using maximum bipartite matching, with minimum vertex cover for bottleneck analysis and explanation of unmet assignments.
The algorithms were written as part of the Algorithms and Data Structures class at UMCS.
Implementation of Hopcroft-Karp algorithm in R. (用R语言实现Hopcroft-Karp算法)
16 Algorithms for competitions and job interviews
Add a description, image, and links to the hopcroft-karp topic page so that developers can more easily learn about it.
To associate your repository with the hopcroft-karp topic, visit your repo's landing page and select "manage topics."