Linux and UNIX Man Pages

Linux & Unix Commands - Search Man Pages

prune(1) [debian man page]

prune(1)						      General Commands Manual							  prune(1)

NAME
prune - Prune directed graphs SYNOPSIS
prune [ -n node ] [ -N attrspec ] [ files ... ] DESCRIPTION
prune reads directed graphs in the same format used by dot(1) and removes subgraphs rooted at nodes specified on the command line via options. These nodes themselves will not be removed, but can be given attributes so that they can be easily located by a graph stream edi- tor such as gvpr(1). prune correctly handles cycles, loops and multi-edges. Both options can appear multiple times on the command line. All subgraphs rooted at the respective nodes given will then be processed. If a node does not exist, prune will skip it and print a warning message to stderr. If multiple attributes are given, they will be applied to all nodes that have been processed. prune writes the result to the stdout. OPTIONS
-n name Specifies name of node to prune. -N attrspec Specifies attribute that will be set (or changed if it exists) for any pruned node. attrspec is a string of the form attr=value. EXAMPLES
An input graph test.dot of the form digraph DG { A -> B; A -> C; B -> D; B -> E; } , processed by the command prune -n B test.dot would produce the following output (the actual code might be formatted in a slightly different way). digraph DG { A -> B; A -> C; } Another input graph test.dot of the form digraph DG { A -> B; A -> C; B -> D; B -> E; C -> E; } (note the additional edge from C to E ), processed by the command prune -n B -N color=red test.dot results in digraph DG { B [color=red]; A -> B; A -> C; C -> E; } Node E has not been removed since its second parent C is not being pruned. EXIT STATUS
prune returns 0 on successful completion. It returns 1 if an error occurs. SEE ALSO
dot(1), gvpr(1) AUTHOR
Marcus Harnisch <marcus.harnisch@gmx.net> prune(1)

Check Out this Related Man Page

GVCOLOR(1)						      General Commands Manual							GVCOLOR(1)

NAME
gvcolor - flow colors through a ranked digraph ( previously known as colorize ) SYNOPSIS
gvcolor [ files ] USAGE
dot file.dot | gvcolor | dot -T<format> DESCRIPTION
gvcolor is a filter that sets node colors from initial seed values. Colors flow along edges from tail to head, and are averaged (as HSB vectors) at nodes. The graph must already have been processed by dot. Appropriate choice of initial colors yields drawings in which node colors help to emphasize logical relationships between nodes, even when they are spread far apart in the layout. Initial colors must be set externally, using the color attribute of a node. It is often effective to assign colors to a few key source or sink nodes, manually setting their colors by editing the graph file. Color names are as in dot(1): symbolic names or RGB triples. It is best to choose some easily-distinguished but related colors; not necessarily spaced evenly around the color wheel. For example, blue_green, green, and light_yellow looks better than red, green, blue. Certain graph attributes control the gvcolor algorithm. flow=back reverses the flow of colors from heads to tails. saturation=.1,.9 (or any two numbers between 0 and 1) adjusts the color saturation linearly from least to greatest rank. If Defcolor is set, this color value is applied to any node not otherwise colored. EXIT STATUS
The following exit values are returned: 0 Successful completion. 1 If nodes of the graph do not possess a ``pos'' attribute. BUGS
It would be nice to make the program work without relying on an initial pass through dot. AUTHORS
Stephen C. North <north@research.att.com> Emden R. Gansner <erg@research.att.com> SEE ALSO
gc(1), dot(1), gvpr(1), ccomps(1), sccmap(1), tred(1), libgraph(3) 21 March 2001 GVCOLOR(1)
Man Page