This repository contains concise notes and implementations of essential Data Structures and Graph Algorithms. It covers topics like hash tables, binomial heaps, various shortest path algorithms, spanning trees, topological sorting, and maximum flow using Ford-Fulkerson. Ideal for quick revision, interview prep, or competitive programming.
- Hash Table
- Binomial Heap
- BFS & DFS
- Bipartiteness
- Minimum Spanning tree (Prim and Kruskal + 2nd MST)
- Strongly Connected Components
- Shortest Path Algorithms
- Dijkstra
- Bellman Ford
- Efficient Shortest path using DAG
- Single Destination Shortest Path
- All pair shortest path
- Topological Sort + Cycle Detection - Simple Toposort - lexicographical toposort - Kahn's Algo
- Ford Fulkerson's Algorithm