Weighted Shortest Path

**Tình huống.** A directed graph with n ≤ 100000 vertices, m ≤ 200000 edges, positive integer weights. For one source s, print the shortest distance to every vertex. **Thuật toán nào phù hợp nhất? Chương trình chỉ cần in ra chữ cái.** **A)** BFS from s **B)** Kruskal minimum spanning tree **C)** Dijkstra with a priority queue **D)** DSU with path compression