话题分类 > 最短路
| # | 题目 | 标签 | 难度 |
|---|---|---|---|
| 2093 | Minimum Cost to Reach City With Discounts 🔒 | [图] [最短路] | Medium |
| 2045 | 到达目的地的第二短时间 | [广度优先搜索] [图] [最短路] | Hard |
| 1976 | 到达目的地的方案数 | [图] [拓扑排序] [动态规划] [最短路] | Medium |
| 1786 | 从第一个节点出发到最后一个节点的受限路径数 | [图] [拓扑排序] [动态规划] [最短路] [堆（优先队列）] | Medium |
| 1514 | 概率最大的路径 | [图] [最短路] [堆（优先队列）] | Medium |
| 1368 | 使网格图至少有一条有效路径的最小代价 | [广度优先搜索] [图] [数组] [矩阵] [最短路] [堆（优先队列）] | Hard |
| 1334 | 阈值距离内邻居最少的城市 | [图] [动态规划] [最短路] | Medium |
| 882 | 细分图中的可到达结点 | [图] [最短路] [堆（优先队列）] | Hard |
| 787 | K 站中转内最便宜的航班 | [深度优先搜索] [广度优先搜索] [图] [动态规划] [最短路] [堆（优先队列）] | Medium |
| 743 | 网络延迟时间 | [深度优先搜索] [广度优先搜索] [图] [最短路] [堆（优先队列）] | Medium |
| 505 | 迷宫 II 🔒 | [深度优先搜索] [广度优先搜索] [图] [最短路] [堆（优先队列）] | Medium |
| 499 | 迷宫 III 🔒 | [深度优先搜索] [广度优先搜索] [图] [最短路] [堆（优先队列）] | Hard |
| 399 | 除法求值 | [深度优先搜索] [广度优先搜索] [并查集] [图] [数组] [最短路] | Medium |