IISc Bangalore · Computer Science

Introduction to Graph Algorithms

Prof. C Pandu Rangan · 37 free video lectures

A Computer is basically an information processing system and this means it can be used for solving only abstract mathematical problems. That is why, solving a Real World Problem (RWP) by using a computer, begins with a formulation of the RWP as a Mathematical problem in an appropriate mathematical…

▶ Play on Open Lecture HallCourse page ↗

Lectures

  1. Introduction and Principles of Algorithms
  2. Principles of Algorithms (Part 2)
  3. Introduction to Graphs
  4. Undirected Graph
  5. Algorithms for finding Shortest Path
  6. Algorithms for finding Shortest Path Part 2
  7. Single source shortest path problem
  8. Properties of shortest path distances
  9. Properties of shortest path distances Part 2
  10. Belman Equation
  11. Shortest Path Trees
  12. Bounded Walks and Paths
  13. Bounded Walks and Paths 2
  14. Bellman Ford P1
  15. Bellman Ford P2
  16. Dijkstra Algorithm
  17. Dijkstra Algorithm P2
  18. Dijkstra Algorithm P3
  19. All Pair Shortest Path
  20. All Pair Shortest Path 2
  21. All Pair Shortest Path 3&4
  22. All Pair Shortest Path 5
  23. Prims Algorithm
  24. Prims Algorithm P2
  25. Kruskal's Algorithm
  26. Kruskal's Algorithm 2
  27. Kruskal's Algorithm 3
  28. DFS
  29. DFS
  30. Algorithm for Cut Vertex
  31. Iterative DFS
  32. DFS in Directed Graph
  33. Strong Connected Components
  34. Strong Connected Components Part 2
  35. Strong Connected Components Part 3
  36. Strong Connected Components Part 4
  37. BFS

From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IISc Bangalore.

Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights