Back
dijkstra-traverse (clj)
(source)function
(dijkstra-traverse g)
(dijkstra-traverse g start)
(dijkstra-traverse g 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