| 399 | Evaluate Division | Medium |
| 743 | Network Delay Time | Medium |
| 787 | Cheapest Flights Within K Stops | Medium |
| 882 | Reachable Nodes In Subdivided Graph | Hard |
| 1334 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium |
| 1368 | Minimum Cost to Make at Least One Valid Path in a Grid | Hard |
| 1514 | Path with Maximum Probability | Medium |
| 1786 | Number of Restricted Paths From First to Last Node | Medium |
| 1976 | Number of Ways to Arrive at Destination | Medium |
| 2045 | Second Minimum Time to Reach Destination | Hard |
| 2203 | Minimum Weighted Subgraph With the Required Paths | Hard |
| 2290 | Minimum Obstacle Removal to Reach Corner | Hard |
| 2577 | Minimum Time to Visit a Cell In a Grid | Hard |
| 2642 | Design Graph With Shortest Path Calculator | Hard |
| 2662 | Minimum Cost of a Path With Special Roads | Medium |
| 2699 | Modify Graph Edge Weights | Hard |