comparison toolboxes/graph_visualisation/share/man/man1/gvpack.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
comparison
equal deleted inserted replaced
-1:000000000000 0:cc4b1211e677
1 .TH GVPACK 1 "8 April 2003"
2 .SH NAME
3 gvpack \- merge and pack disjoint graphs
4 .SH SYNOPSIS
5 .B gvpack
6 [
7 .B \-nguv?
8 ]
9 [
10 .BI \-m margin
11 ]
12 [
13 .BI \-o outfile
14 ]
15 [
16 .BI \-G name\fB=\fPvalue
17 ]
18 [
19 .I files
20 ]
21 .SH DESCRIPTION
22 .B gvpack
23 reads in a stream of graphs, combines the graphs into a single
24 layout, and produces a single graph serving as the union of the
25 input graphs. The input graphs must be in dot format, and must have
26 all necessary layout information. Acceptable input is produced
27 by applying a Graphviz layout program, such as \fBdot\fP or \fBneato\fP,
28 with no \fB\-T\fP flag.
29 .P
30 By default, the packing is done at the cluster level. Thus, parts of
31 one graph will not intrude into any top\(hylevel clusters or overlap
32 any nodes or edges of another.
33 .P
34 The output of \fBgvpack\fP can be used to produce concrete output
35 by applying \fBneato \-s \-n2\fP with the desired \fB\-T\fP flag.
36 .SH OPTIONS
37 The following options are supported:
38 .TP
39 .B \-g
40 Combines the graphs at the graph level. This uses more space, but prevents
41 parts of one graph from occurring between parts of another.
42 .TP
43 .BI \-G "name\fB=\fPvalue"
44 Specifies attributes to be added to the resulting union graph. For
45 example, this can be used to specify a graph label.
46 .TP
47 .BI \-m "margin"
48 Packs the graphs allowing a margin of \fIoutput\fP points around
49 the parts.
50 .TP
51 .B \-n
52 Combines the graphs at the node level. Clusters are ignored in the packing.
53 .TP
54 .BI \-o "output"
55 Prints output to the file \fIoutput\fP. If not given, \fBgvpack\fP
56 uses stdout.
57 .TP
58 .B \-u
59 Don't pack the graphs. Just combine them into a single graph.
60 .TP
61 .B \-v
62 Verbose mode.
63 .TP
64 .B \-?
65 Prints usage information and exit.
66 .SH OPERANDS
67 The following operand is supported:
68 .TP 8
69 .I files
70 Names of files containing 1 or more graphs in dot format.
71 If no
72 .I files
73 operand is specified,
74 the standard input will be used.
75 .SH RETURN CODES
76 .B gvpack
77 returns
78 .B 0
79 if there were no problems, and non\(hyzero otherwise.
80 .SH EXAMPLES
81 .EX
82 ccomps \-x abc.dot | dot | gvpack | neato \-s \-n2 \-Tps
83 .EE
84 This pipeline decomposes the graph in \fIabc.dot\fP into its
85 connected components, lays out each using \fBdot\fP, packs them all together
86 again, and produces the final drawing in PostScript. Of course,
87 there is nothing to prevent one from using different layouts for
88 each component.
89 .SH "BUGS"
90 All the input graphs must be directed or undirected.
91 .P
92 An input graph should not have a label, since this will be used in its
93 layout. Since \fBgvpack\fP ignores root graph labels, resulting layout
94 may contain some extra space.
95 .P
96 \fBgvpack\fP unsets the bounding box attribute of all non\(hycluster
97 subgraphs.
98 .SH AUTHORS
99 Emden R. Gansner <erg@research.att.com>
100 .SH "SEE ALSO"
101 gvpr(1), dot(1), neato(1), twopi(1), ccomps(1), libpack(3)