On locating the simple cycles in a digraph
An algorithm is stated for finding the simple cycles in a digraph which is believed to be superior to previous algorithms. The algorithm is stated in a way which lends itself to use on a digital computer. Suitable modifications are presented which allow the algorithm to be applied to coalesced grap...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
Naval Postgraduate School
2012
|
| Online Access: | http://hdl.handle.net/10945/15117 |