An Algorithm for Finding the Reachability Matrix of a Directed Linear Graph
- 1 February 1969
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 16 (1) , 130-132
- https://doi.org/10.1109/TCT.1969.1082889
Abstract
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.Keywords
This publication has 3 references indexed in Scilit:
- A global parser for context-free phrase structure grammarsCommunications of the ACM, 1968
- The Cascade Algorithm for Finding all Shortest Distances in a Directed GraphManagement Science, 1967
- Analysis of Graphs by Connectivity ConsiderationsJournal of the ACM, 1966