> User's Guide > Graph Theory
Cycle Identification in a Directed Graph

This process is used to identify, or enumerate, all of the unique simple cycles in a directed graph. The total number of cycles is reported, and the cycles are written to a file if a file name is provided.

See Wikipedia's description of simple cycles for additional information.

Here is the set of keywords this process understands, along with a description of their possible corresponding values.


Required Keywords Possible Values
Process Cycle Identification
Edge File The name of a text file containing the edges of a directed graph. See Edge Files for further information.
Optional Keywords Possible Values
Output File Name The name of the file to be created by this process. See Path Files for further information.
Output File Format Either Text or Gzipped Text. See File Formats for additional information.

Examples

Click here for an example.