BOTCH-GRAPH-DESCENDANTS(1)

💖 BOTCH-GRAPH-DESCENDANTS 💖

okay bestie, welcome to botch-graph-descendants, one of the botch tools, manual section 1. sit down, grab a strawberry 🍓, we're finding descendants.

---

✨ NAME ✨

botch-graph-descendants — find all descendants of a vertex in a graph in GraphML or dot format

---

🦋 SYNOPSIS 🦋

botch-graph-descendants [options] --source SOURCE [--source SOURCE ...]
[ingraph] [outgraph]

---

💅 DESCRIPTION 💅

so what this does is it extracts the subgraph of all descendants of a specific node in the input graph. literally just that. the whole point. iconic.

the --source option is mandatory — no source, no service — and you can specify it more than once. periodt.

if either (or both) of the positional arguments is/are omitted, then it reads GraphML or dot from standard input and/or writes GraphML or dot to standard output, respectively. and if you pass a - as either argument, that explicitly says "read the input from standard input" and "write the output to standard output", respectively. so the dash is you being like "yes i MEANT stdin, thanks". 🫶

the input graph type gets figured out automatically, no cap. if the output graph is given as a filename, then the output type will be GraphML if the filename ends with .xml and dot if the filename ends with .dot. and if the output goes to standard output, then it happens in the same format as the input graph. matching energies, we love that. ✨

---

👑 OPTIONS 👑

• -h, --help — display help. she's helpful, she's giving customer service 💁
• --source=SOURCE — this one picks the source vertex whose descendants get computed. the SOURCE argument is a key/value pair (separated by a colon) of a graph attribute and its desired value. if more than one vertex matches the given key/value pair, then the smallest (by node comparison) is chosen. tiny queen wins, i don't make the rules.

the special key "__ID__" lets you select the unique vertex identifier. slay.

this option can be specified more than once. the final set of vertices is chosen such that all vertices match all key/value pairs. multiple --source options thus form a logical conjunction (they are AND-ed together). so it's not a "pick your fave" situation, it's an "everyone has to agree" situation. 💀

• -v, --verbose — be verbose. tell me everything, i'm listening, i have time 🌸

---

🌈 EXAMPLE 🌈

extract the subgraph of all descendants of a binary packages vertex with name "build-essential" and version "11.7". okay so like, very specific vibes:

botch-graph-descendants --source name:build-essential --source version:11.7 --source type:bin < in.xml > out.xml

or giving input and output as positional arguments:

botch-graph-descendants --source name:build-essential --source version:11.7 --source type:bin in.xml out.xml

both of these ate, honestly. 🎀

---

💀 BUGS 💀

see <http://bugs.debian.org/botch>. (yes, go look, they're public.)

---

🧚 SEE ALSO 🧚

Debian doc-base Manual /usr/share/doc/botch/wiki/Home.html

---

💜 AUTHOR 💜

this man page was written by Johannes Schauer. Botch is written by Johannes Schauer and Pietro Abate. two legends, no notes. 👑

---

⭐ COPYRIGHT ⭐

Copyright 2012-2014 Johannes Schauer, Pietro Abate

this program is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. a special linking exception to the GNU Lesser General Public License applies to this library, see the COPYING file for more information.

fr fr read the COPYING file, it's right there, it's free, it's giving legal literacy 💅

---

okay that's the whole page, bestie, you're fully caught up 🦋 this was written for perl v5.36.0 on 2023-02-17, mwah, love u, go find some descendants ✨🎀💖