computing…
City
— select a city
Interaction
Click a node → source.
Click another → target.
Hover to inspect intersections.
Hover to inspect intersections.
Algorithm
slow
fast
Results
d_g — GSN steps—
d — shortest path—
d_r — random DFS—
ν = d / d_g—
backtracks—
What is ν?
ν = d / d_g measures navigability: ratio of shortest-path length to greedy path length. ν→1 means the city layout allows near-optimal greedy routing. Removing some edges can increase ν (Braess's paradox).
PATH LOG
Select a city above, then click two nodes.