An Algorithm for Finding the Reachability Matrix of a Directed Linear Graph
S.H. Unger · IEEE Transactions on Circuit Theory · 1969
A new algorithm is presented for finding all of the descendants of each node of an arbitrary directed linear graph. The validity of the algorithm is established and it is compared with a previously known algorithm and found to be faster for at least one class of implementations.