Linux and UNIX Man Pages

Linux & Unix Commands - Search Man Pages

gvpack(1) [centos man page]

GVPACK(1)						      General Commands Manual							 GVPACK(1)

gvpack - merge and pack disjoint graphs SYNOPSIS
gvpack [ -nguv? ] [ -mmargin ] [ -array[_flags][n] ] [ -ooutfile ] [ -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 top-level 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" or "u". 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. The "u" flag indicates that the insertion order is based on the sortv attribute attached to each graph. -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. -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 non-zero 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 non-cluster subgraphs. AUTHORS
Emden R. Gansner <> SEE ALSO
gvpr(1), dot(1), neato(1), twopi(1), ccomps(1), libpack(3) 27 May 2010 GVPACK(1)

Check Out this Related Man Page

CCOMPS(1)                                                     General Commands Manual                                                    CCOMPS(1)

ccomps - connected components filter for graphs SYNOPSIS
ccomps [ -sxvnzC? ] [ -X[#]v ] [ -ooutfile ] [ files ] DESCRIPTION
ccomps decomposes graphs into their connected components, printing the components to standard output. OPTIONS
The following options are supported: -s No output graph is printed. The return value can be used to check if the graph is connected or not. -x Only the connected components are printed, as separate graphs. -v Counts of nodes, edges and connected components are printed. -z Sort components by size, with the largest first. This is only effective if either -x or -X#v is present. Thus, -zX#0 will cause the largest component to be printed. -C Use clusters in computing components in addition to normal edge connectivity. In essence, this gives the connected components of the derived graph in which nodes top-level clusters and nodes in the original graph. This maintains all subgraph structure within a com- ponent, even if a subgraph does not contain any nodes. -n Do not project subgraph structure. Normally, if ccomps produces components as graphs distinct from the input graph, it will define subgraphs which are projections of subgraphs of the input graph onto the component. (If the projection is empty, no subgraph is pro- duced.) If this flag is set, the component contains only the relevant nodes and edges. -X node_name Prints only the component containing the node node_name, if any. -X# index Prints only component number index, if any, starting at 0. -o outfile If specified, each graph will be written to a different file with the names derived from outfile. In particular, if both -o and -x flags are used, then each connected component is written to a different file. If outfile does not have a suffix, the first file will have the name outfile; then next outfile_1, then next outfile_2, and so on. If outfile has a suffix, i.e., has the form base.sfx, then the files will be named base.sfx, base_1.sfx, base_2.sfx, etc. By default, each input graph is printed, with each connected component given as a subgraph whose name is a concatenation of the name of the input graph, the string "_component_" and the number of the component. 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
Unless used to extract a single connected component, ccomps returns 0 if all the input graphs are connected; and non-zero if any graph has multiple components, or any error occurred. If just extracting a single component, ccomps returns 0 on success and non-zero if an error occurred. BUGS
It is possible, though unlikely, that the names used for connected components and their subgraphs may conflict with existing subgraph names. AUTHORS
Stephen C. North <> Emden R. Gansner <> SEE ALSO
gc(1), dot(1), gvpr(1), gvcolor(1), acyclic(1), sccmap(1), tred(1), libgraph(3) 27 August 2008 CCOMPS(1)
Man Page

Featured Tech Videos