Graph Theory

Day 1 (3 hours)

1. Breadth-First Search (BFS) (1.5 hours)

2. Dijkstra’s Algorithm (1.5 hours)

Day 2 (3 hours)

1. Floyd-Warshall Algorithm (1.5 hours)

2. Bellman-Ford Algorithm (1.5 hours)

Day 3 (3 hours)

1. Minimum Spanning Trees (Kruskal’s Algorithm) (1.5 hours)

2. Prim’s Algorithm (1.5 hours)

Day 4 (3 hours)

1. Network Flow: Ford-Fulkerson Algorithm (1.5 hours)

2. Network Flow: Edmonds-Karp Algorithm (1.5 hours)

Day 5 (3 hours)

1. Topological Sorting (1.5 hours)

2. Strongly Connected Components (Kosaraju’s Algorithm) (1.5 hours)