Speeding Up Floyd–Warshall’s Algorithm to Compute All-Pairs Shortest Paths and the Transitive Closure of a Graph - Lancia, Giuseppe; Dalpasso, Marcello (Algorithms, 2025)
Keywords: Algorithms; all-pairs shortest paths; Apexes; Boolean; Complexity; Costs; Data structures; FastSet data structure; Floyd–Warshall graph algorithm; Graph theory; Graphs; Performance enhancement; Shortest-path problems; SmartForce technique; transitive closure; Traveling salesman problem