| 1 | Shortest Path in UG with unit weights |   | | |
| 2 | Shortest Path in DAG |   | | |
| 3 | Djisktra's Algorithm |   | | |
| 4 | Why priority Queue is used in Djisktra's Algorithm |   | | |
| 5 | Shortest path in a binary maze |    | | |
| 6 | Path with minimum effort |    | | |
| 7 | Cheapest flights within k stops |    | | |
| 8 | Network Delay time |    | | |
| 9 | Number of ways to arrive at destination |    | | |
| 10 | Minimum steps to reach end from start by performing multiplication and mod operations with array elements |   | | |
| 11 | Bellman Ford Algorithm |   | | |
| 12 | Floyd Warshal Algorithm |   | | |
| 13 | Find the city with the smallest number of neighbors in a threshold distance |    | | |