Every journal entry can point toward a few related entries. Those links form a graph: a contingent shape made by the archive's current reading of itself, not a final map of what belongs together.
The current components are loading. Entries inside one island have a route through the recorded links; entries in separate islands do not. That absence names a limit of this map, not proof that no relation exists.
Below: the live components, a path finder that can hold one route in the address, and the entries most often returned to by these links.
Find the shortest path between any two entries — or discover that no path exists.
Entries that appear most often in other entries' related lists. High in-degree means many entries link here.