Dynamic City Road Network

You are given a model of a city's road network represented as a weighted, directed graph. Each node in the graph represents an intersection, and each directed edge represents a road with an associated travel time. The twist is that traffic conditions are dynamic: when a traffic sensor reports an issue on a road, the travel time for that road increases for a specified duration (e.g., the next k minutes).

Your task is to design and implement a system that supports the following operations:

1. Update Operation: Dynamically adjust the travel time for any given road when a new traffic report comes in. The update should be efficient enough to handle frequent changes.

2. Query Operation: Quickly compute the fastest route between any two intersections considering the current travel times. The system should be optimized for rapid queries even if the underlying graph has been updated recently.

Focus on:

• Designing the appropriate data structures to represent the road network and accommodate real-time updates.
• Implementing an efficient algorithm that recalculates the shortest path after updates without a complete recomputation from scratch.
• Balancing the trade-offs between update performance and query response times.

Deliver a prototype that clearly demonstrates both the update and query functionalities. You do not need to create a full-scale application; a command-line based prototype that runs through a series of updates and queries is sufficient.