1MINGLE(1)                   General Commands Manual                  MINGLE(1)
2
3
4
5delim $$
6

NAME

8       mingle - fast edge bundling
9

SYNOPSIS

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

DESCRIPTION

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

OPTIONS

18       The following options are supported:
19
20       -m k   indicates which method to use for bundling. A value of 0  corre‐
21              sponds  to a force-directed bundling.  A value of 2 uses a clus‐
22              ter plus ink saving approach. If available, a value 1 denotes an
23              agglomerative  ink  saving  method.  Normally,  the  last is the
24              default.
25
26       -a k   specifies the maximum turning angle, in degrees, as a  non-nega‐
27              tive  real.   The  larger the value, the more edges may bend. If
28              the value is 0, there is no limitation on the turning angle. The
29              default  is  40.   The  parameter  is not used in force-directed
30              bundling.
31
32       -c v   specifies which compatability measure to use. The value  0,  the
33              default,  uses  a  distance metric, while a value of 1 relies on
34              full compatability. This value is only  used  in  force-directed
35              bundling.
36
37       -i k   gives  the maximum number of iterative divisions of edges allowd
38              in force-directed bundling.  The default is 4.
39
40       -k k   gives the number of neighbors to be used in  forming  a  nearest
41              neighbor graph. This parameter is only used in the agglomerative
42              method. The default is 10.
43
44       -K k   is a positive real value  giving  the  force  constant  used  in
45              force-directed  bundling.  By  default,  the value is determined
46              automatically.
47
48       -o file
49              puts output in file. Default output is stdout
50
51       -p k   Except for the force-directed method, bundling minimizes $ink  *
52              (k  -  cos(turning angle))$. The larger the value of k, the less
53              emphasis is put on avoiding sharp turning angles and the  faster
54              the bundling.  The default value is -1.
55
56       -r k   is  a  non-negative  integer  giving the maximum recursion level
57              used in the agglomerative method. The default is 100.
58
59       -T fmt specifies the output format. At present, the output is always in
60              the  DOT  format.  If  fmt  is "simple", the output is a simple,
61              schematic representation of the drawing. Only the node positions
62              and  edges are retained from the original graph. If fmt is "gv",
63              the drawing information is attached to the input graph.
64
65       -v k   determines the verbose level used for tracing the algorithm. The
66              value k is optional; if not provided, the value 1 is used.
67
68       -?     Print usage and exit.
69
70

BUGS

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

AUTHOR

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

SEE ALSO

80       sfdp(1), neato(1), gvpr(1)
81
82       Emden  R.  Gansner,  Yifan Hu, Stephen C. North and Carlos Scheidegger,
83       ``Multilevel  Agglomerative  Edge  Bundling   for   Visualizing   Large
84       Graphs'', IEEE Pacific Visualization Symposium PacificVis, pp. 187‐194,
85       2011.
86
87
88
89                                16 August 2013                       MINGLE(1)