A note of an O(n~3/ log n) time algorithm for all pairs shortest paths

摘要

We improve the all pairs shortest path algorithm given by Takaoka to time complexity O(n~3/ log n). Our improvement is achieved by using a smaller table and therefore saves time for the algorithm.