| 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859 |
- .TH TRED 1 "21 March 2001"
- .SH NAME
- tred \- transitive reduction filter for directed graphs
- .SH SYNOPSIS
- .B tred
- [
- .B \-ovr?
- ]
- [
- .I files
- ]
- .SH DESCRIPTION
- .B tred
- computes the transitive reduction of directed graphs,
- and prints the resulting graphs to a file or 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.
- .B tred
- is particularly useful as a preprocessor to
- .I dot
- to reduce clutter in dense layouts.
- .PP
- Undirected graphs are silently ignored.
- .SH OPTIONS
- The following options are supported:
- .TP
- .B \-o FILE
- Redirect output to the given file. By default, output goes to stdout.
- .TP
- .B \-v
- Verbose output to stderr.
- .TP
- .B \-r
- Print information of removed edges to stderr.
- .TP
- .B \-?
- Print usage information.
- .SH OPERANDS
- The following operand is supported:
- .TP 8
- .I files
- Names of files containing 1 or more graphs in dot format.
- If no
- .I files
- operand is specified,
- the standard input will be used.
- .SH "BUGS"
- Using bitmaps internally would substantially decrease running time.
- .SH "DIAGNOSTICS"
- If a graph has cycles, its transitive reduction is not uniquely defined.
- In this case \fItred\fP emits a warning.
- .SH AUTHORS
- Stephen C. North <[email protected]>
- .br
- Emden R. Gansner <[email protected]>
- .SH "SEE ALSO"
- gc(1), dot(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), sccmap(1), libgraph(3)
|
