CLIQUER(1)

💖 CLIQUER(1) 💖

okay bestie, gather round — this is the manual page for cliquer, living in the User Commands section of the manual (that's the (1) in the name, iykyk). It's a whole vibe and also a whole C library. Let's get into it. 🦋

---

✨ NAME ✨

cliquer — find cliques in arbitrary weighted graphs. That's it, that's the girl. 💅

---

🌸 SYNOPSIS 🌸

cliquer [OPTION]... <DIMACS_FILE>

---

🎀 DESCRIPTION 🎀

So basically, Cliquer is a set of C routines for finding cliques in an arbitrary weighted graph. It uses an exact branch-and-bound algorithm developed by Patric Östergård. The whole design goal? Being efficient while still being flexible and easy to use. The way it manages both at once... obsessed, honestly. 👑

---

💅 OPTIONS 💅

• -h, --help — print the help text. your little emergency info button fr.
• -a, --all — find all cliques. go off, collect them all.
• -s, --single — find a single clique. this is the default, so if you do nothing, this is what you get. lowkey iconic.
• -w, --weight — tell you only the maximum weight. heads up bestie, this is no faster than -s, so don't come for speed. 💀
• -m N, --min N — search for cliques with weight at least N. if N = 0, it searches for the maximum weight clique (that's the default, and yes that's a lil weird but that's the lore).
• -M N, --max N — search for cliques with weight at most N. if N = 0, no limit is imposed (default). ⚠️ a positive N is incompatible with --min 0 — in that case --min 1 is assumed.
• -x, --maximal — require cliques to be maximal. no half-finished situationships allowed. 💅
• -u, --unweighted — assume weight 1 for all vertices. flat, uniform, no favorites.
• -0, --from-0 — number vertices from 0 to n-1 instead of 1 to n when writing. zero-indexed girlies rise up. 🌈
• -r F, --reorder F — reorder with function F. the available functions are:
  • none — no ordering (same order as in the file). keeping it exactly as found, no notes.
  • reverse — reverse of the order in the file. plot twist ✨
  • default — either unweighted-coloring or weighted-coloring, depending on weightedness. she picks for you, she's decisive.
  • unweighted-coloring — coloring method efficient for unweighted graphs.
  • weighted-coloring — coloring method efficient for weighted graphs.
  • degree — order by ascending degree.
  • random — random order. chaos, but make it algorithmic. 🎲
• -q, --quiet — suppresses progress output. and specifying -q twice suppresses all output except the actual result. double -q is the silent treatment, periodt. 🤫

---

🫶 AUTHORS 🫶

Cliquer was written by Sampo Niskanen <sampo.niskanen@iki.fi> and Patric Östergård <patric.ostergard@tkk.fi>. absolute legends, we stan. 👑💖

---

and that's the whole page, bestie!! 🦋 this one's from Cliquer version 1.21, manual page CLIQUER(1) — so if you ever need to cite your sources, that's the tea. mwah, go find some cliques. 💋✨🌸