MULTIG(1)
π MULTIG π (that's section 1 of the manual, bestie)
πΈ NAME πΈ
multig β the manual page for multig 2.9.3. yes that's literally it, that's the whole name section π
β¨ SYNOPSIS β¨
multig [-q] [-V] [-u|-T|-G|-A|-B] [-e#|-e#:#]
[-m#] [-f#] [-D#|-r#|-l#] [infile [outfile]]
π¦ DESCRIPTION π¦
okay so picture this: multig reads undirected loop-free graphs and replaces their edges with multiple edges in all possible ways (multiplicity at least 1, no zero-multiplicity shenanigans). and the best part? multigraphs that are isomorphic and came from the same input get suppressed β gone, deleted, not invited to the party. π and if your input graphs were non-isomorphic to begin with, then the output graphs are also non-isomorphic. it's giving consistency, it's giving structural integrity, we love to see it. π«Ά
-e#|-e#:#β you're specifying a value, or a range, for the total number of edges counting multiplicities. yes, multiplicities count. every single one. β¨-m#β maximum edge multiplicity. and heads up: the minimum is 1. always. (minimum is 1) πΈ-D#β upper bound on the maximum degree. a lil ceiling for your degrees, as a treat. π-r#β make it regular of the specified degree. β οΈ incompatible with-l,-D,-eβ these options do NOT get along, do not put them in the same group chat. π-l#β make regular multigraphs with multiloops, degree #. β οΈ incompatible with-r,-D,-e. same energy, different vibe. multiloops are the main character here. π-f#β use the group that fixes the first # vertices setwise. setwise, bestie. not pointwise. respect the distinction. π-Vβ read the T format as produced byvcolgand obey the vertex colours when computing the automorphism group. and if-Tor-Gis used as the output format, a list of the input colours is included too. π¨
π’ the requirement, fr fr: either-l,-r,-D,-eor-mwith a finite maximum must be given. there is no vibing your way out of this one.
-Tβ use a simple text output format, which looks likenv ne {v1 v2 mult}. simple. clean. iconic. β¨-Gβ like-Tbut it includes the group size as the third item (only if it's less than10^10, so like, don't get too ambitious). π₯
π«Ά important footnote: the group size does not include exchange of isolated vertices. isolated vertices are just out here living their lives, not counted. π¦
-Aβ write as the upper triangle of an adjacency matrix, row by row, including the diagonal, and preceded by the number of vertices. triangle. upper. diagonal included. no notes. π-Bβ write as an integer matrix preceded by the number of rows and number of columns, where-fdetermines the number of rows. yes,-fis running the row count now, she's got a second job. π-uβ no output, just count them. that's it. that's the whole option. counting only, no receipts. π’-qβ suppress auxiliary information. shhh. quiet. π€«
π the sign-off π
this page is for multig 2.9.3, and it's dated September 2026 β so yeah, she's current, she's fresh, she ate and left no crumbs. go build some multigraphs, bestie. ππ¦β¨π
π¦ 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