boot.kahnsort — boot/pod 2.8.0

choose clj

(choose s)

Returns the pair [element, s'] where s' is set s with element removed.

no-incoming clj

(no-incoming g)

Returns the set of nodes in graph g for which there are no incoming edges, where g is a map of nodes to sets of nodes.

normalize clj

(normalize g)

Returns g with empty outgoing edges added for nodes with incoming edges only. Example: {:a #{:b}} => {:a #{:b}, :b #{}}

topo-sort clj

(topo-sort g)

(topo-sort g l s)

Proposes a topological sort for directed graph g using Kahn's algorithm, where g is a map of nodes to sets of nodes. If g is cyclic, returns nil.