Dijkstra's algorithm: Difference between revisions

=={{header|Phix}}==

I didn't really copy any other code/pseudocode, just followed the basic concept of (update costs) (select lowest cost unvisited) until target reached.<br>

Selects the shortest path from A to B only. As for time complexity, it looks plenty efficient enough to me, though it clearly is O(V^2).<br>

Written after the task was changed to be a directed graph, and shows the correct solution for that.

end for

if visited[start] then return -1 end if

if start=finish then return cost[finish] end if

end while