🧪 Infrastructure Development Simulation

Real infrastructure spending is a constant trade-off between reaching everyone and reaching them cheaply. This simulator scatters a set of cities across a 3D terrain and greedily connects them with roads using Kruskal's minimum-spanning-tree algorithm, cutting construction short the moment the budget runs out so some cities can be left disconnected — exactly the kind of logistical and resource-allocation problem infrastructure planners face. A separate redundancy budget spends leftover money closing loops that remove single points of failure, computed live with a graph-bridge (Tarjan low-link) algorithm that highlights every road whose loss would cut a city off. A road-failure simulator then lets you sever one built road at random and watch, in real time, which cities the capital can no longer reach.