Introduction: A New Dawn in Graph Theory and Quantum-Inspired Computing In the annals of computer science, the problem of finding the shortest path from every node to every other node in a network is a canonical challenge. Classic textbooks teach Dijkstra’s and Floyd–Warshall algorithms as the go-to methods, each with its own trade-offs in time…