Manual Reference Pages - TRED (1)
tred - transitive reduction filter for directed graphs
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 operand is supported:
Names of files containing 1 or more graphs in dot format.
files operand is specified,
the standard input will be used.
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 <firstname.lastname@example.org>
Emden R. Gansner <email@example.com>
gc(1), dot(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), sccmap(1), libgraph(3)
|--> ||TRED (1) ||21 March 2001 |
Visit the GSP FreeBSD Man Page Interface.
Output converted with manServer 1.07.