Dijkstra's Shortest Path

Finds shortest paths from a source in a non-negative weighted graph by always settling the closest frontier node.