THE FLOYD-WARSHALL ALGORITHM, THE AP AND THE TSP

Let s and t be two vertices of a connected weighted graph G represented by the matrix M. The shortest path problem finds a path between s and t whose total edge weight is minimum. Generally, edge-weight is taken to mean distance but the word i