Graph Algorithms
Traverse graphs, find shortest paths, and apply topological sorting.
0%
Confidence · no data yet
After this skill you can…
- Implement BFS and DFS iteratively and recursively
- Apply Dijkstra's and Bellman-Ford for shortest paths
- Detect cycles and compute topological order
Prerequisites
Watch (10 videos)
Graph Theory Algorithms
→ Analyze graph structures→ Optimize graph algorithms→ Apply graph theory to real-world problems
Max Flow Ford Fulkerson | Source Code
→ Implement Ford-Fulkerson method→ Solve network flow problems
Implement Dijkstra's Algorithm
→ Apply graph algorithms to problems→ Optimize graph solutions
Breadth First Search Algorithm | Shortest Path | Graph Theory
→ Find shortest path in unweighted graph→ Explore nodes and edges in a graph→ Apply BFS algorithm to real-world problems
Redundant Connection - Leetcode 684 - Python
→ Solve graph problems using graph theory→ Implement graph algorithms in Python
Tarjan's Strongly Connected Component (SCC) Algorithm (UPDATED) | Graph Theory
→ Implement Tarjan's SCC algorithm→ Analyze graph structures with SCC
Union Find Introduction
→ Apply Union Find to graph problems→ Solve network connectivity problems
Union Find Path Compression
→ Apply Union Find to solve graph problems→ Optimize graph algorithms using path compression
Graph Algorithms for Technical Interviews - Full Course
→ Implement graph algorithms→ Solve coding challenges using graph algorithms→ Understand graph theory and data structures
Graph Algorithms Crash Course (with Java)
→ Implement graph algorithms in Java→ Solve problems using graph data structures→ Apply DFS, BFS, and Dijkstra's Algorithm
DeepCamp AI