tsort(1)

💖 tsort — the manual page, but make it cute ✨

okay so bestie, you opened the tsort(1) page from the General Commands Manual and I'm about to make it make sense. buckle up 🎀

---

🌸 NAME 🌸

tsort — topological sort the strings in FILE. strings are defined as any sequence of tokens separated by whitespace (tab, space, or newline), and we order them based on dependencies in a directed acyclic graph (DAG). it's giving very much scheduling-and-figuring-out-execution-order energy. and if FILE is not passed in? stdin is used instead, periodt. 💅

---

✨ SYNOPSIS ✨

tsort [-h|--help] [-V|--version] [file]

that's it. that's the whole vibe. 🦋

---

💜 DESCRIPTION 💜

so like, tsort topological sorts the strings in FILE. and when I say "strings" I mean any sequence of tokens separated by whitespace — and yes, that's tab, space, or newline, all three count, no cap. then it orders them based on dependencies in a directed acyclic graph (DAG). literally the main character of scheduling and determining execution order. 🔥

and if FILE is not passed in, stdin is used instead. easy. 🌈

---

🎀 OPTIONS 🎀

• -h, --help — print help. the "bestie explain" button. 💖
• -V, --version — print version. for when you gotta know what you're working with. ⭐

---

👑 VERSION 👑

v(uutils coreutils) 0.7.0

---

lowkey a tiny manual but highkey does exactly what it says. no notes. 💀✨

---

and that's the whole page, bestie 🫶 — brought to you by uutils coreutils 0.7.0, the iconic source of this very manual. mwah, go sort something topologically. 💋💅