Daniel@0
|
1 .\" -*- nroff -*-
|
Daniel@0
|
2 .\" This manual is for graphviz, a rich set of graph drawing tools, and it
|
Daniel@0
|
3 .\" can be distributed under the same terms as the graphviz package.
|
Daniel@0
|
4 .\"
|
Daniel@0
|
5 .\" Copyright (C) 2006 Cyril Brulebois <cyril.brulebois@enst-bretagne.fr>
|
Daniel@0
|
6 .\"
|
Daniel@0
|
7 .TH GRAPHVIZ 7 "November 19, 2006"
|
Daniel@0
|
8 .SH "NAME"
|
Daniel@0
|
9 graphviz \- rich set of graph drawing tools
|
Daniel@0
|
10
|
Daniel@0
|
11 .SH "SYNOPSIS"
|
Daniel@0
|
12 This manpage has been written to fulfil the need of a centralized documentation
|
Daniel@0
|
13 presenting all available tools in the graphviz package.
|
Daniel@0
|
14
|
Daniel@0
|
15 .SH "AVAILABLE TOOLS"
|
Daniel@0
|
16
|
Daniel@0
|
17 .SS "Graph layout programs"
|
Daniel@0
|
18 .TP
|
Daniel@0
|
19 .B dot
|
Daniel@0
|
20 filter for hierarchical layouts of graphs
|
Daniel@0
|
21 .TP
|
Daniel@0
|
22 .B neato
|
Daniel@0
|
23 filter for symmetric layouts of graphs
|
Daniel@0
|
24 .TP
|
Daniel@0
|
25 .B twopi
|
Daniel@0
|
26 filter for radial layouts of graphs
|
Daniel@0
|
27 .TP
|
Daniel@0
|
28 .B circo
|
Daniel@0
|
29 filter for circular layout of graphs
|
Daniel@0
|
30 .TP
|
Daniel@0
|
31 .B fdp
|
Daniel@0
|
32 filter for symmetric layouts of graphs
|
Daniel@0
|
33 .PP
|
Daniel@0
|
34 All of the filters work with either directed or undirected graphs, though
|
Daniel@0
|
35 .B dot
|
Daniel@0
|
36 is typically used for directed graphs and
|
Daniel@0
|
37 .B neato
|
Daniel@0
|
38 for undirected graphs.
|
Daniel@0
|
39 Note also that \fBneato \-n[2]\fP can be used to render layouts produced
|
Daniel@0
|
40 by the other filters.
|
Daniel@0
|
41 .SS "Graph drawing programs"
|
Daniel@0
|
42 .TP
|
Daniel@0
|
43 .B lefty
|
Daniel@0
|
44 A Programmable Graphics Editor
|
Daniel@0
|
45 .TP
|
Daniel@0
|
46 .B lneato
|
Daniel@0
|
47 lefty + neato
|
Daniel@0
|
48 .TP
|
Daniel@0
|
49 .B dotty
|
Daniel@0
|
50 lefty + dot
|
Daniel@0
|
51
|
Daniel@0
|
52
|
Daniel@0
|
53 .SS "Graph layout enhancement"
|
Daniel@0
|
54 .TP
|
Daniel@0
|
55 .B gvcolor
|
Daniel@0
|
56 flow colors through a ranked digraph
|
Daniel@0
|
57 .TP
|
Daniel@0
|
58 .B unflatten
|
Daniel@0
|
59 adjust directed graphs to improve layout aspect ratio
|
Daniel@0
|
60 .TP
|
Daniel@0
|
61 .B gvpack
|
Daniel@0
|
62 merge and pack disjoint graphs
|
Daniel@0
|
63
|
Daniel@0
|
64 .SS "Graph information and transformation"
|
Daniel@0
|
65 .TP
|
Daniel@0
|
66 .B gc
|
Daniel@0
|
67 count graph components
|
Daniel@0
|
68 .TP
|
Daniel@0
|
69 .B acyclic
|
Daniel@0
|
70 make directed graph acyclic
|
Daniel@0
|
71 .TP
|
Daniel@0
|
72 .B nop
|
Daniel@0
|
73 pretty-print graph file
|
Daniel@0
|
74 .TP
|
Daniel@0
|
75 .B ccomps
|
Daniel@0
|
76 connected components filter for graphs
|
Daniel@0
|
77 .TP
|
Daniel@0
|
78 .B sccmap
|
Daniel@0
|
79 extract strongly connected components of directed graphs
|
Daniel@0
|
80 .TP
|
Daniel@0
|
81 .B tred
|
Daniel@0
|
82 transitive reduction filter for directed graphs
|
Daniel@0
|
83 .TP
|
Daniel@0
|
84 .B dijkstra
|
Daniel@0
|
85 single-source distance filter
|
Daniel@0
|
86 .TP
|
Daniel@0
|
87 .B bcomps
|
Daniel@0
|
88 biconnected components filter for graphs
|
Daniel@0
|
89 .TP
|
Daniel@0
|
90 .B gvpr
|
Daniel@0
|
91 graph pattern scanning and processing language
|
Daniel@0
|
92 .TP
|
Daniel@0
|
93 .B prune
|
Daniel@0
|
94 prune directed graphs
|
Daniel@0
|
95
|
Daniel@0
|
96 .SS "Other"
|
Daniel@0
|
97 .TP
|
Daniel@0
|
98 .B "gxl2dot, dot2gxl"
|
Daniel@0
|
99 GXL-DOT converters
|
Daniel@0
|
100
|
Daniel@0
|
101 .SH "AUTHOR"
|
Daniel@0
|
102 This manual page was written by Cyril Brulebois
|
Daniel@0
|
103 <cyril.brulebois@enst\-bretagne.fr> in november 2006, based on an initial
|
Daniel@0
|
104 documentation effort by Joachim Berdal Haga <jbh@lupus.ig3.net>. It can be
|
Daniel@0
|
105 distributed under the same terms as the graphviz package.
|
Daniel@0
|
106
|