MINGLE(1)

πŸ“¦
version 2.44.0 Β· 2 versions
, in centos-stream 9, debian bookworm, debian trixie, ubuntu jammy, ubuntu noble, ubuntu questing

πŸ’… MINGLE(1) β€” like, the mingle manual page, bestie ✨

okay so real quick β€” this is the page for mingle from the General Commands Manual, and yes we're doing the whole thing, no skimming, no "you get the vibe" shortcuts. you're gonna know this tool by the end. 🫢

Quick heads-up for the troff girlies: the source has a line delim $$ up top β€” that's just telling the formatter to use $$ for math. Cute. Moving on. πŸ’–


🌸 NAME 🌸

mingle β€” fast edge bundling. that's it. that's the whole name. iconic and efficient. ✨

πŸ¦‹ SYNOPSIS πŸ¦‹

mingle [ options ] [ -o outfile ] [ files ]

πŸŽ€ DESCRIPTION πŸŽ€

so mingle takes a graph in DOT format that already has node position info (that's the pos attribute, iykyk πŸ‘‘) and then it bundles the edges. literally what it says on the tin. no cap.

πŸ’… OPTIONS πŸ’…

the following options are supported β€” and yes, we're listing every single one, because you deserve the full set:

  • -m k β€” picks which bundling method to use. 0 = force-directed bundling. 2 = a cluster-plus-ink-saving approach. and if it's available, 1 means an agglomerative ink saving method. normally the last one β€” agglomerative β€” is the default. main character method fr. 🌟
  • -a k β€” the maximum turning angle, in degrees, given as a non-negative real. bigger value = more edges are allowed to bend. and if you set it to 0, there's no limitation at all on the turning angle. default is 40. πŸŒ€ note: this parameter is not used in force-directed bundling.
  • -c v β€” which compatability measure to use (yes, that's spelled "compatability" in the original, we respect the spelling πŸ’€). 0, the default, uses a distance metric. 1 relies on full compatability. this one only matters in force-directed bundling.
  • -i k β€” the maximum number of iterative divisions of edges allowed in force-directed bundling. default is 4. βœ‚οΈ (also "allowd" in the original β€” we keep it, we love it.)
  • -k k β€” how many neighbors to use when forming a nearest neighbor graph. only used in the agglomerative method. default is 10. πŸ«‚
  • -K k β€” a positive real value giving the force constant used in force-directed bundling. by default, the value is determined automatically β€” so you can just vibe and let it cook. 🍳
  • -o file β€” puts output in file. default output is stdout. classic.
  • -p k β€” except for the force-directed method, bundling minimizes $ink * (k - cos(turning angle))$. the larger the value of k, the less emphasis on avoiding sharp turning angles, and the faster the bundling. default value is -1. πŸ“
  • -r k β€” a non-negative integer giving the maximum recursion level used in the agglomerative method. default is 100. πŸͺ†
  • -T fmt β€” specifies the output format. at present, the output is always in the DOT format, so like, manage your expectations. 😌 if fmt is "simple", you get a simple, schematic representation of the drawing β€” only the node positions and edges are retained from the original graph. if fmt is "gv", the drawing information is attached to the input graph. πŸ’Ύ
  • -v k β€” sets the verbose level used for tracing the algorithm. the value k is optional; if you don't provide it, 1 is used. so -v alone totally works. πŸ—£οΈ
  • -? β€” print usage and exit. the "help me help you" of flags. ❓

πŸ’€ BUGS πŸ’€

okay, moment of honesty. at present, mingle does not handle graphs with loops or directed multiedges. so like β€” a graph with edges a -> b and b -> a is acceptable βœ…, but it is not acceptable if it has edges a -> b and a -> b, or a -- b and a -- b. those repeat edges? not the vibe. πŸ™ˆ

fr fr, check your graph before you run this. duplicate edges will not slay. 🚫

πŸ‘‘ AUTHOR πŸ‘‘

Emden R. Gansner <erg@graphviz.org>, Yifan Hu <yifanhu@yahoo.com> β€” legends, honestly. 🫢

🌈 SEE ALSO 🌈

and the reading list, because we're academic AND cute: Emden R. Gansner, Yifan Hu, Stephen C. North and Carlos Scheidegger, ``Multilevel Agglomerative Edge Bundling for Visualizing Large Graphs'', IEEE Pacific Visualization Symposium PacificVis, pp. 187‐194, 2011. πŸ“šβœ¨


okay that's the whole page, you're officially a mingle girlie now πŸ’œ signed off from 16 August 2013 β€” yeah it's vintage, it's archival, it's giving classic. πŸŽ€β­