Java 实现最短路:Dijkstra、Floyd、Bellman-Ford、SPFA
1.Dijkstraclass Solution { public int networkDelayTime(int[][] times, int N, int K) { // 构建邻接表,用于存放各个点到各个点的距离 int[][] graph = new int[N + 1][N + 1]; for (int i = 1; i <= N; i++) { for (int j = 1; j <= N; j++
原创
2020-07-26 15:59:09 ·
231 阅读 ·
0 评论