Liking cljdoc? Tell your friends :D
Clojure only.
hiposfer.kamal.router.algorithms.dijkstra
shortest-pathclj
(shortest-path router start dst)(shortest-path router start dst comparator)computes the shortest path using Dijkstra's algorithm.
Returns the path taken to reach dst from start or nil if not found
Takes the same arguments as view
computes the shortest path using Dijkstra's algorithm. Returns the path taken to reach dst from start or nil if not found Takes the same arguments as view
viewclj
(view router start)(view router start-from comparator)returns a sequence of traversal-paths taken to reach each node i.e. the path viewwed from each node up until the start
Parameters:
- router: an implementation Dijkstra protocol to direct the 'movement' of the graph traversal
- start: is a set of either
- entities to start searching from
- [entity init] pair where init is value to start settling nodes
- comparator: a standard java.util.comparator implementation to compare the values returned by the router. Defaults to nil, which means that Valuable implementation MUST be comparable i.e. implement java.util.Comparable
returns a sequence of traversal-paths taken to reach each node i.e.
the path viewwed from each node up until the start
Parameters:
- router: an implementation Dijkstra protocol to direct the 'movement'
of the graph traversal
- start: is a set of either
- entities to start searching from
- [entity init] pair where init is value to start settling nodes
- comparator: a standard java.util.comparator implementation to compare the
values returned by the router. Defaults to nil, which means that Valuable
implementation MUST be comparable i.e. implement java.util.Comparablecljdoc is a website building & hosting documentation for Clojure/Script libraries
× close