> User's Guide > Graph Theory |
Unique Cycle
Identification
This process is used to identify, or enumerate, all of the unique cycles in a collection of simple cycles. A simple cycle is considered to be a sequence of vertices, connected by edges, in which no vertex is repeated except for the start and end points. Given this definition, a single cycle may be represented in various ways, depending on the choice of the starting node. This process interprets these potentially differing representations, and reports only the truly unique cycles. The total number of unique cycles are reported, and the cycles are written to a file if a file name is provided. Here is the set of keywords this process understands, along with a description of their possible corresponding values. |
Required Keywords | Possible Values |
Process | Unique Cycle Identification |
Input File | The name of a text file containing a collection of simple cycles. See Path Files for further information. |
Optional Keywords | Possible Values |
Input File Format | Either Text or Gzipped Text, depending on the format of the input file. See File Formats for additional information. |
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. |
ExamplesClick here for an example. |