Why it matters

Reverse-delete rounds out MST algorithm knowledge. Historically important.

Advertisement

The architecture

Sort edges descending.

Try removing each: check connectivity.

Keep if disconnecting.

Reverse-deleteSort descby weightTry removecheck connectivityKeep if breaksconnectivitySlower than Kruskal/Prim; primarily of theoretical interest
Reverse-delete.
Advertisement

How it works end to end

Connectivity check per edge.

Best-known: O(E log V (log log V)^3).

Impractical vs Kruskal.