![]() If optional flags are supplied, these consist of an underscore followedīy any of the letters "c", "t", "b", "l", "r", "u" or "i". If the optional integer n is supplied, this indicates the number of columns to use. The number of columns used is roughly the square root of the number of graphs. By default, the layout is done in row-major order. array Ĭombines the graphs at the graph level, placing them in an array. This uses more space, but prevents parts of one graph from occurring between parts of another. ![]() OptionsĬombines the graphs at the graph level. The output of gvpack can be used to produce concrete output by applying neato -s -n2 with the desired -T flag. Thus, parts of one graph will not intrude into any top-level clusters or overlap any nodes or edges of another. Acceptable input is produced by applying a Graphviz layout program, such as dot or neato, with no -T flag.īy default, the packing is done at the cluster level. The input graphs must be in dot format, and must have all necessary layout information. 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. ![]() Combine several graph layouts without packing: gvpack -u path/to/layout1.gv path/to/layout2.gv.Combine several graph layouts at the node level, ignoring clusters: gvpack -n path/to/layout1.gv path/to/layout2.gv.Combine several graph layouts at the graph level, keeping graphs separate: gvpack -g path/to/layout1.gv path/to/layout2.gv.Combine several graph layouts (that already have layout information): gvpack path/to/layout1.gv path/to/layout2.gv.Merge and pack disjoint graphs Examples (TL DR) ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |