Route spread: Bastrop to La Grange (roads only, placeholder costs)

15 kept routes from 28 Dijkstra solves. Graph: 12,971 nodes, 15,623 edges (OSM drive network, bbox pad 12 mi). Costs are placeholders by highway class; bridges x3; toll edges excluded (0). Overlap = shared footage / route footage vs route R01.
Rank by: cheapest shortest   blend = 0.00
score = (1 - blend) x (cost / min cost) + blend x (miles / min miles). Lower is better. Click a header to sort by that column; click a row or a line to highlight.