Liking cljdoc? Tell your friends :D
Clojure only.
hiposfer.kamal.network.algorithms.core
dijkstraclj
(dijkstra router start-from)(dijkstra router start-from comparator)returns a sequence of traversal-paths taken to reach each node
Parameters:
- router: an implementation of the Router protocol to direct the 'movement' of the graph traversal
- start-from: 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
Parameters:
- router: an implementation of the Router protocol to direct the 'movement'
of the graph traversal
- start-from: 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.Comparableloonersclj
(looners network router)returns a sequence of ids that can be removed from the graph because they are not part of the strongest connected component
NOTE: only relevant for pedestrian routing
returns a sequence of ids that can be removed from the graph because they are not part of the strongest connected component NOTE: only relevant for pedestrian routing
nodesclj
(nodes network)returns all the node entities in the network
returns all the node entities in the network
shortest-pathclj
(shortest-path dst graph-traversal)returns the path taken to reach dst using the provided graph traversal
returns the path taken to reach dst using the provided graph traversal
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close