DSA-2-CSE-208

Data Structures

Hash Table
Binomial Heap

Algorithms

Graph Algorithms

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

Maximum Flow

Ford Fulkerson's Algorithm