Multiple choice:Which of the following algorithms can find the shortest path of a graph.

Which of the following algorithms can find the shortest path of a graph@[ B](2)
A. Kruskal algorithm
B. Dijkstra algorithm
C. Prim algorithm
D. Huffman algorithm




A. Kruskal algorithm
B. Dijkstra algorithm
C. Prim algorithm
D. Huffman algorithm


answer：B