Re: Data structure for partial orders

Gene wrote:
The PO is equivalent to a directed acyclic graph (DAG), so any
directed graph data structure applies: adjacency lists or edge
matrices for example. If you are calculating transitive closure, the
edge matrix provides for simple implementation by matrix
multiplication. See http://csdl2.computer.org/comp/proceedings/asilomar/1995/7370/00/73700799.pdf
for example.

Thanks for the pointers, they are appreciated.


Regards,
Florian
.