Cellular Frequency Reuse — Hex Grid Graph Coloring (2D)

This 2D companion recasts the same DSATUR graph-coloring frequency-assignment problem on the lattice cellular networks are actually diagrammed with: a hexagonal grid, where every cell has up to six equidistant neighbours. As simulated call traffic switches cells active and idle, an interference graph is built from hex-distance adjacency and a live DSATUR solver assigns the lowest available frequency channel to each active cell so that no two interfering active cells ever share one. Each cell keeps a sticky legacy channel between activations — a small, deliberately collision-prone pool standing in for a real operator's static frequency plan — so reactivating cells can genuinely collide with their neighbours, and the pulsing red edges you see are real conflicts waiting for the next incremental repair pass, which recolours only the affected cells instead of replanning the whole lattice. Tune the lattice size and interference distance, click any hex to inspect it, and watch the channel count and conflict rate respond to traffic load in real time.