wolffd@0: .TH TRED 1 "21 March 2001"
wolffd@0: .SH NAME
wolffd@0: tred \- transitive reduction filter for directed graphs
wolffd@0: .SH SYNOPSIS
wolffd@0: .B tred
wolffd@0: [ 
wolffd@0: .I files 
wolffd@0: ]
wolffd@0: .SH DESCRIPTION
wolffd@0: .B tred
wolffd@0: computes the transitive reduction of directed graphs,
wolffd@0: and prints the resulting graphs to standard output.
wolffd@0: This removes edges implied by transitivity.
wolffd@0: Nodes and subgraphs are not otherwise affected.
wolffd@0: The ``meaning'' and validity of the reduced graphs
wolffd@0: is application dependent.
wolffd@0: .B tred 
wolffd@0: is particularly useful as a preprocessor to 
wolffd@0: .I dot
wolffd@0: to reduce clutter in dense layouts.
wolffd@0: .PP
wolffd@0: Undirected graphs are silently ignored.
wolffd@0: .SH OPERANDS
wolffd@0: The following operand is supported:
wolffd@0: .TP 8
wolffd@0: .I files
wolffd@0: Names of files containing 1 or more graphs in dot format.
wolffd@0: If no
wolffd@0: .I files
wolffd@0: operand is specified,
wolffd@0: the standard input will be used.
wolffd@0: .SH "BUGS"
wolffd@0: Using bitmaps internally would substantially decrease running time.
wolffd@0: .SH "DIAGNOSTICS"
wolffd@0: If a graph has cycles, its transitive reduction is not uniquely defined.
wolffd@0: In this case \fItred\fP emits a warning.
wolffd@0: .SH AUTHORS
wolffd@0: Stephen C. North <north@research.att.com>
wolffd@0: .br
wolffd@0: Emden R. Gansner <erg@research.att.com>
wolffd@0: .SH "SEE ALSO"
wolffd@0: gc(1), dot(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), sccmap(1), libgraph(3)