C++Floyd Warshall解Leetcode 1334 Find the City With the Smallest Number ...

C++Floyd Warshall解Leetcode 1334  Find the City With the Smallest Number of Neighbors at a Threshold

由於每對 (i, j) 都有許多最短路徑需要計算，採用 Floyd-Warshall 演算法比較划算。

---

Since there are many shortest paths for every pair (i, j) to compute. Choose Floyd-Warshall's algorithm to implement.

[codes on Leetcode]https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/solutions/5536548/floyd-warshalls-algorithm-vs-dijkstra7ms-beats-100/

[Tree & Graph Playlist]https://www.youtube.com/watch?v=9Lx7yr-tmfI&list=PLYRlUBnWnd5Kt0-3un43cwY6yT_il8NWe

[Leetcode程式 playlist]https://www.youtube.com/watch?v=527BNZYm6aE&list=PLYRlUBnWnd5IdDHk2BjqXwesydU17z_xk&index=3