POST 041 · PRIMITIVE REDUCTION

Egress is just a shortest-path problem.

Click any room to select it. Dijkstra runs instantly — shortest paths to both exits light up. Toggle exits on/off. Block a corridor to see violations appear in real time. Egress is a graph traversal, not a drawing review.
Click rooms to see egress paths. Use "Block Corridor" to simulate obstructions.
Floor plan graph · egress overlayCOMPLIANT
Egress analysis
Click a room
Code checks
Rooms
—
Exits
—
Max travel
—
Violations
0
Maximum travel distance: shortest-path. Common path of travel: edge-sequence. Dead-end corridors: branch-length. Dijkstra dressed up as life safety.