| TRED(1) | General Commands Manual | TRED(1) |
tred - transitive reduction filter for directed graphs
tred [ -v? ] [ files ]
tred computes the transitive reduction of directed graphs, and prints the resulting graphs to standard output. This removes edges implied by transitivity. Nodes and subgraphs are not otherwise affected. The ``meaning'' and validity of the reduced graphs is application dependent. tred is particularly useful as a preprocessor to dot to reduce clutter in dense layouts.
Undirected graphs are silently ignored.
The following options are supported:
The following operand is supported:
Using bitmaps internally would substantially decrease running time.
If a graph has cycles, its transitive reduction is not uniquely defined. In this case tred emits a warning.
Stephen C. North <north@research.att.com>
Emden R. Gansner <erg@research.att.com>
gc(1), dot(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), sccmap(1), libgraph(3)
| 21 March 2001 |