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 Python programming
·
Module 12
Shortest Paths and Minimum Spanning Trees
1
Dijkstra's Algorithm with Priority Queues
Implement Dijkstra's algorithm using a priority queue to find single-source shortest paths
2
Bellman-Ford: Use Cases with Negative Edges
Describe the use cases for Bellman-Ford algorithm (graphs with negative weight edges)
3
Implementing DSU with Path Compression and Union by Rank/Size
Implement the Disjoint Set Union (DSU) data structure with path compression and union by rank/size
4
DSU for Connectivity: Provinces Problem
Apply DSU to solve connectivity problems, such as finding the number of provinces
5
Kruskal's Algorithm for MST with DSU
Implement Kruskal's algorithm to find a Minimum Spanning Tree (MST) using DSU
End of course,
Back to course
Previous module
Graph Traversal Algorithms
Next module