1ACYCLIC(1)                  General Commands Manual                 ACYCLIC(1)
2
3
4

NAME

6       acyclic - make directed graph acyclic
7

SYNOPSIS

9       acyclic [ -nv?  ] [ -o outfile ] [ file ]
10

DESCRIPTION

12       acyclic  is a filter that takes a directed graph as input and outputs a
13       copy of the graph with sufficient edges  reversed  to  make  the  graph
14       acyclic. The reversed edge inherits all of the attributes of the origi‐
15       nal edge. The optional file argument specifies where the input graph is
16       stored; by default, the program reads from stdin.
17

OPTIONS

19       The following options are supported:
20
21       -n     No  output  is  produced,  though the return value will indicate
22              whether the graph is acyclic or not.
23
24       -v     Print information about whether the file is acyclic, has a cycle
25              or is undirected.
26
27       -o outfile
28              causes  the  output  to  be  written  to  the specified file; by
29              default, output is written to stdout.
30
31       -?     option causes the program to print usage information.
32

RETURN CODES

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

BUGS

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

AUTHORS

46       Stephen C. North <north@research.att.com>
47       Emden R. Gansner <erg@research.att.com>
48

SEE ALSO

50       gc(1), dot(1), gvpr(1), gvcolor(1), ccomps(1), sccmap(1), tred(1), lib‐
51       graph(3)
52
53
54
55                                 21 March 2001                      ACYCLIC(1)