Bill Studenmund wrote:

>On 31 Jul 2002, Johan Danielsson wrote:
>
>  
>
>>Lennart Augustsson <lennart@augustsson.net> writes:
>>
>>    
>>
>>>I'm not really sure if it's correct.  It works for me.
>>>      
>>>
>>I suppose it might break if you have multiple bridges.
>>
>>    
>>
>>>I guess a safer way would be to gradually increase the subordinate
>>>value down a path as you find more and more bridges below.
>>>      
>>>
>>You must walk the whole tree, and then fix the subs on your way
>>up. Isn't there code that does this already?
>>    
>>
>
>Right. All you need is a depth-first search, and you're covered.
>
That's what I'm doing.  But you have to program the bridges both on
the way down (to make sure you can reach the subordinate busses)
and up (to make sure you get the right value).

    -- Lennart