Liking cljdoc? Tell your friends :D
Clojure only.

kigen.poset

Computing partially ordered sets. Ways of defining binary relations:

  1. elements and a relation function (implicit)
  2. a map: element x -> set of related elements (explicit)
Computing partially ordered sets. Ways of defining binary relations:
1. elements and a relation function (implicit)
2. a map: element x -> set of related elements (explicit)
raw docstring

chainsclj

source

cover-relclj

(cover-rel elts rel?)

The covering relation of a partial order as a graph (map: element -> set of covers), given by the elements and a predicate.

The covering relation of a partial order as a graph
(map: element -> set of covers), given by the elements and a predicate.
sourceraw docstring

inverseclj

(inverse rel?)

Given an implicit relation by function rel? this returns the function for the inverse relation.

Given an implicit relation by function rel? this returns the function
for the inverse relation.
sourceraw docstring

max-distancesclj

source

relclj

(rel elts rel?)

Makes an implicit relation explicit. Works for finite set of elements.

Makes an implicit relation explicit. Works for finite set of elements.
sourceraw docstring

cljdoc is a website building & hosting documentation for Clojure/Script libraries

Keyboard shortcutsReport a problemcljdoc on GitHub
× close