I have a partially ordered set, say A = [x1, x2, ...], meaning that for each xi and xj in the set, (exactly) one of four possibilities is true: xi < xj, xi == xj, xi > xj, or xi and xj are in...

I am looking for a Java implementation of a data structure which holds a collection of elements for which a partial ordering is defined, and which allows one to iterate over those elements in some ...

This is built upon a previous question Solve a simple packing combination with dependencies, although there is no need to check out that question to understand this one. This question asks about t...

While reading Bartosz' excellent Category theory for Programmers, I got stuck in the second exercise, which deals with products in posets. Given a poset, b e ↗ ⤭ ↘ a → c f → h ↘ ⤭ ↗ d g how ...

There are a huge number of sorting algorithms out there, but most of them only work on totally-ordered sets because they assume that any two elements are comparable. However, are there any good alg...

I have a procedural EDSL which uses blocks of statements. These statements are added to the blocks in no particular order although there may be dependencies between statements. During compilation...

I've some lists with variable number of elements. Each list is sorted, but the sorting algorithm is not known. I would like to merge the lists into one big list which contains all lists in same ord...

How to efficiently enumerate all partial orders on a finite set? I want to check whether a partial order with specified properties exists. To check this I am going with brute force to enumerate al...