BIPLABG(1)
π¦ NAME π¦
hii bestie, welcome to BIPLABG(1) β that's the section 1 (User Commands) manual page, and the command it's about is biplabg. and ngl the page is literally just the manual page for biplabg version 2.9.3. short king energy, we respect it π
β¨ SYNOPSIS β¨
okay so here's how you actually summon her:
biplabg [-q] [infile [outfile]]
both file arguments are optional, and so is -q. it's giving β¨choose your own adventureβ¨ fr fr.
πΈ DESCRIPTION πΈ
so what does she even do?? biplabg labels bipartite graphs so that the colour classes are contiguous. like, no gaps, no strays, all tidied up. slay.
the deets, no cap:
- the first vertex of each component gets assigned the first colour. that's the rule, she said so.
- vertices inside each colour class keep the same relative order as before β nothing gets rearranged, she's not messy like that π
- graphs that are not bipartite get rejected π do not test her, she will not be doing that for you.
- the output file has a header if and only if the input file has one. header in β header out, no header in β no header out. periodt. π₯
π OPTIONS π
-qβ suppress auxiliary information. that's the entire options list bestie, she's minimal and we're obsessed π
and that's the whole vibe check π«Ά this was the biplabg 2.9.3 manual page, dated September 2026. go forth and label some bipartite graphs, you absolute icon ππβ¨
π¦ where this page comes from
- fedora 43: nauty 2.9.3-3.fc43 Β· Apache-2.0 AND LicenseRef-Fedora-Public-Domain AND Knuth-CTAN AND GPL-1.0-or-later
- fedora 44: nauty 2.9.3-4.fc44 Β· Apache-2.0 AND LicenseRef-Fedora-Public-Domain AND Knuth-CTAN AND GPL-1.0-or-later
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms