Advanced AADS

Welcome to this repository, here you'll find the implementation of the hardest data structures and algorithms in my University's advanced AADS course.

1. Binomial Heap

2. Fibonacci Heap

3. Malhotra Kumar Maheshwari O(V^3) max flow algorithm, V - number of vertices

4. Relabel to front O(V^3) max flow algorithm, V - number of vertices

5. O(nlogn) offline checker for n points being INSIDE, OUTSIDE or on the BORDER of non convex simple polygon

6. Suffix Array and Referen problem solution

7. Suffix Tree and Referen problem solution

8. Suffix Automaton and Referen problem solution