# acyclic(1) [osx man page]

ACYCLIC(1) General Commands Manual ACYCLIC(1)NAME

acyclic - make directed graph acyclicSYNOPSIS

acyclic [ -nv? ] [outfile ] [ file ]-oDESCRIPTION

acyclic is a filter that takes a directed graph as input and outputs a copy of the graph with sufficient edges reversed to make the graph acyclic. The reversed edge inherits all of the attributes of the original edge. The optional file argument specifies where the the input graph is stored; by default, the program reads from stdin.OPTIONS

The following options are supported:No output is produced, though the return value will indicate whether the graph is acyclic or not.-nPrint information about whether the file is acyclic, has a cycle or is undirected.-voutfile causes the output to be written to the specified file; by default, output is written to stdout. -? option causes the program to print usage information.-oRETURN CODES

acyclic returns 0 if the graph is acyclic; 1 if the graph has a cycle; 2 if the graph is undirected; and 255 if there are any errors.BUGS

If the graph is strict and there is a cycle of length 2, the attributes of the reversed edge are lost. Some edge attributes are non-symmetric, referring to either the head or tail node. At present, there is no mechanism or convention for cor- rectly switching or renaming these.AUTHORS

Stephen C. North <north@research.att.com> Emden R. Gansner <erg@research.att.com>SEE ALSO

gc(1), dot(1), gvpr(1), gvcolor(1), ccomps(1), sccmap(1), tred(1), libgraph(3) 21 March 2001 ACYCLIC(1)

## Check Out this Related Man Page

SCCMAP(1) General Commands Manual SCCMAP(1)NAME

sccmap - extract strongly connected components of directed graphsSYNOPSIS

sccmap [] [-dsv] [ files ]-ooutfileDESCRIPTION

sccmap decomposes digraphs into strongly connected components and an auxiliary map of the relationship between components. In this map, each component is collapsed into a node. The resulting graphs are printed to standard out. The number of nodes, edges and strongly con- nected components are printed to standard error. sccmap is a way of partitioning large graphs into more manageable pieces.OPTIONS

The following options are supported:Preserve degenerate components of only one node.-dDo not print the resulting graphs. Only the statistics are important.-sJust print the resulting graphs. No statistics are printed.-SPrints output to the file output. If not given, sccmap uses stdout.-ooutputGenerate additional statistics. In particular, sccmap prints the number of nodes, edges, connected components, and strongly con- nected components, followed by the fraction of nodes in a non-trivial strongly connected components, the maximum degree of the graph, and fraction of non-tree edges in the graph.-vOPERANDS

The following operand is supported: files Names of files containing 1 or more graphs in dot format. If no files operand is specified, the standard input will be used.DIAGNOSTICS

sccmap emits a warning if it encounters an undirected graph, and ignores it.AUTHORS

Stephen C. North <north@research.att.com> Emden R. Gansner <erg@research.att.com>SEE ALSO

gc(1), dot(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), tred(1), libgraph(3) 21 March 2001 SCCMAP(1)