Enumerating Circuits and Loops in Graphs with Self-Arcs and Multiple-Arcs.
Ken A. Hawick, Heath A. James · FCS · 2008
The problems of detecting and enumerating circuits in graphs and networks are still of fundamental importance. We extend the circuit enumeration algorithm of Johnson for graphs with directed-arcs, multiple-arcs and self-arcs and present a memory efficient and high-performance implementation in the D programming language. We also discuss other circuit applications including how the code could be adapted as a cycle detection algorithm.