Liking cljdoc? Tell your friends :D
kigen.poset
Computing partially ordered sets. Ways of defining binary relations:
- elements and a relation function (implicit)
- 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)
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.
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.
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.
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close