GENRANG(1)

💖 GENRANG(1) 💖

okay bestie, sit down, hydrate, because we're about to talk about genrang — that's the manual page for genrang 2.9.3, living in the User Commands section. it makes random graphs. yes, graphs. no, not the ones with axes. the other ones. 🦋

---

✨ SYNOPSIS ✨

genrang [-P#|-P#/#|-e#|-r#|-R#|-d#] [-M#] [-l#] [-m#] [-t] [-T] [-a]
        [-s|-g|-z] [-S#] [-q] n|n1,n2 num [outfile]

like. look at her. so many little flags. she's giving options. 💅

---

🌸 DESCRIPTION 🌸

Generate random graphs. that's the whole job. that's what she does. and she does it well. 💜

here's the vibe check on the arguments:

• n — the number of vertices
• n1,n2 — the number of vertices, but for a bipartite graph
• num — the number of graphs
• outfile — where the graphs go

heads up bestie: a bipartite variant is only available if specified below. so don't just assume. read the flags. i know. i know. 🙈

and here's the format squad:

• -s — write in sparse6 format. this is the default, she's the main character ✨
• -g — write in graph6 format
• -z — make random digraphs and write in digraph6 format

---

🎀 OPTIONS 🎀

okay this is the part you're actually here for. every single one. no skips. periodt.

• -P#/# — give the edge probability. and if you only pass -P#? that means -P1/#. Bipartite version available. 💖
• -e# — give the number of edges. Bipartite version available. 💖
• -r# — make a regular graph of the specified degree
• -d# — make a regular graph of the specified degree, but pseudorandom
  • with -z, you get a #-in #-out digraph with no loops
  • bipartite version: this is the degree on the first side
• -M# — in conjunction with -d, make the distribution more uniform by running a Markov chain for #*n steps, starting at the pseudorandom graph
• -R# — make a regular graph of the specified degree, but output it as: vertex count, then edge count, then the list of edges
• -l# — maximum loop multiplicity (default 0)
• -m# — maximum multiplicity of a non-loop edge (default and minimum 1)
• -t — make a random spanning tree of a complete graph, or of a complete bipartite graph 🌳
• -T — make a random tournament (this implies -z)
• -a — make it invariant under a random permutation
• -S# — specify the random generator seed (default is nondeterministic, i.e. chaos, i.e. slay)
• -G# — accept with probability min(1,|Aut(G)|/#). the output will then approximate unlabelled graphs — accuracy goes 📈 and efficiency goes 📉 as # increases
• -q — suppress auxiliary output 🤫

---

reminder bestie: -l# defaults to 0 and -m# has a default of 1 and 1 is also the minimum. don't come for me, that's just what the page says. 🫶

---

🌈 SEE ALSO 🌈

there's nothing else listed here, and honestly? she doesn't need anyone else. she's self-sufficient. icon behavior. 👑

---

written by the genrang 2.9.3 girlies, dated September 2026 💖 that's the whole page. you ate. now go generate some graphs fr fr 🌸✨🦋