Layout Optimization for Greedy Navigation

Lee & Holme · PRE 86, 067103 (2012) — Simulated Annealing Demo by Claude Sonnet 4.6
current layout (optimizing…)
—
★ new best
initial random layout
—
Graph Model
—
SA Parameters
perturbation l0.30 p_high (heating)0.20 p_low (quenching)0 (frozen) T_H — heat steps60 MC T_L — quench limit25 MC T_HL — sessions6
SA Progress
READY session 0/6
MC step0
d (BFS shortest path)— d_g initial— d_g current— d_g best—
ν = d / d_g (best)— improvement—
SA Controls
slow fast
Test GSN — Before / After
Pick S and T on either canvas, then run GSN simultaneously on both layouts to compare navigability.
slow fast
top steps — bot steps — backtracks — top— backtracks — bot—
step reduction—
d_g history
█ heating █ quenching — best d_g ·· d (BFS)
Select a graph and press ▶ Run SA.