Side-by-Side Comparison
Synchronized interactive scrubber contrasting Prim's Heap cut-edge relaxation against Kruskal's cycle-checking DSU unions.
Single Algorithm Replay
Detailed frame-by-frame visualizer with play/pause, step controls, edge state inspection, and total cost tracker.
Empirical Benchmark Scaling
Log-log runtime charts evaluating Kruskal O(E log V) vs Prim Indexed Heap O(E log₄ V) vs Prim Dense O(V²).
⚡ Active View: Side-by-Side Algorithm Comparison
Console Solver & Resilience Transcripts
Small Network (6 Vertices) 61.6% Saved
Loaded: 6 vertices, 9 edges MST Total Cost: 5300 (Full mesh: 13800) Status: Verified optimal Components: 1 (Connected) Resilience: - Edge #0 (Core--Sw1): Protected (+300) - Edge #2 (Sw1--Sw2): Protected (+700) - Edge #7 (DB--Web): Protected (+1600) Second-Best MST: Cost 5600 (+300)
Large Network (40 Vertices) 58.4% Saved
Loaded: 40 vertices, 61 edges MST Total Cost: 33275 Status: Verified optimal Bridges Identified (Single Points of Failure): - Edge #42 (DataCenter-A -- Edge-Gateway-1) - Edge #43 (DataCenter-B -- Edge-Gateway-2) - Edge #46 (DataCenter-A -- Storage-SAN-1) - Edge #47 (DataCenter-B -- Storage-SAN-2)
Disconnected Forest 2 Partitions
Loaded: 8 vertices, 8 edges Components: 2 (Disconnected Forest) MSF Total Cost: 4850 Edges Chosen: 6 (V - c = 8 - 2 = 6) Acyclicity & Component Spanning: PASSED