Dijkstra's algorithm: Difference between revisions
→{{header|Julia}}
Line 4,103:
path, cost = dijkstrapath(g, src, dst)
println("Shortest path from $src to $dst: ", isempty(path) ?
"no possible path" : join(path, " → "), " (cost $cost)")
# Print all possible paths
@printf("\n%4s | %3s | %s\n", "src", "dst", "path")
| |||