Back
dijkstra-traverse (clj)
(source)function
(dijkstra-traverse successors dist start)
(dijkstra-traverse successors dist start f)
Returns a lazy-seq of [current-node state] where state is a map in the
format {node [distance predecessor]}. When f is provided, returns
a lazy-seq of (f node state) for each node