hiposfer.kamal.network.algorithms.core — hiposfer/kamal 0.11.1

defaults clj

dijkstra clj

(dijkstra graph start-from opts)

returns a sequence of traversal-paths taken to reach each node

Parameters:

• graph: an collection of nodes over which the traversal will happen. Expected to be a Datascript db but need not be
• start-from is a set of
  • entities to start searching from
  • [entity init] pair where init is value to start settling nodes
• opts: is a map of options with the following keys :successors -> a function of graph, id -> [ id ]. Used to get the id of the next nodes value-by successors :value-by -> a function of graph, node , trail -> cost :comparator -> a comparator function as defined by Clojure and Java. defaults to clojure/compare

NOTE: a Trail is a sequence of [id Valuable]. In other words it is the trail taken to get from the first settled node to the current one

looners clj

(looners network)

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

nodes clj

(nodes network)

returns all the node entities in the network

shortest-path clj

(shortest-path dst graph-traversal)

returns the path taken to reach dst using the provided graph traversal