Traffic Flow Simulation with Dynamic Path Optimization

This program simulates logistics movement within a transportation network, implementing a dynamic shortest-path selection algorithm. The system prioritizes shortest paths when viable, and recalculates alternative routes when capacity constraints are encountered at intermediate nodes. The core path-finding function requires iterative invocation to maintain optimal routing decisions throughout the simulation.