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
- Introduction and Principles of Algorithms
- Principles of Algorithms (Part 2)
- Introduction to Graphs
- Undirected Graph
- Algorithms for finding Shortest Path
- Algorithms for finding Shortest Path Part 2
- Single source shortest path problem
- Properties of shortest path distances
- Properties of shortest path distances Part 2
- Belman Equation
- Shortest Path Trees
- Bounded Walks and Paths
- Bounded Walks and Paths 2
- Bellman Ford P1
- Bellman Ford P2
- Dijkstra Algorithm
- Dijkstra Algorithm P2
- Dijkstra Algorithm P3
- All Pair Shortest Path
- All Pair Shortest Path 2
- All Pair Shortest Path 3&4
- All Pair Shortest Path 5
- Prims Algorithm
- Prims Algorithm P2
- Kruskal's Algorithm
- Kruskal's Algorithm 2
- Kruskal's Algorithm 3
- DFS
- DFS
- Algorithm for Cut Vertex
- Iterative DFS
- DFS in Directed Graph
- Strong Connected Components
- Strong Connected Components Part 2
- Strong Connected Components Part 3
- Strong Connected Components Part 4
- 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