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

This process is used to identify, or enumerate, all of the simple paths in a directed graph. A simple path is a sequence of vertices, connected by edges, in which no vertex is repeated. The total number of paths is reported, and the paths are written to a file if a file name is provided.

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

The algorithm used by this process was described in: Carré, Bernard. Graphs and Networks. Clarendon Press, 1979. pg. 65-71.

Here is the set of keywords this process understands, along with a description of their possible corresponding values. See the command line documentation for more information about keyword-value pairs.


Required Keywords Possible Values
Process Path 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.