Go to main content

man pages section 1: User Commands

Exit Print View

Updated: Wednesday, February 9, 2022

mingle (1)


mingle - fast edge bundling


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


MINGLE(1)                   General Commands Manual                  MINGLE(1)

delim $$

       mingle - fast edge bundling

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

       mingle takes as input a graph in DOT format with node position informa-
       tion (the pos attribute) and bundles the edges.

       The following options are supported:

       -m k   indicates which method to use for bundling. A value of 0  corre-
              sponds  to a force-directed bundling.  A value of 2 uses a clus-
              ter plus ink saving approach. If available, a value 1 denotes an
              agglomerative  ink  saving  method.  Normally,  the  last is the

       -a k   specifies the maximum turning angle, in degrees, as a  non-nega-
              tive  real.   The  larger the value, the more edges may bend. If
              the value is 0, there is no limitation on the turning angle. The
              default  is  40.   The  parameter  is not used in force-directed

       -c v   specifies which compatability measure to use. The value  0,  the
              default,  uses  a  distance metric, while a value of 1 relies on
              full compatability. This value is only  used  in  force-directed

       -i k   gives  the maximum number of iterative divisions of edges allowd
              in force-directed bundling.  The default is 4.

       -k k   gives the number of neighbors to be used in  forming  a  nearest
              neighbor graph. This parameter is only used in the agglomerative
              method. The default is 10.

       -K k   is a positive real value  giving  the  force  constant  used  in
              force-directed  bundling.  By  default,  the value is determined

       -o file
              puts output in file. Default output is stdout

       -p k   Except for the force-directed method, bundling minimizes $ink  *
              (k  -  cos(turning angle))$. The larger the value of k, the less
              emphasis is put on avoiding sharp turning angles and the  faster
              the bundling.  The default value is -1.

       -r k   is  a  non-negative  integer  giving the maximum recursion level
              used in the agglomerative method. The default is 100.

       -T fmt specifies the output format. At present, the output is always in
              the  DOT  format.  If  fmt  is "simple", the output is 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   determines the verbose level used for tracing the algorithm. The
              value k is optional; if not provided, the value 1 is used.

       -?     Print usage and exit.

       At present, mingle does not handle graphs with loops or directed multi-
       edges. So, a graph with edges a -> b and b -> a is acceptable, but  not
       if it has edges a -> b and a -> b or a -- b and a -- b.

       Emden R. Gansner <erg@graphviz.org>, Yifan Hu <yifanhu@yahoo.com>

       See attributes(7) for descriptions of the following attributes:

       |Availability   | image/graphviz   |
       |Stability      | Volatile         |

       sfdp(1), neato(1), gvpr(1)

       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,

       Source code for open source software components in Oracle  Solaris  can
       be found at https://www.oracle.com/downloads/opensource/solaris-source-

       This    software    was    built    from    source     available     at
       https://github.com/oracle/solaris-userland.    The  original  community
       source was downloaded  from   http://gitlab.com/graphviz/graphviz/-/ar-

       Further information about this software can be found on the open source
       community website at http://www.graphviz.org/.

                                16 August 2013                       MINGLE(1)