Go to main content

man pages section 1: User Commands

Exit Print View

Updated: Thursday, June 13, 2019
 
 

prune (1)

Name

prune - Prune directed graphs

Synopsis

prune [ -n node ] [ -N attrspec ] [ files ...  ]

Description

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  editor
       such  as  gvpr(1).   prune  correctly  handles cycles, loops and multi-
       edges.

       Both options can appear multiple times on the command  line.  All  sub-
       graphs  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.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.


ATTRIBUTES
       See attributes(7) for descriptions of the following attributes:


       +---------------+------------------+
       |ATTRIBUTE TYPE | ATTRIBUTE VALUE  |
       +---------------+------------------+
       |Availability   | image/graphviz   |
       +---------------+------------------+
       |Stability      | Volatile         |
       +---------------+------------------+
SEE ALSO
       dot(1), gvpr(1)


AUTHOR
       Marcus Harnisch <marcus.harnisch@gmx.net>



NOTES
       This    software    was    built    from    source     available     at
       https://github.com/oracle/solaris-userland.    The  original  community
       source was downloaded  from   http://www.graphviz.org/pub/graphviz/sta-
       ble/SOURCES/graphviz-2.28.0.tar.gz

       Further information about this software can be found on the open source
       community website at http://www.graphviz.org/.



                                                                      prune(1)