包括DFS，BFS，树与图的深度优先遍历，树与图的广度优先遍历，拓扑排序，Dijkstra，bellman-ford，spfa，Floyd，Prim，Kruskal，染色法判定二分图，匈牙利算法等内容。
Login to join training plan
Section 6. Dijkstra
Open
| Problem | Tried | AC | Difficulty |
|---|---|---|---|
| AcWing849 Dijkstra求最短路 I | 16 | 7 | 8 |
| AcWing850 Dijkstra求最短路 II | 6 | 4 | 10 |
Section 8. spfa
Open
| Problem | Tried | AC | Difficulty |
|---|---|---|---|
| AcWing851 spfa求最短路 | 2 | 2 | 10 |
| AcWing852 spfa判断负环 | 1 | 1 | 10 |
Section 11. Kruskal
Open
| Problem | Tried | AC | Difficulty |
|---|---|---|---|
| AcWing859 Kruskal算法求最小生成树 | 2 | 2 | 10 |
- Enrollees
- 33
- Created By
-
Csvoner