SCCMAP(1)

💖 SCCMAP(1) — the general commands manual, but make it a group chat 💖

okay so bestie, welcome to the General Commands Manual page for sccmap 💅 this is the one you pull up when your digraph is giving "unmanageable chaos" and you need it broken into cute little cliques.

---

✨ NAME ✨

sccmap — extract strongly connected components of directed graphs 🦋

---

✨ SYNOPSIS ✨

sccmap [-dsSv] [ -ooutfile ] [ files ]

---

✨ DESCRIPTION ✨

so basically, sccmap decomposes digraphs into strongly connected components plus an auxiliary map of how those components relate to each other. in that map, every component gets collapsed down into a single node. it's giving glow-down in the best way 🎀

the resulting graphs get printed to standard out. the number of nodes, edges and strongly connected components gets printed to standard error. and like — that's the whole point — sccmap is literally a way of partitioning big scary graphs into more manageable little pieces. main character energy for your data structure fr fr 🔥

---

✨ OPTIONS ✨

these are the options that are supported, no cap:

• -d — preserve degenerate components that are only one node. don't ghost the solo nodes bestie 🙈
• -s — do not print the resulting graphs. only the statistics matter here, so that's all you get 💀
• -S — just print the resulting graphs. no statistics, no extras, just the graphs periodt ✨
• -ooutput — prints output to the file output. if you don't pass it, sccmap just uses stdout 💖
• -v — generate additional statistics. specifically, sccmap prints the number of nodes, edges, connected components, and strongly connected components — followed by the fraction of nodes in a non-trivial strongly connected components, the maximum degree of the graph, and fraction of non-tree edges in the graph. it's the full lore drop 👑

---

✨ OPERANDS ✨

the following operand is supported:

• files — names of files containing 1 or more graphs in dot format. if no files operand is specified, the standard input will be used 🌸

---

✨ DIAGNOSTICS ✨

sccmap emits a warning if it encounters an undirected graph, and ignores it. not a vibe, not a crash — just a lil warning and a skip 💅

---

✨ AUTHORS ✨

• Stephen C. North <north@research.att.com>
• Emden R. Gansner <erg@research.att.com>

absolute icons, we stan 👑

---

✨ SEE ALSO ✨

gc(1), dot(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), tred(1), libgraph(3) 🦋

---

okay that's the whole page bestie!! this one's from the General Commands Manual, dated 21 March 2001 (yes she's vintage, she's timeless, she ate and left no crumbs) — go partition something huge into something slayable 💖✨🎀🫶