One of the most significant problems in graph theory is finding the shortest path between nodes, which has led to extensive research on efficient algorithms for pathfinding and related queries.