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

2012-04-04 Thread Nick Sabalausky
"H. S. Teoh" wrote in message news:mailman.1358.1333576694.4860.digitalmar...@puremagic.com... > On Wed, Apr 04, 2012 at 05:03:39PM -0400, Nick Sabalausky wrote: >> "H. S. Teoh" wrote in message >> news:mailman.1351.1333549896.4860.digitalmar...@puremagic.com... > [...] >> > Sounds like the word

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

2012-04-04 Thread bls
On 04/03/2012 10:33 PM, 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 cau

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

2012-04-04 Thread H. S. Teoh
On Wed, Apr 04, 2012 at 05:03:39PM -0400, Nick Sabalausky wrote: > "H. S. Teoh" wrote in message > news:mailman.1351.1333549896.4860.digitalmar...@puremagic.com... [...] > > Sounds like the word you want is "closure". > > > > Now that you mention it, that *does* seem to make sense: (Warning: > L

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

2012-04-04 Thread Nick Sabalausky
"H. S. Teoh" wrote in message news:mailman.1351.1333549896.4860.digitalmar...@puremagic.com... > 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

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

2012-04-04 Thread 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

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

2012-04-04 Thread Manfred Nowak
Nick Sabalausky wrote: > in cases where the computation stops recursing when it gets back > to itself May be you mean APSP = all pairs shortest path In your case: - get rid of all uneven numbered edges - reverse the remaining edges - compute APSP, where addition is replaced by concatnation - de

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

2012-04-03 Thread Nick Sabalausky
Nothing important, just something I'm curious about: At least a couple times recently I've come across a certain pattern for dealing with directed graphs (ones that may have cycles). It seems general enough that I'm surprised I don't seem to recognize it (but then again, it has been years since