Home / cs-notes / Algorithm / Problems / Shortest Path / Floyd-Warshall / Thought

• Distance Matrix (n^n)
• Intermediate Point Matrix

---

• if (dis(A,C) + dis(C,B) < dis(A,B))
  • update Distance Matrix
  • Intermediate Point Matrix.

---