最短路径
Dijkstra (单源最短路算法)
https://www.geeksforgeeks.org/dijkstras-shortest-path-algorithm-greedy-algo-7/
Bellman-Ford, SPFA(Shortest Path Faster Algorithm) (单源最短路算法 for 负权边)
Floyd-Warshall (多源最短路算法)
Dijkstra (单源最短路算法)
https://www.geeksforgeeks.org/dijkstras-shortest-path-algorithm-greedy-algo-7/
Bellman-Ford, SPFA(Shortest Path Faster Algorithm) (单源最短路算法 for 负权边)
Floyd-Warshall (多源最短路算法)