[OT] Just curious: What's this algorithm's name?

[H. S. Teoh]

On Wed, Apr 04, 2012 at 01:33:21AM -0400, Nick Sabalausky wrote:
[...]
> Suppose you have a directed graph, which may have cycles, and you want
> to compute something for each node. But the final result for each node
> is dependent on the final results for each of the nodes it points to.
> (It may sound like this would just cause an endless "feedback loop" ie
> infinite recursion whenever there's a cycle, but there are
> applications of this where that isn't a problem. Ie, in cases where
> the computation stops recursing when it gets back to itself.)

Sounds like the word you want is "closure".


T

-- 
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