Liking cljdoc? Tell your friends :D
All platforms.
milestones.graph-utilities
gen-all-precedence-edgesclj/s
(gen-all-precedence-edges tasks)Given tasks, computes all the edges present in this graph
Given tasks, computes all the edges present in this graph
gen-precendence-edgeclj/s
(gen-precendence-edge task-id predecessors)a utility function, given 1 + [ 2 3] returns [1 2], [1 3]
a utility function, given 1 + [ 2 3] returns [1 2], [1 3]
graph-cyclesclj/s
(graph-cycles edges)Uses [Tarjan]((https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm)'s strongly connectect components algorithm to find if there are any cycles in a graph
Uses [Tarjan]((https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm)'s strongly connectect components algorithm to find if there are any cycles in a graph
predecessors-of-task-exist?clj/s
(predecessors-of-task-exist? tasks the-task)return true if all predecessors of this task exist or if this task has no preds
return true if all predecessors of this task exist or if this task has no preds
successorsclj/s
(successors vertex edges)task-has-predecessors?clj/s
(task-has-predecessors? the-task)return true if this task has preds
return true if this task has preds
verticesclj/s
(vertices edges)cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close