Seth Woolley's Man Viewer

prune(1) - prune - Prune directed graphs - man 1 prune

([section] manual, -k keyword, -K [section] search, -f whatis)
man plain no title

prune(1)                                                              prune(1)



NAME
       prune - Prune directed graphs

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

DESCRIPTION
       prune  reads  directed  graphs  in(1,8)  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 gpr(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(7,n,1 builtins) (or changed if(3,n) it exists)
              for  any  pruned  node.   attrspec  is  a  string(3,n)  of  the  form
              attr(1,5)=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(1,8) 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(1,8)

            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(3,n) an error(8,n)
       occurs.

SEE ALSO
       dot(1), gpr(1)


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



                                                                      prune(1)

References for this manual (incoming links)