gvpack(1)

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

NAME

6       gvpack - merge and pack disjoint graphs
7

SYNOPSIS

9       gvpack  [ -nguv?  ] [ -mmargin ] [ -ooutfile ] [ -Gname=value ] [ files
10       ]
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       -Gname=value
34              Specifies  attributes  to be added to the resulting union graph.
35              For example, this can be used to specify a graph label.
36
37       -mmargin
38              Packs the graphs allowing a margin of output points  around  the
39              parts.
40
41       -n     Combines  the  graphs at the node level. Clusters are ignored in
42              the packing.
43
44       -ooutput
45              Prints output to the file output. If not given, gvpack uses std‐
46              out.
47
48       -u     Don't pack the graphs. Just combine them into a single graph.
49
50       -v     Verbose mode.
51
52       -?     Prints usage information and exit.
53

OPERANDS

55       The following operand is supported:
56
57       files   Names  of  files containing 1 or more graphs in dot format.  If
58               no files operand is specified, the standard input will be used.
59

RETURN CODES

61       gvpack returns 0 if there were no problems, and non‐zero otherwise.
62

EXAMPLES

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

BUGS

71       All the input graphs must be directed or undirected.
72
73       An  input graph should not have a label, since this will be used in its
74       layout. Since gvpack ignores root graph labels,  resulting  layout  may
75       contain some extra space.
76
77       gvpack unsets the bounding box attribute of all non‐cluster subgraphs.
78

AUTHORS

80       Emden R. Gansner <erg@research.att.com>
81