Intro to Graph Algorithms

Time:

15 October 2013
21:00 hrs to 22:00 hrs

Speaker/(s)

Umang Mathur

Venue

Seminar Hall

This was an introductory session on graph algorithms, mostly catering for ACM ICPC Participants. We had a mixed crowd from a couple of freshies to quite a few enthusiastic fourthies.

Topics Covered

• Basics of Graph Representation
• DFS/BFS
• Dijkstra’s algorithm
• Directed Acyclic Graph (DAG)
• Topological Sort
• Prim’s algorithm - minimum spaning tree
• Kruskal’s algorithm
• Strongly Connected Component
• Tarjan’s algorithm
• Max flow algorithm