Amortized O(1) decrease-key with cascading cuts visualization
A Fibonacci heap supports decrease-key in amortized O(1) time by lazily cutting nodes from their parents. When a node is cut a second time (marked), a cascading cut propagates upward. This achieves the amortized bounds that make Dijkstra's algorithm run in O(E + V log V).