Learn · Introduction to Graph Algorithms
Lecture 33 of 37Week 8 Strong Connected Components & BFS
Strong Connected Components
Prof. C Pandu Rangan · IISc Bangalore
Credits and licence
- From
- Introduction to Graph Algorithms, IISc Bangalore (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- Tweens profiles and older. How courses are placed
All the 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