1GVPACK(1)                   General Commands Manual                  GVPACK(1)
2
3
4

NAME

6       gvpack - merge and pack disjoint graphs
7

SYNOPSIS

9       gvpack  [  -nguv?   ]  [  -mmargin  ]  [  -arrayopts  ] [ -ooutfile ] [
10       -sgraph_name ] [ -Gname=value ] [ files ]
11

DESCRIPTION

13       gvpack reads in a stream of graphs, combines the graphs into  a  single
14       layout,  and  produces a single graph serving as the union of the input
15       graphs. The input graphs must be in dot format, and must have all  nec‐
16       essary  layout  information. Acceptable input is produced by applying a
17       Graphviz layout program, such as dot or neato, with no -T flag.
18
19       By default, the packing is done at the cluster level.  Thus,  parts  of
20       one  graph  will not intrude into any top‐level clusters or overlap any
21       nodes or edges of another.
22
23       The output of gvpack can be used to produce concrete output by applying
24       neato -s -n2 with the desired -T flag.
25

OPTIONS

27       The following options are supported:
28
29       -g     Combines  the  graphs  at the graph level. This uses more space,
30              but prevents parts of one graph from occurring between parts  of
31              another.
32
33       -array[_flags][n]
34              Combines  the  graphs  at  the  graph  level, placing them in an
35              array.  By default, the layout is done in row-major  order.  The
36              number  of columns used is roughly the square root of the number
37              of graphs. If the optional integer n is supplied, this indicates
38              the number of columns to use.
39
40
41       If optional flags are supplied, these consist of an underscore followed
42              by  any  of the letters "c", "t", "b", "l", "r", "u" or "i".  If
43              "c" is supplied, the graphs are packed in column-major order, in
44              which  case  a  final integer specifies the number of rows.  The
45              flags "t", "b", "l", "r" indicate that  components  are  aligned
46              along the top, bottom, left or right, respectively.  By default,
47              the insertion order is determined by sorting the graphs by size,
48              largest  to  smallest.  If  the  "u" flag is set, the graphs are
49              sorted  based  on  the  non-negative  integer  sortv   attribute
50              attached  to each graph.  The "i" flag indicates that no sorting
51              is done, with the graphs inserted in input order.
52
53       -Gname=value
54              Specifies attributes to be added to the resulting  union  graph.
55              For example, this can be used to specify a graph label.
56
57       -mmargin
58              Packs  the  graphs allowing a margin of output points around the
59              parts.
60
61       -n     Combines the graphs at the node level. Clusters are  ignored  in
62              the packing.
63
64       -ooutput
65              Prints output to the file output. If not given, gvpack uses std‐
66              out.
67
68       -sgraph_name
69              Use graph_name as the name of the root graph. By default, "root"
70              is used.
71
72       -u     Don't pack the graphs. Just combine them into a single graph.
73
74       -v     Verbose mode.
75
76       -?     Prints usage information and exit.
77

OPERANDS

79       The following operand is supported:
80
81       files   Names  of  files containing 1 or more graphs in dot format.  If
82               no files operand is specified, the standard input will be used.
83

RETURN CODES

85       gvpack returns 0 if there were no problems, and non‐zero otherwise.
86

EXAMPLES

88       ccomps -x abc.gv | dot | gvpack | neato -s -n2 -Tps
89       This pipeline decomposes the graph in abc.gv into its connected  compo‐
90       nents, lays out each using dot, packs them all together again, and pro‐
91       duces the final drawing in PostScript. Of course, there is  nothing  to
92       prevent one from using different layouts for each component.
93

BUGS

95       All the input graphs must be directed or undirected.
96
97       An  input graph should not have a label, since this will be used in its
98       layout. Since gvpack ignores root graph labels,  resulting  layout  may
99       contain some extra space.
100
101       gvpack unsets the bounding box attribute of all non‐cluster subgraphs.
102

AUTHORS

104       Emden R. Gansner <erg@research.att.com>
105

SEE ALSO

107       gvpr(1), dot(1), neato(1), twopi(1), ccomps(1), libpack(3)
108
109
110
111                                  27 May 2010                        GVPACK(1)
Impressum