Chains in partially ordered sets given by their Hasse diagrams. A Hasse diagram is a hash-map from elements to the set of related elements.
Chains in partially ordered sets given by their Hasse diagrams. A Hasse diagram is a hash-map from elements to the set of related elements.
(chains a b hd)
All chains between elements a and b in the given Hasse diagram.
All chains between elements a and b in the given Hasse diagram.
(discovery-times e hd)
For a Hasse-diagram/cover relation hd this perform a search and records the discovery times. Returns a map: element -> vector of discovery times f: min or max
For a Hasse-diagram/cover relation hd this perform a search and records the discovery times. Returns a map: element -> vector of discovery times f: min or max
(max-distances e hd)
Returns a map of elements to their maximal distance (length of longest chain) from element e.
Returns a map of elements to their maximal distance (length of longest chain) from element e.
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close