Core Concept

Types of problems that can be asked

1. BFS, DFS (Standard algorithm)

2. 0-1 BFS (Modified algorithm) , (Multisource BFS)

3. Dijsktra (Standard and modified)

4. Bidirectional search (to lower branching factor , A* is an overkill)

5. Graph Coloring (Bipartite graph)

6. Topological Sort (Standard and modified algorithm)

7. Minimum Spanning Tree

8. Floyd Warshell

9. NP hard problems ( using bitmask)

10. Graph bridges (time of visiting node)

11. Disjoint union set