DISTGRAPHG(1)

💖 DISTGRAPHG 💖

hii bestie, welcome to the manual page for distgraphg 2.9.3 🦋 this one lives in the User Commands section and she is genuinely so fun once you get her vibe. no cap. let's get into it ✨

---

🎀 NAME 🎀

distgraphg — the manual page for distgraphg 2.9.3. that's her, that's the girl 💅

---

🌸 SYNOPSIS 🌸

distgraphg [-e|o|i] [-d#|-d#:#]... [-q] [infile [outfile]]

like, infile and outfile are just hanging out there in optional brackets, and everything else is flags. iconic behavior honestly 🫶

---

💅 DESCRIPTION 💅

okay so the whole point: form graphs defined by distances in the input graphs. the -d,-e,-o-i parameters define a set of distances. and then — this is the important part, don't skip it — the output graph has an edge if the distance in the input graph is in the set. periodt. 🔥

here's the rundown of every single one of those parameters, no gatekeeping:

• -d#, -d#:# — specify a range of allowed distances. and yes, you can absolutely stack this one: it can be repeated up to 100 times. a hundred. go off 🎀
• -i — include infinity, aka unreachable vertices. letting the unreachable girls into the party 💜
• -e, -o — only allow even or only allow odd distances. pick your lane bestie 🌈

and now the lore, because the behavior changes depending on what you pass:

• if none of -d, -e, -o, -i is present, the square of the graph is taken. that's the default, that's just what happens 💫
• if -e or -o show up without -d, then all even distances or all odd distances are allowed. simple as that 🍓

also a tiny detail that matters: the output file has a header if and only if the input file does. like, it matches the input's energy exactly, no more no less 👑

and last but not least:

• -q — suppress auxiliary information. she's quiet, she's mysterious, she's not telling you the extra stuff 🤫

---

👑 SIGN-OFF 👑

this gorgeous thing is distgraphg version 2.9.3, and the page itself is dated September 2026. that's the whole manual bestie, you ate it, go run her 💖✨🦋