Dev maps hometown rush-hour pain with graph centrality — no traffic data needed
TivadarDanka · x · 2026-09-04
TivadarDanka built a graph from the streets and intersections of his hometown and computed length-weighted centrality for every edge — red edges are highly central, blues less so.
The neat part: without any traffic data, the map perfectly reflects which streets are most painful to navigate during rush hour. "I love graph theory," he writes.
More from Fun
- AI-generated fridge magnets flood Istanbul's Sultanahmet, prompting doomer joke — mertdumenci · 2026-09-04
- One-Line Reminder on AI Twitter Discourse: Half the People Here Are Investors in the Other Half — StewartalsopIII · 2026-09-04
- Subagents when the API key hits the rate limit — realsohamparekh · 2026-09-04
- AI agent asks to "play the cello" in a physics simulation, experimenting with a bow — repligate · 2026-09-04
- Marvin Minsky's 2011 MIT Society of Mind lecture: the self is an illusion of stupid parts — anselm · 2026-09-04
- Researcher flips: after OpenAI's latest release, 'the competition is over' — cloneofsimo · 2026-09-04