CSES 1671 Shortest Routes I - Recognizing Dijkstra

The problem asks for single-source shortest paths. Weights are positive. N is large ($10^{5}$), so Floyd-Warshall would take $10^{15}$ operations and time out. BFS will not work because weights vary.

Bellman-Ford would work but runs in $O(NM)$, slower than Dijkstra's $O((N + M) \log N)$. Dijkstra is the clear choice. Non-negative weights, single-source, large graph. Use an adjacency list and a min-heap for the implementation.