Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Teturo Kamae (1967) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: