A Systematic Method of Finding All Directed Circuits and Enumerating All DIrected Paths
- 1 June 1967
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 14 (2), 166-171
- https://doi.org/10.1109/tct.1967.1082699
Abstract
A method of obtaining all directed circuits is presented by using a connection matrix. Also obtained is the number of directed paths of each length from any one vertex to another. Finally it is extended to the nonoriented case.Keywords
This publication has 3 references indexed in Scilit:
- The number of paths and cycles in a digraphPsychometrika, 1966
- Enumeration of paths in digraphsPsychometrika, 1964
- Flow-Graph Solutions of Linear Algebraic EquationsIRE Transactions on Circuit Theory, 1959