Welcome to this repository, here you'll find the implementation of the hardest data structures and algorithms in my University's advanced AADS course.
-
Binomial Heap
-
Fibonacci Heap
-
Malhotra Kumar Maheshwari O(V^3) max flow algorithm, V - number of vertices
-
Relabel to front O(V^3) max flow algorithm, V - number of vertices
-
O(nlogn) offline checker for n points being INSIDE, OUTSIDE or on the BORDER of non convex simple polygon
-
Suffix Array and Referen problem solution
-
Suffix Tree and Referen problem solution
-
Suffix Automaton and Referen problem solution