Shortest path mapping

Description

Computes the minimum number of steps from entry points to each key destination and compares it with the paths users actually take, revealing structural distance and detours.

Shortest path mapping applies Dijkstra's or breadth-first search algorithms to a navigation graph to compute the minimal step count between any two nodes, particularly from common entry points to priority tasks. Weighted versions use estimated interaction cost per edge (for example KLM time) rather than raw clicks. Comparing structural shortest paths with observed paths from logs gives a 'lostness' or path efficiency ratio: Smith's lostness measure combines total nodes visited, unique nodes visited and the minimum required. The method separates structural problems (destinations genuinely far away) from wayfinding problems (short paths exist but users do not find them). It is rigorous when the graph is complete and the cost model is explicit.

Attributes

Loss type
Latent
Effort
Days

Steps

  1. Build the navigation graph and define entry points and priority destinations from task analysis.
  2. Compute shortest path lengths (or weighted costs) from each entry point to each destination.
  3. Extract observed paths from logs or tests for the same tasks.
  4. Compute path efficiency (optimal/observed) and Smith's lostness L = sqrt((N/S - 1)^2 + (R/N - 1)^2); treat L above about 0.4 as lost.
  5. Classify each problem as structural (long optimal path) or wayfinding (short optimal path, inefficient observed path).
  6. Fix structural problems with new links or shortcuts and wayfinding problems with labels, scent or signposting; re-measure.

Sources

  • Rosenfeld, L., Morville, P. & Arango, J., Information Architecture: For the Web and Beyond (O'Reilly, 4th ed., 2015)
  • Martin, L. M., Everyday Information Architecture (2019)
  • Covert, A., How to Make Sense of Any Mess (2014)
  • Information Architecture (O'Reilly)
  • Everyday Information Architecture (Martin)
  • How to Make Sense of Any Mess (Covert)
  • The Inquiry Series, Ch 7 — Graph Theory & the Architecture of Information

Also known as

  • Click-distance analysis
  • Path length analysis
  • Minimum path audit

Categories

  • Content
  • Information Architecture & Content