Algorithmshard

Kruskal vs Prim for MST — how do they differ?

Answer

Kruskal sorts edges and adds the smallest ones that don’t create cycles (uses Union-Find). Prim grows a tree from a start node using a priority queue of edges. Both can be O(E log E) / O(E log V) depending on implementation.

Related questions

Algorithms

A* search: how does the heuristic affect optimality?

#a-star#heuristic#shortest-path

Algorithms

Quickselect: what is it used for and what is its expected complexity?

#quickselect#selection#partition

Algorithms

Kruskal vs Prim: what is the main difference and typical data structures?

#mst#kruskal#prim

Algorithms

Bellman–Ford: when do you use it and what extra capability does it have over Dijkstra?

#bellman-ford#shortest-path#graphs

Algorithms

What is a monotonic queue and how does it solve sliding window max in O(n)?

#deque#monotonic-queue#sliding-window

Algorithms

What does the Floyd–Warshall algorithm compute and what is its complexity?

#graphs#shortest-path#floyd-warshall