| November 2025 | ||||||
| Mo | Tu | We | Th | Fr | Sa | Su | 
| 27 | 28 | 29 | 30 | 31 | 1 | 2 | 
| 3 | 4 | 5 | 6 | 7 | 8 | 9 | 
| 10 | 11 | 12 | 13 | 14 | 15 | 16 | 
| 17 | 18 | 19 | 20 | 21 | 22 | 23 | 
| 24 | 25 | 26 | 27 | 28 | 29 | 30 | 
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 
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.
       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.