gvpack(1)
NAME
gvpack - merge and pack disjoint graphs
SYNOPSIS
gvpack [ -nguv? ] [ -mmargin ] [ -array[_flags][n] ] [ -ooutfile ] [ -sgraph_name ] [ -Gname=value ] [ files ]
DESCRIPTION
gvpack reads in a stream of graphs, combines the graphs into a single layout, and produces a single graph serving as the union of the input graphs. The input graphs must be in dot format, and must have all necessary layout information. Acceptable input is produced by applying a Graphviz layout program, such as dot or neato, with no -T flag. By default, the packing is done at the cluster level. Thus, parts of one graph will not intrude into any toplevel clusters or overlap any nodes or edges of another. The output of gvpack can be used to produce concrete output by applying neato -s -n2 with the desired -T flag.
OPTIONS
The following options are supported:
-g Combines the graphs at the graph level. This uses more space,
but prevents parts of one graph from occurring between parts of
another.
-array[_flags][n]
Combines the graphs at the graph level, placing them in an
array. By default, the layout is done in row-major order. The
number of columns used is roughly the square root of the number
of graphs. If the optional integer n is supplied, this indicates
the number of columns to use.
If optional flags are supplied, these consist of an underscore followed
by any of the letters "c", "t", "b", "l", "r", "u" or "i". If
"c" is supplied, the graphs are packed in column-major order, in
which case a final integer specifies the number of rows. The
flags "t", "b", "l", "r" indicate that components are aligned
along the top, bottom, left or right, respectively. By default,
the insertion order is determined by sorting the graphs by size,
largest to smallest. If the "u" flag is set, the graphs are
sorted based on the non-negative integer sortv attribute
attached to each graph. The "i" flag indicates that no sorting
is done, with the graphs inserted in input order.
-Gname=value
Specifies attributes to be added to the resulting union graph.
For example, this can be used to specify a graph label.
-mmargin
Packs the graphs allowing a margin of output points around the
parts.
-n Combines the graphs at the node level. Clusters are ignored in
the packing.
-ooutput
Prints output to the file output. If not given, gvpack uses
stdout.
-sgraph_name
Use graph_name as the name of the root graph. By default, "root"
is used.
-u Don't pack the graphs. Just combine them into a single graph.
-v Verbose mode.
-? Prints usage information and exit.
OPERANDS
The following operand is supported:
files Names of files containing 1 or more graphs in dot format. If
no files operand is specified, the standard input will be used.
RETURN CODES
gvpack returns 0 if there were no problems, and nonzero otherwise.
EXAMPLES
ccomps -x abc.gv | dot | gvpack | neato -s -n2 -Tps This pipeline decomposes the graph in abc.gv into its connected components, lays out each using dot, packs them all together again, and produces the final drawing in PostScript. Of course, there is nothing to prevent one from using different layouts for each component.
BUGS
All the input graphs must be directed or undirected. An input graph should not have a label, since this will be used in its layout. Since gvpack ignores root graph labels, resulting layout may contain some extra space. gvpack unsets the bounding box attribute of all noncluster subgraphs.
AUTHORS
Emden R. Gansner <erg@research.att.com>
SEE ALSO
gvpr(1), dot(1), neato(1), twopi(1), ccomps(1), libpack(3) 27 May 2010 GVPACK(1)
Opportunity
Personal Opportunity - Free software gives you access to billions of dollars of software at no cost. Use this software for your business, personal use or to develop a profitable skill. Access to source code provides access to a level of capabilities/information that companies protect though copyrights. Open source is a core component of the Internet and it is available to you. Leverage the billions of dollars in resources and capabilities to build a career, establish a business or change the world. The potential is endless for those who understand the opportunity.
Business Opportunity - Goldman Sachs, IBM and countless large corporations are leveraging open source to reduce costs, develop products and increase their bottom lines. Learn what these companies know about open source and how open source can give you the advantage.
Free Software
Free Software provides computer programs and capabilities at no cost but more importantly, it provides the freedom to run, edit, contribute to, and share the software. The importance of free software is a matter of access, not price. Software at no cost is a benefit but ownership rights to the software and source code is far more significant.
Free Office Software - The Libre Office suite provides top desktop productivity tools for free. This includes, a word processor, spreadsheet, presentation engine, drawing and flowcharting, database and math applications. Libre Office is available for Linux or Windows.
Free Books
The Free Books Library is a collection of thousands of the most popular public domain books in an online readable format. The collection includes great classical literature and more recent works where the U.S. copyright has expired. These books are yours to read and use without restrictions.
Source Code - Want to change a program or know how it works? Open Source provides the source code for its programs so that anyone can use, modify or learn how to write those programs themselves. Visit the GNU source code repositories to download the source.
Education
Study at Harvard, Stanford or MIT - Open edX provides free online courses from Harvard, MIT, Columbia, UC Berkeley and other top Universities. Hundreds of courses for almost all major subjects and course levels. Open edx also offers some paid courses and selected certifications.
Linux Manual Pages - A man or manual page is a form of software documentation found on Linux/Unix operating systems. Topics covered include computer programs (including library and system calls), formal standards and conventions, and even abstract concepts.
