🚀 go-pugleaf

>	From: steve@comp.vuw.ac.nz (Steve Cassidy)
>	Newsgroups: comp.lang.prolog
>	Subject: Re: Partial Orders 
>	Date: 1 Mar 91 00:57:26 GMT
>	References: <1991Feb27.032403.23920@comp.vuw.ac.nz>
>	Organization: Dept. of Comp. Sci., Victoria Uni. of Wellington, New Zealand.
>	Nntp-Posting-Host: climie.comp.vuw.ac.nz
>
>	What I'm after representing is a directed acyclic graph (dag).
>	After a little more thought (and a good nights sleep) I came
>	up with the idea of using adjacency lists, where each node has
>	associated with it a list of nodes that follow it in the
>	ordering.
>
>	[...]
>
>	Note that this results in us keeping the full transitive
>	closure of the dag at all times,

I'm not sure that I understand exactly what you're after, but the above
comments strongly suggest to me that perhaps you may find some relevant
material in the following article.

Regards,

-hak

@ARTICLE{latticeops
	, AUTHOR = {Hassan A\"{\i}t-Kaci and Robert Boyer and Patrick
		Lincoln and Roger Nasr} 
	, TITLE = {Efficient Implementation of Lattice Operations}
	, JOURNAL = {ACM Transactions on Programming Languages and Systems}
	, YEAR = {1989}
	, VOLUME = {11}
	, NUMBER = {1}
	, PAGES = {115--146}
	, MONTH = {January}
	}