In Overview of Single Source Shortest Path, it mentions “Dijkstra's algorithm” can only be used to solve the “single source shortest path” problem in a weighted directed graph with non-negative weights. I believe Dijkstra's algorithm can also be used in undirected graph.