bron-kerbosch — bron-kerbosch 1.0.0-SNAPSHOT

bk clj

(bk r p x neighbours)

Performs the Bron-Kerbosch iterative algorithm.

disjoint-sets clj

(disjoint-sets sets s)

Given a seq of sets and a set returns all those sets with are disjoint from that set

inverse-map clj

(inverse-map m)

map-from-fn clj

(map-from-fn f domain)

Generates a map from a function and its domain.

map-on-values clj

(map-on-values f m)

Applies f to the values in the map m.

maximum-cliques clj

(maximum-cliques nodes neighbours)

Yields all maximal individual cliques of the nodes given the neighbours function. nodes is a seq and neighbours is a function that maps from a node to a seq of its neighbours.

maximum-cliques-of-maximum-cliques clj

(maximum-cliques-of-maximum-cliques nodes neighbours)

Yields the maximum cliques of the maximum cliques.

maximum-disjoint-sets clj

(maximum-disjoint-sets sets)

Extracts maximum disjoint sets. [#{1 2} #{2 3} #{3 4}] => ((#{1 2} #{3 4}) (#{2 3}))

vector-intersection clj

(vector-intersection vec-1 vec-2)

Finds the intersection between two vectors. Assumes no duplicate elements in either vector.