Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Comprehensive software engineering curriculum
·
Module 4
Core Graph Algorithms
1
Dijkstra's Algorithm: Finding the Shortest Path
Implement Dijkstra's algorithm to find the shortest path in a weighted graph.
2
Bellman-Ford: Pathfinding and Negative Cycle Detection
Implement the Bellman-Ford algorithm and explain its use for detecting negative cycles.
3
Kruskal's Algorithm with Union-Find
Implement Kruskal's algorithm for finding a Minimum Spanning Tree using a Union-Find data structure.
4
Prim's Algorithm with Priority Queues
Implement Prim's algorithm for finding a Minimum Spanning Tree using a priority queue.
5
Union-Find with Optimizations
Implement the Union-Find data structure with path compression and union by rank optimizations.
Graph Algorithms: A Comparative Analysis
Compare Dijkstra's vs. Bellman-Ford and Prim's vs. Kruskal's, explaining their specific use cases and constraints.
Previous module
Advanced Structures: Heaps and Graphs
Next module
Algorithmic Design Paradigms