Re: dependency check algorithms (was Re: "task" and beyond)
On Wed, 12 Feb 2003, Drew Scott Daniels wrote:
> algorithm that may be useful. I'm going to have to look it up, but the way
> that it worked was that it built up a tree into more optimum form every
> time it was searched. Back then I assumed that if the algorithm would have
Splay trees or something like that. It won't be of much help, I fear.
--
"One disk to rule them all, One disk to find them. One disk to bring
them all and in the darkness grind them. In the Land of Redmond
where the shadows lie." -- The Silicon Valley Tarot
Henrique Holschuh
Reply to: