## Graphs

**Relevant Course: **Advanced Data Structures and Algorithms

**Relevant Department : **Electrical Engineering

**Relevant Semester: **5^{th}

**Pre-requisite: **Knowledge of Data Structures and Algorithm is Preferable.

**Course Description & Outline :**

- Elementary Graph Algorithms: Representations of Graphs
- Breadth First Search and Depth-First Search. Strongly Connected Components
- Minimum Spanning Trees: Growing a Minimum Spanning Tree; Kruskal and Prim
- Problem sheet based on BFS, DFS, MST and shortest path algorithms (Dijkstra and Bellman Ford).
- Maximum Flow: Flow Networks; The Ford-Fulkerson method; Maximum Bipartite Matching

**Schedule for Lecture Delivery **

**Session 1 : **07-Sep-2015 (10-12 noon)

**Session 2 : **08-Sep-2015 (10-12 noon)

**Session 3 : **10-Sep-2015 (10-12 noon)