Which algorithm to find the nearest node reachable from the other one by all the outoging paths.
        Posted  
        
            by ternyk
        on Stack Overflow
        
        See other posts from Stack Overflow
        
            or by ternyk
        
        
        
        Published on 2010-04-02T09:09:15Z
        Indexed on 
            2010/04/02
            9:13 UTC
        
        
        Read the original article
        Hit count: 328
        
Hello,
Which algorithm do you recommend to find out the nearest node which can be reached from the specific one by all the paths coming out the node. The graph is directed unweight.
I'm trying to analyze control flow diagram and when there is a 'IF' block I want to find the block which "closes" the 'IF'.
© Stack Overflow or respective owner