Re: Topological Sort Help

["Jeffrey R. Carter" <jrcarter@acm.org>]

isaac2004 wrote:
> an exit when makes no sense in this situation because there is no
> finite stopping condition, if you look at the algorithm provided, i
> see it harder top implement an exit when loop
> 
> WHILE IsEmpty(G) /= False DO

This kind of construct generally indicates the coder doesn't understand 
the concept of Booleans.

There's always an "exit when" equivalent to a while loop. Your loop is 
equivalent to

while Isempty (G) loop

which is equivalent to

loop
    exit when not Isempty (G);

Note that I'm not dealing with your algorithm here; I'm merely 
suggesting that if you're having trouble with the condition for 
continuing the loop, you might find it easier to think in terms of the 
condition for exiting the loop.

-- 
Jeff Carter
"What I wouldn't give for a large sock with horse manure in it."
Annie Hall
42