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)
Lecture 15: Max-Flow Min-Cut Theorem
→ Analyze graph structures→ Implement graph algorithms→ Optimize network flows
Graph Projections and In-Memory Graphs
→ Implement graph traversal algorithms→ Use graph algorithms for data analysis
Neo4J Graph Data Science Library (GDS)
→ Implement centrality algorithms like PageRank and Betweenness Centrality→ Use community detection algorithms like Louvain and Label Propagation
Knowledge Graph Pathfinding and Traversal
→ Analyze graph structures→ Apply graph algorithms to real-world problems
Union Find Path Compression
→ Apply Union Find to solve graph problems→ Optimize graph algorithms using path compression
Union Find Introduction
→ Apply Union Find to graph problems→ Solve network connectivity problems
Graph Theory 1 [Programming Competition Problems]
→ Analyze Graphs→ Apply Graph Algorithms→ Optimize Graph Solutions
Minimum Time to Collect All Apples in a Tree - Leetcode 1443 - Python
→ Implement graph algorithms→ Analyze graph structures
Graph Algorithms for Technical Interviews - Full Course
→ Implement graph algorithms→ Solve coding challenges using graph algorithms→ Understand graph theory and data structures
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
DeepCamp AI