Dijkstra's Algorithm · Shortest Path
shortest path · weighted graph · greedy
nodes 8
edges 12
visited 0
step —
unvisited node
current frontier
visited node
shortest path