annotate toolboxes/graph_visualisation/share/man/man1/tred.1 @ 0:e9a9cd732c1e tip

first hg version after svn
author wolffd
date Tue, 10 Feb 2015 15:05:51 +0000
parents
children
rev   line source
wolffd@0 1 .TH TRED 1 "21 March 2001"
wolffd@0 2 .SH NAME
wolffd@0 3 tred \- transitive reduction filter for directed graphs
wolffd@0 4 .SH SYNOPSIS
wolffd@0 5 .B tred
wolffd@0 6 [
wolffd@0 7 .I files
wolffd@0 8 ]
wolffd@0 9 .SH DESCRIPTION
wolffd@0 10 .B tred
wolffd@0 11 computes the transitive reduction of directed graphs,
wolffd@0 12 and prints the resulting graphs to standard output.
wolffd@0 13 This removes edges implied by transitivity.
wolffd@0 14 Nodes and subgraphs are not otherwise affected.
wolffd@0 15 The ``meaning'' and validity of the reduced graphs
wolffd@0 16 is application dependent.
wolffd@0 17 .B tred
wolffd@0 18 is particularly useful as a preprocessor to
wolffd@0 19 .I dot
wolffd@0 20 to reduce clutter in dense layouts.
wolffd@0 21 .PP
wolffd@0 22 Undirected graphs are silently ignored.
wolffd@0 23 .SH OPERANDS
wolffd@0 24 The following operand is supported:
wolffd@0 25 .TP 8
wolffd@0 26 .I files
wolffd@0 27 Names of files containing 1 or more graphs in dot format.
wolffd@0 28 If no
wolffd@0 29 .I files
wolffd@0 30 operand is specified,
wolffd@0 31 the standard input will be used.
wolffd@0 32 .SH "BUGS"
wolffd@0 33 Using bitmaps internally would substantially decrease running time.
wolffd@0 34 .SH "DIAGNOSTICS"
wolffd@0 35 If a graph has cycles, its transitive reduction is not uniquely defined.
wolffd@0 36 In this case \fItred\fP emits a warning.
wolffd@0 37 .SH AUTHORS
wolffd@0 38 Stephen C. North <north@research.att.com>
wolffd@0 39 .br
wolffd@0 40 Emden R. Gansner <erg@research.att.com>
wolffd@0 41 .SH "SEE ALSO"
wolffd@0 42 gc(1), dot(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), sccmap(1), libgraph(3)