mingle
fast edge bundling for graphs
TLDR
Bundle edges in a graph and write output
$ mingle -o [output.gv] [input.gv]
Bundle using force-directed method$ mingle -m 0 [input.gv]
Set edge compatibility measure (distance-based)$ mingle -c 0 [input.gv]
Set maximum turning angle in degrees$ mingle -a [40] [input.gv]
Output in simple schematic format$ mingle -T simple -o [output.gv] [input.gv]
Enable verbose tracing$ mingle -v [input.gv]
SYNOPSIS
mingle [options] [file]
DESCRIPTION
mingle performs fast edge bundling on graphs. It reduces visual clutter in dense graph visualizations by grouping similar edges together into bundles.
Part of the Graphviz suite, mingle reads a graph in DOT format and produces output with bundled edges. It supports multiple bundling algorithms including force-directed and agglomerative ink saving methods.
PARAMETERS
-m k
Bundling method: 0 = force-directed, 1 = agglomerative ink saving (default if available), 2 = cluster plus ink saving.-a k
Maximum turning angle in degrees (non-negative real, default 40).-c v
Compatibility measure: 0 = distance (default), 1 = full compatibility. Only used with force-directed bundling.-i k
Maximum iterative divisions in force-directed bundling.-r k
Maximum recursion level for agglomerative method (default 100).-T fmt
Output format: "gv" attaches drawing info to input graph, "simple" outputs schematic representation.-v [k]
Verbose level for tracing (default 1 if no value given).-?
Print usage and exit.
CAVEATS
Part of Graphviz. Output is always in DOT format. May obscure individual edge paths in dense graphs.
