alandipert.kahn — kanaka/instacheck 0.6.1

cyclic clj

(cyclic g)

direct-recursive clj

(direct-recursive g)

kahn-sort clj

(kahn-sort g)

(kahn-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.

kahn-sort-throws clj

(kahn-sort-throws g)

(kahn-sort-throws 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, throws an exception with the remaining (cyclic) graph.

mutually-recursive clj

(mutually-recursive g)

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.

no-outgoing clj

(no-outgoing g)

Returns the set of nodes in graph g for which there are no outgoing 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 #{}}

remove-direct-recursive clj

(remove-direct-recursive g)

take-1 clj

(take-1 s)

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

without clj

(without s x)

Returns set s with x removed.