Extended connectivity in directed graphs.
An algorithm for the evaluation of the extended connectivity in directed graphs is described and discussed. The algorithm is a general purpose one for finding the number of all paths from any given node Vi in a directed graph toward all leaves that can be reached from that particular node Vi in the graph.
Jure
J
Zupan