dijkstra-path (clj)

(dijkstra-path successors dist start end)

Finds the shortest path from start to end, where successors and dist are functions called as (successors node) and (dist node1 node2)

Examples