Given a weighted graph where edge weights change dynamically over time, design an algorithm to efficiently compute the shortest path between two nodes without re-running Dijkstra's algorithm from scratch on every change. Discuss the time complexity trade-offs and the data structures required for incremental updates.