Linux and UNIX Man Pages

Linux & Unix Commands - Search Man Pages

prune(1) [centos man page]

prune(1)						      General Commands Manual							  prune(1)

NAME
prune - Prune directed graphs SYNOPSIS
prune [ -n node ] [ -N attrspec ] [ -v ] [ -(h|?) ] [ 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. -v Verbose output. -h -? Prints the usage and exits. EXAMPLES
An input graph test.gv of the form digraph DG { A -> B; A -> C; B -> D; B -> E; } , processed by the command prune -n B test.gv 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.gv 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.gv 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

GRAPHVIZ(7)						 Miscellaneous Information Manual					       GRAPHVIZ(7)

NAME
graphviz - rich set of graph drawing tools SYNOPSIS
This manpage has been written to fulfil the need of a centralized documentation presenting all available tools in the graphviz package. AVAILABLE TOOLS
Graph layout programs dot filter for hierarchical layouts of graphs neato filter for symmetric layouts of graphs twopi filter for radial layouts of graphs circo filter for circular layout of graphs fdp filter for symmetric layouts of graphs All of the filters work with either directed or undirected graphs, though dot is typically used for directed graphs and neato for undi- rected graphs. Note also that neato -n[2] can be used to render layouts produced by the other filters. Graph drawing programs lefty A Programmable Graphics Editor lneato lefty + neato dotty lefty + dot Graph layout enhancement gvcolor flow colors through a ranked digraph unflatten adjust directed graphs to improve layout aspect ratio gvpack merge and pack disjoint graphs Graph information and transformation gc count graph components acyclic make directed graph acyclic nop pretty-print graph file ccomps connected components filter for graphs sccmap extract strongly connected components of directed graphs tred transitive reduction filter for directed graphs dijkstra single-source distance filter bcomps biconnected components filter for graphs gvpr graph pattern scanning and processing language prune prune directed graphs Other gxl2dot, dot2gxl GXL-DOT converters AUTHOR
This manual page was written by Cyril Brulebois <cyril.brulebois@enst-bretagne.fr> in november 2006, based on an initial documentation effort by Joachim Berdal Haga <jbh@lupus.ig3.net>. It can be distributed under the same terms as the graphviz package. November 19, 2006 GRAPHVIZ(7)
Man Page