WormHole Algorithm Outperforms BiBFS in Query Efficiency and Accuracy

WormHole is a graph algorithm that outperforms traditional traversal and indexing-based methods like BiBFS, PLL, and MLL. Through extensive benchmarking on large datasets from SNAP and KONECT, WormHole demonstrates superior efficiency in query cost, inquiry time, and setup performance. It achieves 99% path accuracy with minimal overhead, offering faster and more scalable solutions for large graph queries—particularly when compared to indexing algorithms that time out or require massive resources.