UNIQG(1)

💖 NAME 💖

uniqg — bestie's manual page for uniqg version 2.9.3 🦋

---

✨ SYNOPSIS ✨

uniqg [-q] [-xFILE] [-Xfile] [-hFILE] [-fxxx] [-u|-S|-t]

[-c] [-k] [-i# -I#:# -K#] [infile [outfile]]

---

🌸 DESCRIPTION 🌸

okay so picture this: you have a whole file of graphs (or digraphs) and some of them are literally the same graph wearing a different outfit. uniqg says not on my watch and removes the duplicates for you. 💅

The SHA256 cryptographic hash function is used for comparisons, so yeah, it's serious about it. 🔥

---

👑 THE OPTIONS (still DESCRIPTION, but make it a moment) 👑

• -S — use sparse representation internally. 🫶

heads up bestie: this changes the canonical labelling. Multiple edges are not supported. One loop per vertex is ok.

• -t — use Traces</c>.
• -u — no output, just count. it's giving "I only want the number" energy. 🔢
• -H — write hash codes (32 bytes), not graphs. note: this is binary output 🙈

also note: the output depends on the endianness of the hardware, so -H and -h can only be used together on compatible endianness. mismatched endianness? tragedy. 💀

• -J — write hash codes without newlines, followed by newlines. this output cannot be read with -h. 😭
• -k — write the input graph exactly, not a canonical graph. keep it as-is, no glow-up. ✨
• -c — assume graphs from infile are canonically labelled already. trust.
• -xFILE — read a file of graphs and exclude them from the output. 🚫
• -XFILE — like -xFILE but assume they are already canonically labelled.
• -hFILE — read a file of hash codes and exclude them from the output.
• -F — flush output for each new graph. (expensive if there are many 👀)
• -fxxx — specify a partition of the vertex set. xxx is any string of ASCII characters except nul. this string is considered extended to infinity on the right with the character 'z'. the sequence 'x^N', where x is a character and N is a number, is equivalent to writing 'x' N times. one character is associated with each vertex, in the order given. the labelling used obeys these rules:
  1. the new order of the vertices is such that the associated characters are in ASCII ascending order
  2. if two graphs are labelled using the same string xxx, the output graphs are identical iff there is an associated-character-preserving isomorphism between them.

if a leading '-' is used, as in -f-xxx, the characters are assigned to the vertices starting at the last vertex, and the new order of the vertices respects decreasing ASCII order. 🌈

• -y — write a 256-bit cryptographic hashcode to stderr. this depends on the set of isomorphism classes but not their order. it also depends on -i, -I, -K, -S, -t and -c. 🎀
• -i# — select an invariant:
  • 1 = twopaths
  • 2 = adjtriang(K)
  • 3 = triples
  • 4 = quadruples
  • 5 = celltrips
  • 6 = cellquads
  • 7 = cellquins
  • 8 = distances(K)
  • 9 = indsets(K)
  • 10 = cliques(K)
  • 11 = cellcliq(K)
  • 12 = cellind(K)
  • 13 = adjacencies
  • 14 = cellfano
  • 15 = cellfano2
  • 16 = refinvar(K)
• -I#:# — select mininvarlevel and maxinvarlevel (default 1:1). 💜
• -K# — select invararg (default 3). ⭐
• -q — suppress auxiliary information. quiet mode, main character silence. 🤫

---

that's the whole vibe, bestie — uniqg 2.9.3, September 2026, go dedupe those graphs and slay. periodt. 💖✨