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

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