目录
目录 .............................................. 1
Graph 图论 ........................................ 3
| DAG的深度优先搜索标记 ............................................. 3 | 无向图找桥 ..................................................................... 3 | 无向图连通度(割) ........................................................ 3 | 大团问题 DP + DFS ................................................. 3 | 欧拉路径O(E) ............................................................... 3 | DIJKSTRA数组实现O(N^2) ..................................... 3 | DIJKSTRA O(E * LOG E) ............................................. 4 | BELLMANFORD单源短路O(VE) ................................. 4 | SPFA(SHORTEST PATH FASTER ALGORITHM) .............. 4 | 第K短路(DIJKSTRA) ................................................. 5 | 第K短路(A*) ............................................................ 5
2021-05-30 10:17:21
652KB
ACM
1