Computing partially ordered sets. Ways of defining binary relations:
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-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.
(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.
(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 builds & hosts documentation for Clojure/Script libraries
| Ctrl+k | Jump to recent docs |
| ← | Move to previous article |
| → | Move to next article |
| Ctrl+/ | Jump to the search field |