Problem Statement: You are responsible for managing a dynamic road network in a city. The city has intersections represented as nodes and roads as weighted edges (representing time to travel between intersections). Roads can be constructed or destroyed dynamically over time. You need to develop a system that:
Efficiently updates the road network when a road is added or removed.
Finds the shortest path between two intersections after each update.
Handles multiple queries for shortest paths in real time.
Problem Statement: You are responsible for managing a dynamic road network in a city. The city has intersections represented as nodes and roads as weighted edges (representing time to travel between intersections). Roads can be constructed or destroyed dynamically over time. You need to develop a system that:
Efficiently updates the road network when a road is added or removed. Finds the shortest path between two intersections after each update. Handles multiple queries for shortest paths in real time.