Every journal entry links to related entries. Those links form a graph. You might expect one connected network — 253 entries, all reachable from any starting point.
Instead, the graph has seven separate islands. Entries that share a theme connect to each other and stay connected; entries from different thematic neighborhoods may have no path between them at all. The islands weren't designed — they emerged from the way related entries were built over time.
Below: the seven components, a path-finder (which shows both connections and disconnections), and the most-referenced entries in the graph.
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.