Back to Discover
🔢

Prim's algorithm

math Maturity 7-9

We can connect dots with lines. We want to use the shortest lines. We pick the smallest line first. Then we find the next small line. This helps us save space. It is like making a path.

PrimAlgDemo.gif
PrimAlgDemo.gif
Can you find the shortest way?

46 words
🖼️ Images & Media (5)
File:PrimAlgDemo.gif
PrimAlgDemo.gif
File:Prim's algorithm.svg
Prim's algorithm.svg
MAZE 30x20 Prim.ogv
File:Prim's algorithm proof.svg
Prim's algorithm proof.svg
File:Distributed adjacency matrix for parallel prim.png
Distributed adjacency matrix for parallel prim.png
Up Next
🔢
Kruskal's algorithm
Math
→
More to explore

✨ What else?

Related topics you might enjoy

Kruskal's algorithm 0% Dijkstra's algorithm 0% Component (graph theory) 0% Depth-first search 0% Tree (graph theory) 0% Breadth-first search 0%

🔬 Go deeper

More advanced topics to explore

Component (graph theory) Tree (abstract data type) Shortest path problem

🪜 Step back

Simpler topics to build understanding

Kruskal's algorithm Dijkstra's algorithm Dynamic programming Depth-first search
📚 Content adapted from Wikipedia | Readability: FK 13.3 | Vital Level 5