Graph Database Shortest-Path Query: Bidirectional BFS (2D)

Graph databases answer "what's the shortest path between these two records" by walking index-free adjacency pointers directly, node to node, rather than joining tables. This 2D simulator lays out a random connected property graph with its own planar spring-electrical physics and runs a real breadth-first search across it: a single expanding wavefront from the source, or two wavefronts — one from the source, one from the target — expanding toward each other until they meet. A live growth-curve chart plots the actual measured nodes-visited-per-layer for the running strategy against the untouched other strategy on the identical graph, so the exponential cost gap that makes bidirectional search the standard approach in engines like Neo4j and Amazon Neptune is drawn directly from real traversal data rather than asserted.