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.
Learn widely used algorithms
·
Module 6
Shortest Path & MST Algorithms
1
Dijkstra's Algorithm: Shortest Paths and Limitations
Apply Dijkstra's algorithm to find single-source shortest paths and explain its limitations.
2
Bellman-Ford: Handling Negative Edge Weights and Cycles
Apply the Bellman-Ford algorithm for graphs with negative edge weights and to detect negative cycles.
3
Union-Find with Path Compression and Union by Rank
Describe the union-find data structure with path compression and union by rank.
4
Kruskal's Algorithm and Union-Find for MSTs
Apply Kruskal's algorithm using union-find to find a Minimum Spanning Tree (MST).
5
Prim's Algorithm with Priority Queues
Apply Prim's algorithm using a priority queue to find a Minimum Spanning Tree (MST).
Previous module
Graph Traversal Techniques
Next module
Introduction to Dynamic Programming