@kong-ui-public/documentation 0.4.19 → 0.4.21

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (42) hide show
  1. package/dist/{arc-COsOHw50-C9iRzo98.js → arc-COsOHw50-8b0vvcWq.js} +31 -31
  2. package/dist/{blockDiagram-91b80b7a-BKGTNNj9-DRpDtGmh.js → blockDiagram-91b80b7a-BKGTNNj9-pqE_enew.js} +5 -5
  3. package/dist/{c4Diagram-b2a90758-BL_2KQjG-DzcyQrIW.js → c4Diagram-b2a90758-BL_2KQjG-CDMqw02J.js} +2 -2
  4. package/dist/channel-ByAWxImn-Cm6gPSuY.js +5 -0
  5. package/dist/{classDiagram-30eddba6-k40qxgte-CwcMszjH.js → classDiagram-30eddba6-k40qxgte-BjlY99VJ.js} +5 -5
  6. package/dist/{classDiagram-v2-f2df5561-Bhszhjj1-DDKkcKs5.js → classDiagram-v2-f2df5561-Bhszhjj1-BXjyowVF.js} +5 -5
  7. package/dist/{clone-B9jLUWz8-D8JWw9w8.js → clone-B9jLUWz8-B_0rcCoo.js} +1 -1
  8. package/dist/{createText-6b48ae7d-CwDinsnJ-Cu8l2Npn.js → createText-6b48ae7d-CwDinsnJ-DaXMLq6o.js} +2 -2
  9. package/dist/documentation.es.js +4 -4
  10. package/dist/documentation.umd.js +76 -76
  11. package/dist/{edges-d32062c0-D81gGEnb-Dx3zO_em.js → edges-d32062c0-D81gGEnb-Dz0apkQG.js} +45 -45
  12. package/dist/{erDiagram-47591fe2-Ct0H1qRr-BT1e4kcz.js → erDiagram-47591fe2-Ct0H1qRr-CfxVZWGk.js} +4 -4
  13. package/dist/{flowDb-4b19a42f-DUQIsrJ6-Cx4J0SDV.js → flowDb-4b19a42f-DUQIsrJ6-BZeyLbaL.js} +1 -1
  14. package/dist/{flowDiagram-5540d9b9-lDK0hXfd-B7nTp1Ow.js → flowDiagram-5540d9b9-lDK0hXfd-DSlzf5Zs.js} +6 -6
  15. package/dist/{flowDiagram-v2-3b53844e-C-MZcHj1-CRI7-nX2.js → flowDiagram-v2-3b53844e-C-MZcHj1-DRuOUcaX.js} +5 -5
  16. package/dist/{flowchart-elk-definition-5fe447d6-Cl1YzK8W-DUtzoI95.js → flowchart-elk-definition-5fe447d6-Cl1YzK8W-Bn6CXlME.js} +4470 -4459
  17. package/dist/{ganttDiagram-9a3bba1f-DgegevHg-Dnd48qsT.js → ganttDiagram-9a3bba1f-DgegevHg-FjtZIgs3.js} +2 -2
  18. package/dist/{gitGraphDiagram-96e6b4ee-B544kZVD-Ds9cICFs.js → gitGraphDiagram-96e6b4ee-B544kZVD-DS3U7u7x.js} +1 -1
  19. package/dist/{graph-nSQNMZNt-1Zx0M3uO.js → graph-nSQNMZNt-WwQ66jlk.js} +226 -216
  20. package/dist/{index-xwCd1OzE.js → index-B2yqGQ7M.js} +101 -94
  21. package/dist/{index-fc10efb0-BQFKNTyl-BdJOA2P3.js → index-fc10efb0-BQFKNTyl-DcfuI7jC.js} +6 -6
  22. package/dist/{infoDiagram-bcd20f53-DA00HiLo-DzCdMjzM.js → infoDiagram-bcd20f53-DA00HiLo-DGWjVZk3.js} +12 -12
  23. package/dist/{journeyDiagram-4fe6b3dc-Dy2VexAM-Bg-KZCAV.js → journeyDiagram-4fe6b3dc-Dy2VexAM-BH-dvv4G.js} +50 -50
  24. package/dist/{layout-CsrWmvDo-v2_rFy6R.js → layout-CsrWmvDo-DWZkjCNe.js} +331 -321
  25. package/dist/{line-_Hv2N8bu-DrMVavBT.js → line-_Hv2N8bu-f1gyQCDH.js} +1 -1
  26. package/dist/{linear-Bq62Qb31-Bjior_ce.js → linear-Bq62Qb31-ng9-yWgD.js} +35 -35
  27. package/dist/{mindmap-definition-f354de21-6GdeE-da-pTppd7Xw.js → mindmap-definition-f354de21-6GdeE-da-rihm8Sdq.js} +432 -432
  28. package/dist/{pieDiagram-79897490--sueuFsN-CypYOMk7.js → pieDiagram-79897490--sueuFsN-CYUjBaRR.js} +12 -12
  29. package/dist/{quadrantDiagram-62f64e94-B45V10Ws-DdADLB2x.js → quadrantDiagram-62f64e94-B45V10Ws-6IK0wm6a.js} +2 -2
  30. package/dist/{requirementDiagram-05bf5f74-DKrzFj3--CY2rfWob.js → requirementDiagram-05bf5f74-DKrzFj3--_AWsFotz.js} +4 -4
  31. package/dist/{sankeyDiagram-97764748-Cal39XvH-vpwLqAXQ.js → sankeyDiagram-97764748-Cal39XvH-mcOTDG5E.js} +1 -1
  32. package/dist/{sequenceDiagram-acc0e65c-C7SBKcFC-D6wvY-06.js → sequenceDiagram-acc0e65c-C7SBKcFC-Cg_BNnXE.js} +290 -290
  33. package/dist/{stateDiagram-0ff1cf1a-CeTkJw-0-Di3fo0N3.js → stateDiagram-0ff1cf1a-CeTkJw-0-BMASGNWc.js} +5 -5
  34. package/dist/{stateDiagram-v2-9a9d610d-B6v4YFRe-BGfo9HO9.js → stateDiagram-v2-9a9d610d-B6v4YFRe-D_tcA6wS.js} +5 -5
  35. package/dist/{styles-3ed67cfa-BKhmbt4H-C_loWuBL.js → styles-3ed67cfa-BKhmbt4H-abIa6vZU.js} +4 -4
  36. package/dist/{styles-991ebdfc-D52vcIGN-DvArqWeB.js → styles-991ebdfc-D52vcIGN-CLTEdyii.js} +1 -1
  37. package/dist/{styles-d20c7d72-0tQ-upPv-DY7ACpcb.js → styles-d20c7d72-0tQ-upPv-DaojUxDU.js} +1 -1
  38. package/dist/{svgDrawCommon-5ccd53ef-CUtig_WQ-DhwwSpmA.js → svgDrawCommon-5ccd53ef-CUtig_WQ-CF530_Cl.js} +1 -1
  39. package/dist/{timeline-definition-fea2a41d-DMC1sAGv-C0IHxruF.js → timeline-definition-fea2a41d-DMC1sAGv-DCM5EaJv.js} +2 -2
  40. package/dist/{xychartDiagram-ab372869-BsavOqc0-D2H7T7LH.js → xychartDiagram-ab372869-BsavOqc0-DP2IGmLs.js} +12 -12
  41. package/package.json +3 -3
  42. package/dist/channel-ByAWxImn-BzW5YEfX.js +0 -5
@@ -1,17 +1,17 @@
1
- import { S as we, $ as S, e as De, C as be, Y as I, I as ye, a as ze, U as Ue, Q as P, b as Qe, m as f, E as p, Z as y, c as xe, d as b, H as E, K as q, j as We, x as ke, D as $, T as Ze, f as Je } from "./graph-nSQNMZNt-1Zx0M3uO.js";
2
- import { D as Ee, ab as V, a4 as Ne, a8 as Ke, ac as Xe, ad as He, I as J, L as Ie, G as K, a7 as er, U as G, W as rr, a0 as _e, ae as W, af as tr, a2 as nr, J as or } from "./index-xwCd1OzE.js";
3
- var ir = /\s/;
4
- function ur(e) {
5
- for (var r = e.length; r-- && ir.test(e.charAt(r)); )
1
+ import { S as be, $ as S, e as ze, C as ye, Y as I, I as xe, a as Ue, U as Qe, Q as P, m as f, Z as y, b as ke, c as We, d as b, E as p, H as E, K as q, j as Ze, x as Ee, D as $, T as Je, f as Ke } from "./graph-nSQNMZNt-WwQ66jlk.js";
2
+ import { D as Ne, ab as V, a4 as Ie, a8 as Xe, ac as He, ad as er, I as J, L as _e, G as K, a7 as rr, U as G, W as tr, a0 as Re, ae as W, af as nr, ag as or, a2 as ir, J as ur } from "./index-B2yqGQ7M.js";
3
+ var ar = /\s/;
4
+ function dr(e) {
5
+ for (var r = e.length; r-- && ar.test(e.charAt(r)); )
6
6
  ;
7
7
  return r;
8
8
  }
9
- var ar = /^\s+/;
10
- function dr(e) {
11
- return e && e.slice(0, ur(e) + 1).replace(ar, "");
9
+ var cr = /^\s+/;
10
+ function fr(e) {
11
+ return e && e.slice(0, dr(e) + 1).replace(cr, "");
12
12
  }
13
- var ue = NaN, cr = /^[-+]0x[0-9a-f]+$/i, fr = /^0b[01]+$/i, sr = /^0o[0-7]+$/i, vr = parseInt;
14
- function gr(e) {
13
+ var ue = NaN, sr = /^[-+]0x[0-9a-f]+$/i, vr = /^0b[01]+$/i, gr = /^0o[0-7]+$/i, hr = parseInt;
14
+ function lr(e) {
15
15
  if (typeof e == "number")
16
16
  return e;
17
17
  if (P(e))
@@ -22,56 +22,58 @@ function gr(e) {
22
22
  }
23
23
  if (typeof e != "string")
24
24
  return e === 0 ? e : +e;
25
- e = dr(e);
26
- var t = fr.test(e);
27
- return t || sr.test(e) ? vr(e.slice(2), t ? 2 : 8) : cr.test(e) ? ue : +e;
25
+ e = fr(e);
26
+ var t = vr.test(e);
27
+ return t || gr.test(e) ? hr(e.slice(2), t ? 2 : 8) : sr.test(e) ? ue : +e;
28
28
  }
29
- var ae = 1 / 0, hr = 17976931348623157e292;
29
+ var ae = 1 / 0, pr = 17976931348623157e292;
30
30
  function O(e) {
31
31
  if (!e)
32
32
  return e === 0 ? e : 0;
33
- if (e = gr(e), e === ae || e === -ae) {
33
+ if (e = lr(e), e === ae || e === -ae) {
34
34
  var r = e < 0 ? -1 : 1;
35
- return r * hr;
35
+ return r * pr;
36
36
  }
37
37
  return e === e ? e : 0;
38
38
  }
39
- function lr(e) {
39
+ function mr(e) {
40
40
  var r = O(e), t = r % 1;
41
41
  return r === r ? t ? r - t : r : 0;
42
42
  }
43
43
  function _(e) {
44
44
  var r = e == null ? 0 : e.length;
45
- return r ? we(e) : [];
45
+ return r ? be(e, 1) : [];
46
46
  }
47
- function pr(e) {
48
- return Xe(He(e, void 0, _), e + "");
47
+ function wr(e) {
48
+ return He(er(e, void 0, _), e + "");
49
49
  }
50
- var mr = 1, wr = 4;
51
- function br(e) {
52
- return We(e, mr | wr);
50
+ var br = 1, yr = 4;
51
+ function xr(e) {
52
+ return Ze(e, br | yr);
53
53
  }
54
- var Re = Object.prototype, yr = Re.hasOwnProperty, xr = Ee(function(e, r) {
54
+ var de = function() {
55
+ return nr.Date.now();
56
+ }, Te = Object.prototype, kr = Te.hasOwnProperty, Er = Ne(function(e, r) {
55
57
  e = Object(e);
56
58
  var t = -1, n = r.length, o = n > 2 ? r[2] : void 0;
57
59
  for (o && V(r[0], r[1], o) && (n = 1); ++t < n; )
58
- for (var u = r[t], i = Ne(u), a = -1, d = i.length; ++a < d; ) {
60
+ for (var u = r[t], i = Ie(u), a = -1, d = i.length; ++a < d; ) {
59
61
  var c = i[a], s = e[c];
60
- (s === void 0 || Ke(s, Re[c]) && !yr.call(e, c)) && (e[c] = u[c]);
62
+ (s === void 0 || Xe(s, Te[c]) && !kr.call(e, c)) && (e[c] = u[c]);
61
63
  }
62
64
  return e;
63
65
  });
64
- const kr = xr;
66
+ const Nr = Er;
65
67
  function j(e) {
66
68
  var r = e == null ? 0 : e.length;
67
69
  return r ? e[r - 1] : void 0;
68
70
  }
69
- function Er(e) {
71
+ function Ir(e) {
70
72
  return function(r, t, n) {
71
73
  var o = Object(r);
72
- if (!Ie(r)) {
74
+ if (!_e(r)) {
73
75
  var u = I(t);
74
- r = Ze(r), t = function(a) {
76
+ r = Je(r), t = function(a) {
75
77
  return u(o[a], a, o);
76
78
  };
77
79
  }
@@ -79,41 +81,41 @@ function Er(e) {
79
81
  return i > -1 ? o[u ? r[i] : i] : void 0;
80
82
  };
81
83
  }
82
- var Nr = Math.max;
83
- function Ir(e, r, t) {
84
+ var _r = Math.max;
85
+ function Rr(e, r, t) {
84
86
  var n = e == null ? 0 : e.length;
85
87
  if (!n)
86
88
  return -1;
87
- var o = t == null ? 0 : lr(t);
88
- return o < 0 && (o = Nr(n + o, 0)), Je(e, I(r), o);
89
+ var o = t == null ? 0 : mr(t);
90
+ return o < 0 && (o = _r(n + o, 0)), Ke(e, I(r), o);
89
91
  }
90
- var X = Er(Ir);
91
- function Te(e, r) {
92
- var t = -1, n = Ie(e) ? Array(e.length) : [];
93
- return De(e, function(o, u, i) {
92
+ var X = Ir(Rr);
93
+ function Me(e, r) {
94
+ var t = -1, n = _e(e) ? Array(e.length) : [];
95
+ return ze(e, function(o, u, i) {
94
96
  n[++t] = r(o, u, i);
95
97
  }), n;
96
98
  }
97
99
  function m(e, r) {
98
- var t = K(e) ? S : Te;
100
+ var t = K(e) ? S : Me;
99
101
  return t(e, I(r));
100
102
  }
101
- function _r(e, r) {
102
- return e == null ? e : nr(e, ke(r), Ne);
103
+ function Tr(e, r) {
104
+ return e == null ? e : ir(e, Ee(r), Ie);
103
105
  }
104
- function Rr(e, r) {
105
- return e && xe(e, ke(r));
106
+ function Mr(e, r) {
107
+ return e && ke(e, Ee(r));
106
108
  }
107
- function Tr(e, r) {
109
+ function Lr(e, r) {
108
110
  return e > r;
109
111
  }
110
- function Me(e, r) {
112
+ function Le(e, r) {
111
113
  return e < r;
112
114
  }
113
115
  function A(e, r) {
114
116
  var t = {};
115
- return r = I(r), xe(e, function(n, o, u) {
116
- tr(t, o, r(n, o, u));
117
+ return r = I(r), ke(e, function(n, o, u) {
118
+ or(t, o, r(n, o, u));
117
119
  }), t;
118
120
  }
119
121
  function H(e, r, t) {
@@ -125,44 +127,44 @@ function H(e, r, t) {
125
127
  return d;
126
128
  }
127
129
  function x(e) {
128
- return e && e.length ? H(e, J, Tr) : void 0;
130
+ return e && e.length ? H(e, J, Lr) : void 0;
129
131
  }
130
132
  function M(e) {
131
- return e && e.length ? H(e, J, Me) : void 0;
133
+ return e && e.length ? H(e, J, Le) : void 0;
132
134
  }
133
135
  function ee(e, r) {
134
- return e && e.length ? H(e, I(r), Me) : void 0;
136
+ return e && e.length ? H(e, I(r), Le) : void 0;
135
137
  }
136
- function Mr(e, r, t, n) {
138
+ function $r(e, r, t, n) {
137
139
  if (!G(e))
138
140
  return e;
139
- r = ye(r, e);
141
+ r = xe(r, e);
140
142
  for (var o = -1, u = r.length, i = u - 1, a = e; a != null && ++o < u; ) {
141
- var d = Ue(r[o]), c = t;
143
+ var d = Qe(r[o]), c = t;
142
144
  if (d === "__proto__" || d === "constructor" || d === "prototype")
143
145
  return e;
144
146
  if (o != i) {
145
147
  var s = a[d];
146
- c = void 0, c === void 0 && (c = G(s) ? s : rr(r[o + 1]) ? [] : {});
148
+ c = n ? n(s, d, a) : void 0, c === void 0 && (c = G(s) ? s : tr(r[o + 1]) ? [] : {});
147
149
  }
148
- _e(a, d, c), a = a[d];
150
+ Re(a, d, c), a = a[d];
149
151
  }
150
152
  return e;
151
153
  }
152
- function Lr(e, r, t) {
154
+ function Cr(e, r, t) {
153
155
  for (var n = -1, o = r.length, u = {}; ++n < o; ) {
154
- var i = r[n], a = be(e, i);
155
- t(a, i) && Mr(u, ye(i, e), a);
156
+ var i = r[n], a = ye(e, i);
157
+ t(a, i) && $r(u, xe(i, e), a);
156
158
  }
157
159
  return u;
158
160
  }
159
- function $r(e, r) {
161
+ function Sr(e, r) {
160
162
  var t = e.length;
161
163
  for (e.sort(r); t--; )
162
164
  e[t] = e[t].value;
163
165
  return e;
164
166
  }
165
- function Cr(e, r) {
167
+ function Or(e, r) {
166
168
  if (e !== r) {
167
169
  var t = e !== void 0, n = e === null, o = e === e, u = P(e), i = r !== void 0, a = r === null, d = r === r, c = P(r);
168
170
  if (!a && !c && !u && e > r || u && i && d && !a && !c || n && i && d || !t && d || !o)
@@ -172,9 +174,9 @@ function Cr(e, r) {
172
174
  }
173
175
  return 0;
174
176
  }
175
- function Sr(e, r, t) {
177
+ function Pr(e, r, t) {
176
178
  for (var n = -1, o = e.criteria, u = r.criteria, i = o.length, a = t.length; ++n < i; ) {
177
- var d = Cr(o[n], u[n]);
179
+ var d = Or(o[n], u[n]);
178
180
  if (d) {
179
181
  if (n >= a)
180
182
  return d;
@@ -184,63 +186,63 @@ function Sr(e, r, t) {
184
186
  }
185
187
  return e.index - r.index;
186
188
  }
187
- function Or(e, r, t) {
189
+ function Vr(e, r, t) {
188
190
  r.length ? r = S(r, function(u) {
189
191
  return K(u) ? function(i) {
190
- return be(i, u.length === 1 ? u[0] : u);
192
+ return ye(i, u.length === 1 ? u[0] : u);
191
193
  } : u;
192
194
  }) : r = [J];
193
195
  var n = -1;
194
- r = S(r, er(I));
195
- var o = Te(e, function(u, i, a) {
196
+ r = S(r, rr(I));
197
+ var o = Me(e, function(u, i, a) {
196
198
  var d = S(r, function(c) {
197
199
  return c(u);
198
200
  });
199
201
  return { criteria: d, index: ++n, value: u };
200
202
  });
201
- return $r(o, function(u, i) {
202
- return Sr(u, i, t);
203
+ return Sr(o, function(u, i) {
204
+ return Pr(u, i, t);
203
205
  });
204
206
  }
205
- function Pr(e, r) {
206
- return Lr(e, r, function(t, n) {
207
- return ze(e, n);
207
+ function Gr(e, r) {
208
+ return Cr(e, r, function(t, n) {
209
+ return Ue(e, n);
208
210
  });
209
211
  }
210
- var F = pr(function(e, r) {
211
- return e == null ? {} : Pr(e, r);
212
- }), Vr = Math.ceil, Gr = Math.max;
213
- function jr(e, r, t, n) {
214
- for (var o = -1, u = Gr(Vr((r - e) / (t || 1)), 0), i = Array(u); u--; )
215
- i[++o] = e, e += t;
212
+ var F = wr(function(e, r) {
213
+ return e == null ? {} : Gr(e, r);
214
+ }), jr = Math.ceil, Fr = Math.max;
215
+ function qr(e, r, t, n) {
216
+ for (var o = -1, u = Fr(jr((r - e) / (t || 1)), 0), i = Array(u); u--; )
217
+ i[n ? u : ++o] = e, e += t;
216
218
  return i;
217
219
  }
218
- function Fr(e) {
220
+ function Ar(e) {
219
221
  return function(r, t, n) {
220
- return n && typeof n != "number" && V(r, t, n) && (t = n = void 0), r = O(r), t === void 0 ? (t = r, r = 0) : t = O(t), n = n === void 0 ? r < t ? 1 : -1 : O(n), jr(r, t, n);
222
+ return n && typeof n != "number" && V(r, t, n) && (t = n = void 0), r = O(r), t === void 0 ? (t = r, r = 0) : t = O(t), n = n === void 0 ? r < t ? 1 : -1 : O(n), qr(r, t, n, e);
221
223
  };
222
224
  }
223
- var N = Fr(), C = Ee(function(e, r) {
225
+ var N = Ar(), C = Ne(function(e, r) {
224
226
  if (e == null)
225
227
  return [];
226
228
  var t = r.length;
227
- return t > 1 && V(e, r[0], r[1]) ? r = [] : t > 2 && V(r[0], r[1], r[2]) && (r = [r[0]]), Or(e, we(r), []);
228
- }), qr = 0;
229
+ return t > 1 && V(e, r[0], r[1]) ? r = [] : t > 2 && V(r[0], r[1], r[2]) && (r = [r[0]]), Vr(e, be(r, 1), []);
230
+ }), Yr = 0;
229
231
  function re(e) {
230
- var r = ++qr;
231
- return Qe(e) + r;
232
+ var r = ++Yr;
233
+ return We(e) + r;
232
234
  }
233
- function Ar(e, r, t) {
235
+ function Br(e, r, t) {
234
236
  for (var n = -1, o = e.length, u = r.length, i = {}; ++n < o; ) {
235
237
  var a = n < u ? r[n] : void 0;
236
238
  t(i, e[n], a);
237
239
  }
238
240
  return i;
239
241
  }
240
- function Yr(e, r) {
241
- return Ar(e || [], r || [], _e);
242
+ function Dr(e, r) {
243
+ return Br(e || [], r || [], Re);
242
244
  }
243
- class Br {
245
+ class zr {
244
246
  constructor() {
245
247
  var r = {};
246
248
  r._next = r._prev = r, this._sentinel = r;
@@ -248,37 +250,37 @@ class Br {
248
250
  dequeue() {
249
251
  var r = this._sentinel, t = r._prev;
250
252
  if (t !== r)
251
- return de(t), t;
253
+ return ce(t), t;
252
254
  }
253
255
  enqueue(r) {
254
256
  var t = this._sentinel;
255
- r._prev && r._next && de(r), r._next = t._next, t._next._prev = r, t._next = r, r._prev = t;
257
+ r._prev && r._next && ce(r), r._next = t._next, t._next._prev = r, t._next = r, r._prev = t;
256
258
  }
257
259
  toString() {
258
260
  for (var r = [], t = this._sentinel, n = t._prev; n !== t; )
259
- r.push(JSON.stringify(n, Dr)), n = n._prev;
261
+ r.push(JSON.stringify(n, Ur)), n = n._prev;
260
262
  return "[" + r.join(", ") + "]";
261
263
  }
262
264
  }
263
- function de(e) {
265
+ function ce(e) {
264
266
  e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
265
267
  }
266
- function Dr(e, r) {
268
+ function Ur(e, r) {
267
269
  if (e !== "_next" && e !== "_prev")
268
270
  return r;
269
271
  }
270
- var zr = or(1);
271
- function Ur(e, r) {
272
+ var Qr = ur(1);
273
+ function Wr(e, r) {
272
274
  if (e.nodeCount() <= 1)
273
275
  return [];
274
- var t = Wr(e, r || zr), n = Qr(t.graph, t.buckets, t.zeroIdx);
276
+ var t = Jr(e, r || Qr), n = Zr(t.graph, t.buckets, t.zeroIdx);
275
277
  return _(
276
278
  m(n, function(o) {
277
279
  return e.outEdges(o.v, o.w);
278
280
  })
279
281
  );
280
282
  }
281
- function Qr(e, r, t) {
283
+ function Zr(e, r, t) {
282
284
  for (var n = [], o = r[r.length - 1], u = r[0], i; e.nodeCount(); ) {
283
285
  for (; i = u.dequeue(); )
284
286
  B(e, r, t, i);
@@ -304,7 +306,7 @@ function B(e, r, t, n, o) {
304
306
  c.in -= a, Z(r, t, c);
305
307
  }), e.removeNode(n.v), u;
306
308
  }
307
- function Wr(e, r) {
309
+ function Jr(e, r) {
308
310
  var t = new y(), n = 0, o = 0;
309
311
  f(e.nodes(), function(a) {
310
312
  t.setNode(a, { v: a, in: 0, out: 0 });
@@ -313,7 +315,7 @@ function Wr(e, r) {
313
315
  t.setEdge(a.v, a.w, s), o = Math.max(o, t.node(a.v).out += c), n = Math.max(n, t.node(a.w).in += c);
314
316
  });
315
317
  var u = N(o + n + 3).map(function() {
316
- return new Br();
318
+ return new zr();
317
319
  }), i = n + 1;
318
320
  return f(t.nodes(), function(a) {
319
321
  Z(u, i, t.node(a));
@@ -322,8 +324,8 @@ function Wr(e, r) {
322
324
  function Z(e, r, t) {
323
325
  t.out ? t.in ? e[t.out - t.in + r].enqueue(t) : e[e.length - 1].enqueue(t) : e[0].enqueue(t);
324
326
  }
325
- function Zr(e) {
326
- var r = e.graph().acyclicer === "greedy" ? Ur(e, t(e)) : Jr(e);
327
+ function Kr(e) {
328
+ var r = e.graph().acyclicer === "greedy" ? Wr(e, t(e)) : Xr(e);
327
329
  f(r, function(n) {
328
330
  var o = e.edge(n);
329
331
  e.removeEdge(n), o.forwardName = n.name, o.reversed = !0, e.setEdge(n.w, n.v, o, re("rev"));
@@ -334,7 +336,7 @@ function Zr(e) {
334
336
  };
335
337
  }
336
338
  }
337
- function Jr(e) {
339
+ function Xr(e) {
338
340
  var r = [], t = {}, n = {};
339
341
  function o(u) {
340
342
  p(n, u) || (n[u] = !0, t[u] = !0, f(e.outEdges(u), function(i) {
@@ -343,7 +345,7 @@ function Jr(e) {
343
345
  }
344
346
  return f(e.nodes(), o), r;
345
347
  }
346
- function Kr(e) {
348
+ function Hr(e) {
347
349
  f(e.edges(), function(r) {
348
350
  var t = e.edge(r);
349
351
  if (t.reversed) {
@@ -360,7 +362,7 @@ function R(e, r, t, n) {
360
362
  while (e.hasNode(o));
361
363
  return t.dummy = r, e.setNode(o, t), o;
362
364
  }
363
- function Xr(e) {
365
+ function et(e) {
364
366
  var r = new y().setGraph(e.graph());
365
367
  return f(e.nodes(), function(t) {
366
368
  r.setNode(t, e.node(t));
@@ -372,7 +374,7 @@ function Xr(e) {
372
374
  });
373
375
  }), r;
374
376
  }
375
- function Le(e) {
377
+ function $e(e) {
376
378
  var r = new y({ multigraph: e.isMultigraph() }).setGraph(e.graph());
377
379
  return f(e.nodes(), function(t) {
378
380
  e.children(t).length || r.setNode(t, e.node(t));
@@ -380,7 +382,7 @@ function Le(e) {
380
382
  r.setEdge(t, e.edge(t));
381
383
  }), r;
382
384
  }
383
- function ce(e, r) {
385
+ function fe(e, r) {
384
386
  var t = e.x, n = e.y, o = r.x - t, u = r.y - n, i = e.width / 2, a = e.height / 2;
385
387
  if (!o && !u)
386
388
  throw new Error("Not possible to find intersection inside of the rectangle");
@@ -388,7 +390,7 @@ function ce(e, r) {
388
390
  return Math.abs(u) * i > Math.abs(o) * a ? (u < 0 && (a = -a), d = a * o / u, c = a) : (o < 0 && (i = -i), d = i, c = i * u / o), { x: t + d, y: n + c };
389
391
  }
390
392
  function Y(e) {
391
- var r = m(N($e(e) + 1), function() {
393
+ var r = m(N(Ce(e) + 1), function() {
392
394
  return [];
393
395
  });
394
396
  return f(e.nodes(), function(t) {
@@ -396,7 +398,7 @@ function Y(e) {
396
398
  b(o) || (r[o][n.order] = t);
397
399
  }), r;
398
400
  }
399
- function Hr(e) {
401
+ function rt(e) {
400
402
  var r = M(
401
403
  m(e.nodes(), function(t) {
402
404
  return e.node(t).rank;
@@ -407,7 +409,7 @@ function Hr(e) {
407
409
  p(n, "rank") && (n.rank -= r);
408
410
  });
409
411
  }
410
- function et(e) {
412
+ function tt(e) {
411
413
  var r = M(
412
414
  m(e.nodes(), function(u) {
413
415
  return e.node(u).rank;
@@ -424,14 +426,14 @@ function et(e) {
424
426
  });
425
427
  });
426
428
  }
427
- function fe(e, r, t, n) {
429
+ function se(e, r, t, n) {
428
430
  var o = {
429
431
  width: 0,
430
432
  height: 0
431
433
  };
432
434
  return arguments.length >= 4 && (o.rank = t, o.order = n), R(e, "border", o, r);
433
435
  }
434
- function $e(e) {
436
+ function Ce(e) {
435
437
  return x(
436
438
  m(e.nodes(), function(r) {
437
439
  var t = e.node(r).rank;
@@ -440,50 +442,58 @@ function $e(e) {
440
442
  })
441
443
  );
442
444
  }
443
- function rt(e, r) {
445
+ function nt(e, r) {
444
446
  var t = { lhs: [], rhs: [] };
445
447
  return f(e, function(n) {
446
448
  r(n) ? t.lhs.push(n) : t.rhs.push(n);
447
449
  }), t;
448
450
  }
449
- function tt(e, r) {
451
+ function ot(e, r) {
452
+ var t = de();
453
+ try {
454
+ return r();
455
+ } finally {
456
+ console.log(e + " time: " + (de() - t) + "ms");
457
+ }
458
+ }
459
+ function it(e, r) {
450
460
  return r();
451
461
  }
452
- function nt(e) {
462
+ function ut(e) {
453
463
  function r(t) {
454
464
  var n = e.children(t), o = e.node(t);
455
465
  if (n.length && f(n, r), p(o, "minRank")) {
456
466
  o.borderLeft = [], o.borderRight = [];
457
467
  for (var u = o.minRank, i = o.maxRank + 1; u < i; ++u)
458
- se(e, "borderLeft", "_bl", t, o, u), se(e, "borderRight", "_br", t, o, u);
468
+ ve(e, "borderLeft", "_bl", t, o, u), ve(e, "borderRight", "_br", t, o, u);
459
469
  }
460
470
  }
461
471
  f(e.children(), r);
462
472
  }
463
- function se(e, r, t, n, o, u) {
473
+ function ve(e, r, t, n, o, u) {
464
474
  var i = { width: 0, height: 0, rank: u, borderType: r }, a = o[r][u - 1], d = R(e, "border", i, t);
465
475
  o[r][u] = d, e.setParent(d, n), a && e.setEdge(a, d, { weight: 1 });
466
476
  }
467
- function ot(e) {
477
+ function at(e) {
468
478
  var r = e.graph().rankdir.toLowerCase();
469
- (r === "lr" || r === "rl") && Ce(e);
479
+ (r === "lr" || r === "rl") && Se(e);
470
480
  }
471
- function it(e) {
481
+ function dt(e) {
472
482
  var r = e.graph().rankdir.toLowerCase();
473
- (r === "bt" || r === "rl") && ut(e), (r === "lr" || r === "rl") && (at(e), Ce(e));
483
+ (r === "bt" || r === "rl") && ct(e), (r === "lr" || r === "rl") && (ft(e), Se(e));
474
484
  }
475
- function Ce(e) {
485
+ function Se(e) {
476
486
  f(e.nodes(), function(r) {
477
- ve(e.node(r));
487
+ ge(e.node(r));
478
488
  }), f(e.edges(), function(r) {
479
- ve(e.edge(r));
489
+ ge(e.edge(r));
480
490
  });
481
491
  }
482
- function ve(e) {
492
+ function ge(e) {
483
493
  var r = e.width;
484
494
  e.width = e.height, e.height = r;
485
495
  }
486
- function ut(e) {
496
+ function ct(e) {
487
497
  f(e.nodes(), function(r) {
488
498
  D(e.node(r));
489
499
  }), f(e.edges(), function(r) {
@@ -494,7 +504,7 @@ function ut(e) {
494
504
  function D(e) {
495
505
  e.y = -e.y;
496
506
  }
497
- function at(e) {
507
+ function ft(e) {
498
508
  f(e.nodes(), function(r) {
499
509
  z(e.node(r));
500
510
  }), f(e.edges(), function(r) {
@@ -506,12 +516,12 @@ function z(e) {
506
516
  var r = e.x;
507
517
  e.x = e.y, e.y = r;
508
518
  }
509
- function dt(e) {
519
+ function st(e) {
510
520
  e.graph().dummyChains = [], f(e.edges(), function(r) {
511
- ct(e, r);
521
+ vt(e, r);
512
522
  });
513
523
  }
514
- function ct(e, r) {
524
+ function vt(e, r) {
515
525
  var t = r.v, n = e.node(t).rank, o = r.w, u = e.node(o).rank, i = r.name, a = e.edge(r), d = a.labelRank;
516
526
  if (u !== n + 1) {
517
527
  e.removeEdge(r);
@@ -527,7 +537,7 @@ function ct(e, r) {
527
537
  e.setEdge(t, o, { weight: a.weight }, i);
528
538
  }
529
539
  }
530
- function ft(e) {
540
+ function gt(e) {
531
541
  f(e.graph().dummyChains, function(r) {
532
542
  var t = e.node(r), n = t.edgeLabel, o;
533
543
  for (e.setEdge(t.edgeObj, n); t.dummy; )
@@ -555,14 +565,14 @@ function te(e) {
555
565
  function L(e, r) {
556
566
  return e.node(r.w).rank - e.node(r.v).rank - e.edge(r).minlen;
557
567
  }
558
- function Se(e) {
568
+ function Oe(e) {
559
569
  var r = new y({ directed: !1 }), t = e.nodes()[0], n = e.nodeCount();
560
570
  r.setNode(t, {});
561
- for (var o, u; st(r, e) < n; )
562
- o = vt(r, e), u = r.hasNode(o.v) ? L(e, o) : -L(e, o), gt(r, e, u);
571
+ for (var o, u; ht(r, e) < n; )
572
+ o = lt(r, e), u = r.hasNode(o.v) ? L(e, o) : -L(e, o), pt(r, e, u);
563
573
  return r;
564
574
  }
565
- function st(e, r) {
575
+ function ht(e, r) {
566
576
  function t(n) {
567
577
  f(r.nodeEdges(n), function(o) {
568
578
  var u = o.v, i = n === u ? o.w : u;
@@ -571,67 +581,67 @@ function st(e, r) {
571
581
  }
572
582
  return f(e.nodes(), t), e.nodeCount();
573
583
  }
574
- function vt(e, r) {
584
+ function lt(e, r) {
575
585
  return ee(r.edges(), function(t) {
576
586
  if (e.hasNode(t.v) !== e.hasNode(t.w))
577
587
  return L(r, t);
578
588
  });
579
589
  }
580
- function gt(e, r, t) {
590
+ function pt(e, r, t) {
581
591
  f(e.nodes(), function(n) {
582
592
  r.node(n).rank += t;
583
593
  });
584
594
  }
585
- function Oe(e, r, t) {
595
+ function Pe(e, r, t) {
586
596
  K(r) || (r = [r]);
587
597
  var n = (e.isDirected() ? e.successors : e.neighbors).bind(e), o = [], u = {};
588
598
  return f(r, function(i) {
589
599
  if (!e.hasNode(i))
590
600
  throw new Error("Graph does not have node: " + i);
591
- Pe(e, i, t === "post", u, n, o);
601
+ Ve(e, i, t === "post", u, n, o);
592
602
  }), o;
593
603
  }
594
- function Pe(e, r, t, n, o, u) {
604
+ function Ve(e, r, t, n, o, u) {
595
605
  p(n, r) || (n[r] = !0, t || u.push(r), f(o(r), function(i) {
596
- Pe(e, i, t, n, o, u);
606
+ Ve(e, i, t, n, o, u);
597
607
  }), t && u.push(r));
598
608
  }
599
- function ht(e, r) {
600
- return Oe(e, r, "post");
609
+ function mt(e, r) {
610
+ return Pe(e, r, "post");
601
611
  }
602
- function lt(e, r) {
603
- return Oe(e, r, "pre");
612
+ function wt(e, r) {
613
+ return Pe(e, r, "pre");
604
614
  }
605
615
  k.initLowLimValues = oe;
606
616
  k.initCutValues = ne;
607
- k.calcCutValue = Ve;
608
- k.leaveEdge = je;
609
- k.enterEdge = Fe;
610
- k.exchangeEdges = qe;
617
+ k.calcCutValue = Ge;
618
+ k.leaveEdge = Fe;
619
+ k.enterEdge = qe;
620
+ k.exchangeEdges = Ae;
611
621
  function k(e) {
612
- e = Xr(e), te(e);
613
- var r = Se(e);
622
+ e = et(e), te(e);
623
+ var r = Oe(e);
614
624
  oe(r), ne(r, e);
615
- for (var t, n; t = je(r); )
616
- n = Fe(r, e, t), qe(r, e, t, n);
625
+ for (var t, n; t = Fe(r); )
626
+ n = qe(r, e, t), Ae(r, e, t, n);
617
627
  }
618
628
  function ne(e, r) {
619
- var t = ht(e, e.nodes());
629
+ var t = mt(e, e.nodes());
620
630
  t = t.slice(0, t.length - 1), f(t, function(n) {
621
- pt(e, r, n);
631
+ bt(e, r, n);
622
632
  });
623
633
  }
624
- function pt(e, r, t) {
634
+ function bt(e, r, t) {
625
635
  var n = e.node(t), o = n.parent;
626
- e.edge(t, o).cutvalue = Ve(e, r, t);
636
+ e.edge(t, o).cutvalue = Ge(e, r, t);
627
637
  }
628
- function Ve(e, r, t) {
638
+ function Ge(e, r, t) {
629
639
  var n = e.node(t), o = n.parent, u = !0, i = r.edge(t, o), a = 0;
630
640
  return i || (u = !1, i = r.edge(o, t)), a = i.weight, f(r.nodeEdges(t), function(d) {
631
641
  var c = d.v === t, s = c ? d.w : d.v;
632
642
  if (s !== o) {
633
643
  var v = c === u, g = r.edge(d).weight;
634
- if (a += v ? g : -g, wt(e, t, s)) {
644
+ if (a += v ? g : -g, xt(e, t, s)) {
635
645
  var h = e.edge(t, s).cutvalue;
636
646
  a += v ? -h : h;
637
647
  }
@@ -639,91 +649,91 @@ function Ve(e, r, t) {
639
649
  }), a;
640
650
  }
641
651
  function oe(e, r) {
642
- arguments.length < 2 && (r = e.nodes()[0]), Ge(e, {}, 1, r);
652
+ arguments.length < 2 && (r = e.nodes()[0]), je(e, {}, 1, r);
643
653
  }
644
- function Ge(e, r, t, n, o) {
654
+ function je(e, r, t, n, o) {
645
655
  var u = t, i = e.node(n);
646
656
  return r[n] = !0, f(e.neighbors(n), function(a) {
647
- p(r, a) || (t = Ge(e, r, t, a, n));
657
+ p(r, a) || (t = je(e, r, t, a, n));
648
658
  }), i.low = u, i.lim = t++, o ? i.parent = o : delete i.parent, t;
649
659
  }
650
- function je(e) {
660
+ function Fe(e) {
651
661
  return X(e.edges(), function(r) {
652
662
  return e.edge(r).cutvalue < 0;
653
663
  });
654
664
  }
655
- function Fe(e, r, t) {
665
+ function qe(e, r, t) {
656
666
  var n = t.v, o = t.w;
657
667
  r.hasEdge(n, o) || (n = t.w, o = t.v);
658
668
  var u = e.node(n), i = e.node(o), a = u, d = !1;
659
669
  u.lim > i.lim && (a = i, d = !0);
660
670
  var c = $(r.edges(), function(s) {
661
- return d === ge(e, e.node(s.v), a) && d !== ge(e, e.node(s.w), a);
671
+ return d === he(e, e.node(s.v), a) && d !== he(e, e.node(s.w), a);
662
672
  });
663
673
  return ee(c, function(s) {
664
674
  return L(r, s);
665
675
  });
666
676
  }
667
- function qe(e, r, t, n) {
677
+ function Ae(e, r, t, n) {
668
678
  var o = t.v, u = t.w;
669
- e.removeEdge(o, u), e.setEdge(n.v, n.w, {}), oe(e), ne(e, r), mt(e, r);
679
+ e.removeEdge(o, u), e.setEdge(n.v, n.w, {}), oe(e), ne(e, r), yt(e, r);
670
680
  }
671
- function mt(e, r) {
681
+ function yt(e, r) {
672
682
  var t = X(e.nodes(), function(o) {
673
683
  return !r.node(o).parent;
674
- }), n = lt(e, t);
684
+ }), n = wt(e, t);
675
685
  n = n.slice(1), f(n, function(o) {
676
686
  var u = e.node(o).parent, i = r.edge(o, u), a = !1;
677
687
  i || (i = r.edge(u, o), a = !0), r.node(o).rank = r.node(u).rank + (a ? i.minlen : -i.minlen);
678
688
  });
679
689
  }
680
- function wt(e, r, t) {
690
+ function xt(e, r, t) {
681
691
  return e.hasEdge(r, t);
682
692
  }
683
- function ge(e, r, t) {
693
+ function he(e, r, t) {
684
694
  return t.low <= r.lim && r.lim <= t.lim;
685
695
  }
686
- function bt(e) {
696
+ function kt(e) {
687
697
  switch (e.graph().ranker) {
688
698
  case "network-simplex":
689
- he(e);
699
+ le(e);
690
700
  break;
691
701
  case "tight-tree":
692
- xt(e);
702
+ Nt(e);
693
703
  break;
694
704
  case "longest-path":
695
- yt(e);
705
+ Et(e);
696
706
  break;
697
707
  default:
698
- he(e);
708
+ le(e);
699
709
  }
700
710
  }
701
- var yt = te;
702
- function xt(e) {
703
- te(e), Se(e);
711
+ var Et = te;
712
+ function Nt(e) {
713
+ te(e), Oe(e);
704
714
  }
705
- function he(e) {
715
+ function le(e) {
706
716
  k(e);
707
717
  }
708
- function kt(e) {
709
- var r = R(e, "root", {}, "_root"), t = Et(e), n = x(E(t)) - 1, o = 2 * n + 1;
718
+ function It(e) {
719
+ var r = R(e, "root", {}, "_root"), t = _t(e), n = x(E(t)) - 1, o = 2 * n + 1;
710
720
  e.graph().nestingRoot = r, f(e.edges(), function(i) {
711
721
  e.edge(i).minlen *= o;
712
722
  });
713
- var u = Nt(e) + 1;
723
+ var u = Rt(e) + 1;
714
724
  f(e.children(), function(i) {
715
- Ae(e, r, o, u, n, t, i);
725
+ Ye(e, r, o, u, n, t, i);
716
726
  }), e.graph().nodeRankFactor = o;
717
727
  }
718
- function Ae(e, r, t, n, o, u, i) {
728
+ function Ye(e, r, t, n, o, u, i) {
719
729
  var a = e.children(i);
720
730
  if (!a.length) {
721
731
  i !== r && e.setEdge(r, i, { weight: 0, minlen: t });
722
732
  return;
723
733
  }
724
- var d = fe(e, "_bt"), c = fe(e, "_bb"), s = e.node(i);
734
+ var d = se(e, "_bt"), c = se(e, "_bb"), s = e.node(i);
725
735
  e.setParent(d, i), s.borderTop = d, e.setParent(c, i), s.borderBottom = c, f(a, function(v) {
726
- Ae(e, r, t, n, o, u, v);
736
+ Ye(e, r, t, n, o, u, v);
727
737
  var g = e.node(v), h = g.borderTop ? g.borderTop : v, l = g.borderBottom ? g.borderBottom : v, w = g.borderTop ? n : 2 * n, T = h !== l ? 1 : o - u[i] + 1;
728
738
  e.setEdge(d, h, {
729
739
  weight: w,
@@ -736,7 +746,7 @@ function Ae(e, r, t, n, o, u, i) {
736
746
  });
737
747
  }), e.parent(i) || e.setEdge(r, d, { weight: 0, minlen: o + u[i] });
738
748
  }
739
- function Et(e) {
749
+ function _t(e) {
740
750
  var r = {};
741
751
  function t(n, o) {
742
752
  var u = e.children(n);
@@ -748,7 +758,7 @@ function Et(e) {
748
758
  t(n, 1);
749
759
  }), r;
750
760
  }
751
- function Nt(e) {
761
+ function Rt(e) {
752
762
  return q(
753
763
  e.edges(),
754
764
  function(r, t) {
@@ -757,14 +767,14 @@ function Nt(e) {
757
767
  0
758
768
  );
759
769
  }
760
- function It(e) {
770
+ function Tt(e) {
761
771
  var r = e.graph();
762
772
  e.removeNode(r.nestingRoot), delete r.nestingRoot, f(e.edges(), function(t) {
763
773
  var n = e.edge(t);
764
774
  n.nestingEdge && e.removeEdge(t);
765
775
  });
766
776
  }
767
- function _t(e, r, t) {
777
+ function Mt(e, r, t) {
768
778
  var n = {}, o;
769
779
  f(t, function(u) {
770
780
  for (var i = e.parent(u), a, d; i; ) {
@@ -776,8 +786,8 @@ function _t(e, r, t) {
776
786
  }
777
787
  });
778
788
  }
779
- function Rt(e, r, t) {
780
- var n = Tt(e), o = new y({ compound: !0 }).setGraph({ root: n }).setDefaultNodeLabel(function(u) {
789
+ function Lt(e, r, t) {
790
+ var n = $t(e), o = new y({ compound: !0 }).setGraph({ root: n }).setDefaultNodeLabel(function(u) {
781
791
  return e.node(u);
782
792
  });
783
793
  return f(e.nodes(), function(u) {
@@ -791,18 +801,18 @@ function Rt(e, r, t) {
791
801
  }));
792
802
  }), o;
793
803
  }
794
- function Tt(e) {
804
+ function $t(e) {
795
805
  for (var r; e.hasNode(r = re("_root")); )
796
806
  ;
797
807
  return r;
798
808
  }
799
- function Mt(e, r) {
809
+ function Ct(e, r) {
800
810
  for (var t = 0, n = 1; n < r.length; ++n)
801
- t += Lt(e, r[n - 1], r[n]);
811
+ t += St(e, r[n - 1], r[n]);
802
812
  return t;
803
813
  }
804
- function Lt(e, r, t) {
805
- for (var n = Yr(
814
+ function St(e, r, t) {
815
+ for (var n = Dr(
806
816
  t,
807
817
  m(t, function(c, s) {
808
818
  return s;
@@ -834,7 +844,7 @@ function Lt(e, r, t) {
834
844
  })
835
845
  ), d;
836
846
  }
837
- function $t(e) {
847
+ function Ot(e) {
838
848
  var r = {}, t = $(e.nodes(), function(a) {
839
849
  return !e.children(a).length;
840
850
  }), n = x(
@@ -856,7 +866,7 @@ function $t(e) {
856
866
  });
857
867
  return f(i, u), o;
858
868
  }
859
- function Ct(e, r) {
869
+ function Pt(e, r) {
860
870
  return m(r, function(t) {
861
871
  var n = e.inEdges(t);
862
872
  if (n.length) {
@@ -880,7 +890,7 @@ function Ct(e, r) {
880
890
  return { v: t };
881
891
  });
882
892
  }
883
- function St(e, r) {
893
+ function Vt(e, r) {
884
894
  var t = {};
885
895
  f(e, function(o, u) {
886
896
  var i = t[o.v] = {
@@ -898,13 +908,13 @@ function St(e, r) {
898
908
  var n = $(t, function(o) {
899
909
  return !o.indegree;
900
910
  });
901
- return Ot(n);
911
+ return Gt(n);
902
912
  }
903
- function Ot(e) {
913
+ function Gt(e) {
904
914
  var r = [];
905
915
  function t(u) {
906
916
  return function(i) {
907
- i.merged || (b(i.barycenter) || b(u.barycenter) || i.barycenter >= u.barycenter) && Pt(u, i);
917
+ i.merged || (b(i.barycenter) || b(u.barycenter) || i.barycenter >= u.barycenter) && jt(u, i);
908
918
  };
909
919
  }
910
920
  function n(u) {
@@ -925,54 +935,54 @@ function Ot(e) {
925
935
  }
926
936
  );
927
937
  }
928
- function Pt(e, r) {
938
+ function jt(e, r) {
929
939
  var t = 0, n = 0;
930
940
  e.weight && (t += e.barycenter * e.weight, n += e.weight), r.weight && (t += r.barycenter * r.weight, n += r.weight), e.vs = r.vs.concat(e.vs), e.barycenter = t / n, e.weight = n, e.i = Math.min(r.i, e.i), r.merged = !0;
931
941
  }
932
- function Vt(e, r) {
933
- var t = rt(e, function(s) {
942
+ function Ft(e, r) {
943
+ var t = nt(e, function(s) {
934
944
  return p(s, "barycenter");
935
945
  }), n = t.lhs, o = C(t.rhs, function(s) {
936
946
  return -s.i;
937
947
  }), u = [], i = 0, a = 0, d = 0;
938
- n.sort(Gt(!!r)), d = le(u, o, d), f(n, function(s) {
939
- d += s.vs.length, u.push(s.vs), i += s.barycenter * s.weight, a += s.weight, d = le(u, o, d);
948
+ n.sort(qt(!!r)), d = pe(u, o, d), f(n, function(s) {
949
+ d += s.vs.length, u.push(s.vs), i += s.barycenter * s.weight, a += s.weight, d = pe(u, o, d);
940
950
  });
941
951
  var c = { vs: _(u) };
942
952
  return a && (c.barycenter = i / a, c.weight = a), c;
943
953
  }
944
- function le(e, r, t) {
954
+ function pe(e, r, t) {
945
955
  for (var n; r.length && (n = j(r)).i <= t; )
946
956
  r.pop(), e.push(n.vs), t++;
947
957
  return t;
948
958
  }
949
- function Gt(e) {
959
+ function qt(e) {
950
960
  return function(r, t) {
951
961
  return r.barycenter < t.barycenter ? -1 : r.barycenter > t.barycenter ? 1 : e ? t.i - r.i : r.i - t.i;
952
962
  };
953
963
  }
954
- function Ye(e, r, t, n) {
964
+ function Be(e, r, t, n) {
955
965
  var o = e.children(r), u = e.node(r), i = u ? u.borderLeft : void 0, a = u ? u.borderRight : void 0, d = {};
956
966
  i && (o = $(o, function(l) {
957
967
  return l !== i && l !== a;
958
968
  }));
959
- var c = Ct(e, o);
969
+ var c = Pt(e, o);
960
970
  f(c, function(l) {
961
971
  if (e.children(l.v).length) {
962
- var w = Ye(e, l.v, t, n);
963
- d[l.v] = w, p(w, "barycenter") && Ft(l, w);
972
+ var w = Be(e, l.v, t, n);
973
+ d[l.v] = w, p(w, "barycenter") && Yt(l, w);
964
974
  }
965
975
  });
966
- var s = St(c, t);
967
- jt(s, d);
968
- var v = Vt(s, n);
976
+ var s = Vt(c, t);
977
+ At(s, d);
978
+ var v = Ft(s, n);
969
979
  if (i && (v.vs = _([i, v.vs, a]), e.predecessors(i).length)) {
970
980
  var g = e.node(e.predecessors(i)[0]), h = e.node(e.predecessors(a)[0]);
971
981
  p(v, "barycenter") || (v.barycenter = 0, v.weight = 0), v.barycenter = (v.barycenter * v.weight + g.order + h.order) / (v.weight + 2), v.weight += 2;
972
982
  }
973
983
  return v;
974
984
  }
975
- function jt(e, r) {
985
+ function At(e, r) {
976
986
  f(e, function(t) {
977
987
  t.vs = _(
978
988
  t.vs.map(function(n) {
@@ -981,44 +991,44 @@ function jt(e, r) {
981
991
  );
982
992
  });
983
993
  }
984
- function Ft(e, r) {
994
+ function Yt(e, r) {
985
995
  b(e.barycenter) ? (e.barycenter = r.barycenter, e.weight = r.weight) : (e.barycenter = (e.barycenter * e.weight + r.barycenter * r.weight) / (e.weight + r.weight), e.weight += r.weight);
986
996
  }
987
- function qt(e) {
988
- var r = $e(e), t = pe(e, N(1, r + 1), "inEdges"), n = pe(e, N(r - 1, -1, -1), "outEdges"), o = $t(e);
989
- me(e, o);
997
+ function Bt(e) {
998
+ var r = Ce(e), t = me(e, N(1, r + 1), "inEdges"), n = me(e, N(r - 1, -1, -1), "outEdges"), o = Ot(e);
999
+ we(e, o);
990
1000
  for (var u = Number.POSITIVE_INFINITY, i, a = 0, d = 0; d < 4; ++a, ++d) {
991
- At(a % 2 ? t : n, a % 4 >= 2), o = Y(e);
992
- var c = Mt(e, o);
993
- c < u && (d = 0, i = br(o), u = c);
1001
+ Dt(a % 2 ? t : n, a % 4 >= 2), o = Y(e);
1002
+ var c = Ct(e, o);
1003
+ c < u && (d = 0, i = xr(o), u = c);
994
1004
  }
995
- me(e, i);
1005
+ we(e, i);
996
1006
  }
997
- function pe(e, r, t) {
1007
+ function me(e, r, t) {
998
1008
  return m(r, function(n) {
999
- return Rt(e, n, t);
1009
+ return Lt(e, n, t);
1000
1010
  });
1001
1011
  }
1002
- function At(e, r) {
1012
+ function Dt(e, r) {
1003
1013
  var t = new y();
1004
1014
  f(e, function(n) {
1005
- var o = n.graph().root, u = Ye(n, o, t, r);
1015
+ var o = n.graph().root, u = Be(n, o, t, r);
1006
1016
  f(u.vs, function(i, a) {
1007
1017
  n.node(i).order = a;
1008
- }), _t(n, t, u.vs);
1018
+ }), Mt(n, t, u.vs);
1009
1019
  });
1010
1020
  }
1011
- function me(e, r) {
1021
+ function we(e, r) {
1012
1022
  f(r, function(t) {
1013
1023
  f(t, function(n, o) {
1014
1024
  e.node(n).order = o;
1015
1025
  });
1016
1026
  });
1017
1027
  }
1018
- function Yt(e) {
1019
- var r = Dt(e);
1028
+ function zt(e) {
1029
+ var r = Qt(e);
1020
1030
  f(e.graph().dummyChains, function(t) {
1021
- for (var n = e.node(t), o = n.edgeObj, u = Bt(e, r, o.v, o.w), i = u.path, a = u.lca, d = 0, c = i[d], s = !0; t !== o.w; ) {
1031
+ for (var n = e.node(t), o = n.edgeObj, u = Ut(e, r, o.v, o.w), i = u.path, a = u.lca, d = 0, c = i[d], s = !0; t !== o.w; ) {
1022
1032
  if (n = e.node(t), s) {
1023
1033
  for (; (c = i[d]) !== a && e.node(c).maxRank < n.rank; )
1024
1034
  d++;
@@ -1033,7 +1043,7 @@ function Yt(e) {
1033
1043
  }
1034
1044
  });
1035
1045
  }
1036
- function Bt(e, r, t, n) {
1046
+ function Ut(e, r, t, n) {
1037
1047
  var o = [], u = [], i = Math.min(r[t].low, r[n].low), a = Math.max(r[t].lim, r[n].lim), d, c;
1038
1048
  d = t;
1039
1049
  do
@@ -1043,7 +1053,7 @@ function Bt(e, r, t, n) {
1043
1053
  u.push(d);
1044
1054
  return { path: o.concat(u.reverse()), lca: c };
1045
1055
  }
1046
- function Dt(e) {
1056
+ function Qt(e) {
1047
1057
  var r = {}, t = 0;
1048
1058
  function n(o) {
1049
1059
  var u = t;
@@ -1051,30 +1061,30 @@ function Dt(e) {
1051
1061
  }
1052
1062
  return f(e.children(), n), r;
1053
1063
  }
1054
- function zt(e, r) {
1064
+ function Wt(e, r) {
1055
1065
  var t = {};
1056
1066
  function n(o, u) {
1057
1067
  var i = 0, a = 0, d = o.length, c = j(u);
1058
1068
  return f(u, function(s, v) {
1059
- var g = Qt(e, s), h = g ? e.node(g).order : d;
1069
+ var g = Jt(e, s), h = g ? e.node(g).order : d;
1060
1070
  (g || s === c) && (f(u.slice(a, v + 1), function(l) {
1061
1071
  f(e.predecessors(l), function(w) {
1062
1072
  var T = e.node(w), ie = T.order;
1063
- (ie < i || h < ie) && !(T.dummy && e.node(l).dummy) && Be(t, w, l);
1073
+ (ie < i || h < ie) && !(T.dummy && e.node(l).dummy) && De(t, w, l);
1064
1074
  });
1065
1075
  }), a = v + 1, i = h);
1066
1076
  }), u;
1067
1077
  }
1068
1078
  return q(r, n), t;
1069
1079
  }
1070
- function Ut(e, r) {
1080
+ function Zt(e, r) {
1071
1081
  var t = {};
1072
1082
  function n(u, i, a, d, c) {
1073
1083
  var s;
1074
1084
  f(N(i, a), function(v) {
1075
1085
  s = u[v], e.node(s).dummy && f(e.predecessors(s), function(g) {
1076
1086
  var h = e.node(g);
1077
- h.dummy && (h.order < d || h.order > c) && Be(t, g, s);
1087
+ h.dummy && (h.order < d || h.order > c) && De(t, g, s);
1078
1088
  });
1079
1089
  });
1080
1090
  }
@@ -1090,13 +1100,13 @@ function Ut(e, r) {
1090
1100
  }
1091
1101
  return q(r, o), t;
1092
1102
  }
1093
- function Qt(e, r) {
1103
+ function Jt(e, r) {
1094
1104
  if (e.node(r).dummy)
1095
1105
  return X(e.predecessors(r), function(t) {
1096
1106
  return e.node(t).dummy;
1097
1107
  });
1098
1108
  }
1099
- function Be(e, r, t) {
1109
+ function De(e, r, t) {
1100
1110
  if (r > t) {
1101
1111
  var n = r;
1102
1112
  r = t, t = n;
@@ -1104,14 +1114,14 @@ function Be(e, r, t) {
1104
1114
  var o = e[r];
1105
1115
  o || (e[r] = o = {}), o[t] = !0;
1106
1116
  }
1107
- function Wt(e, r, t) {
1117
+ function Kt(e, r, t) {
1108
1118
  if (r > t) {
1109
1119
  var n = r;
1110
1120
  r = t, t = n;
1111
1121
  }
1112
1122
  return p(e[r], t);
1113
1123
  }
1114
- function Zt(e, r, t, n) {
1124
+ function Xt(e, r, t, n) {
1115
1125
  var o = {}, u = {}, i = {};
1116
1126
  return f(r, function(a) {
1117
1127
  f(a, function(d, c) {
@@ -1127,14 +1137,14 @@ function Zt(e, r, t, n) {
1127
1137
  });
1128
1138
  for (var v = (s.length - 1) / 2, g = Math.floor(v), h = Math.ceil(v); g <= h; ++g) {
1129
1139
  var l = s[g];
1130
- u[c] === c && d < i[l] && !Wt(t, c, l) && (u[l] = c, u[c] = o[c] = o[l], d = i[l]);
1140
+ u[c] === c && d < i[l] && !Kt(t, c, l) && (u[l] = c, u[c] = o[c] = o[l], d = i[l]);
1131
1141
  }
1132
1142
  }
1133
1143
  });
1134
1144
  }), { root: o, align: u };
1135
1145
  }
1136
- function Jt(e, r, t, n, o) {
1137
- var u = {}, i = Kt(e, r, t, o), a = o ? "borderLeft" : "borderRight";
1146
+ function Ht(e, r, t, n, o) {
1147
+ var u = {}, i = en(e, r, t, o), a = o ? "borderLeft" : "borderRight";
1138
1148
  function d(v, g) {
1139
1149
  for (var h = i.nodes(), l = h.pop(), w = {}; l; )
1140
1150
  w[l] ? v(l) : (w[l] = !0, h.push(l), h = h.concat(g(l))), l = h.pop();
@@ -1154,8 +1164,8 @@ function Jt(e, r, t, n, o) {
1154
1164
  u[v] = u[t[v]];
1155
1165
  }), u;
1156
1166
  }
1157
- function Kt(e, r, t, n) {
1158
- var o = new y(), u = e.graph(), i = tn(u.nodesep, u.edgesep, n);
1167
+ function en(e, r, t, n) {
1168
+ var o = new y(), u = e.graph(), i = un(u.nodesep, u.edgesep, n);
1159
1169
  return f(r, function(a) {
1160
1170
  var d;
1161
1171
  f(a, function(c) {
@@ -1168,16 +1178,16 @@ function Kt(e, r, t, n) {
1168
1178
  });
1169
1179
  }), o;
1170
1180
  }
1171
- function Xt(e, r) {
1181
+ function rn(e, r) {
1172
1182
  return ee(E(r), function(t) {
1173
1183
  var n = Number.NEGATIVE_INFINITY, o = Number.POSITIVE_INFINITY;
1174
- return _r(t, function(u, i) {
1175
- var a = nn(e, i) / 2;
1184
+ return Tr(t, function(u, i) {
1185
+ var a = an(e, i) / 2;
1176
1186
  n = Math.max(u + a, n), o = Math.min(u - a, o);
1177
1187
  }), n - o;
1178
1188
  });
1179
1189
  }
1180
- function Ht(e, r) {
1190
+ function tn(e, r) {
1181
1191
  var t = E(r), n = M(t), o = x(t);
1182
1192
  f(["u", "d"], function(u) {
1183
1193
  f(["l", "r"], function(i) {
@@ -1191,7 +1201,7 @@ function Ht(e, r) {
1191
1201
  });
1192
1202
  });
1193
1203
  }
1194
- function en(e, r) {
1204
+ function nn(e, r) {
1195
1205
  return A(e.ul, function(t, n) {
1196
1206
  if (r)
1197
1207
  return e[r.toLowerCase()][n];
@@ -1199,23 +1209,23 @@ function en(e, r) {
1199
1209
  return (o[1] + o[2]) / 2;
1200
1210
  });
1201
1211
  }
1202
- function rn(e) {
1203
- var r = Y(e), t = W(zt(e, r), Ut(e, r)), n = {}, o;
1212
+ function on(e) {
1213
+ var r = Y(e), t = W(Wt(e, r), Zt(e, r)), n = {}, o;
1204
1214
  f(["u", "d"], function(i) {
1205
1215
  o = i === "u" ? r : E(r).reverse(), f(["l", "r"], function(a) {
1206
1216
  a === "r" && (o = m(o, function(v) {
1207
1217
  return E(v).reverse();
1208
1218
  }));
1209
- var d = (i === "u" ? e.predecessors : e.successors).bind(e), c = Zt(e, o, t, d), s = Jt(e, o, c.root, c.align, a === "r");
1219
+ var d = (i === "u" ? e.predecessors : e.successors).bind(e), c = Xt(e, o, t, d), s = Ht(e, o, c.root, c.align, a === "r");
1210
1220
  a === "r" && (s = A(s, function(v) {
1211
1221
  return -v;
1212
1222
  })), n[i + a] = s;
1213
1223
  });
1214
1224
  });
1215
- var u = Xt(e, n);
1216
- return Ht(n, u), en(n, e.graph().align);
1225
+ var u = rn(e, n);
1226
+ return tn(n, u), nn(n, e.graph().align);
1217
1227
  }
1218
- function tn(e, r, t) {
1228
+ function un(e, r, t) {
1219
1229
  return function(n, o, u) {
1220
1230
  var i = n.node(o), a = n.node(u), d = 0, c;
1221
1231
  if (d += i.width / 2, p(i, "labelpos"))
@@ -1239,15 +1249,15 @@ function tn(e, r, t) {
1239
1249
  return c && (d += t ? c : -c), c = 0, d;
1240
1250
  };
1241
1251
  }
1242
- function nn(e, r) {
1252
+ function an(e, r) {
1243
1253
  return e.node(r).width;
1244
1254
  }
1245
- function on(e) {
1246
- e = Le(e), un(e), Rr(rn(e), function(r, t) {
1255
+ function dn(e) {
1256
+ e = $e(e), cn(e), Mr(on(e), function(r, t) {
1247
1257
  e.node(t).x = r;
1248
1258
  });
1249
1259
  }
1250
- function un(e) {
1260
+ function cn(e) {
1251
1261
  var r = Y(e), t = e.graph().ranksep, n = 0;
1252
1262
  f(r, function(o) {
1253
1263
  var u = x(
@@ -1260,77 +1270,77 @@ function un(e) {
1260
1270
  }), n += u + t;
1261
1271
  });
1262
1272
  }
1263
- function Cn(e, r) {
1264
- var t = tt;
1273
+ function Pn(e, r) {
1274
+ var t = r && r.debugTiming ? ot : it;
1265
1275
  t("layout", function() {
1266
1276
  var n = t(" buildLayoutGraph", function() {
1267
- return mn(e);
1277
+ return yn(e);
1268
1278
  });
1269
1279
  t(" runLayout", function() {
1270
- an(n, t);
1280
+ fn(n, t);
1271
1281
  }), t(" updateInputGraph", function() {
1272
- dn(e, n);
1282
+ sn(e, n);
1273
1283
  });
1274
1284
  });
1275
1285
  }
1276
- function an(e, r) {
1286
+ function fn(e, r) {
1277
1287
  r(" makeSpaceForEdgeLabels", function() {
1278
- wn(e);
1288
+ xn(e);
1279
1289
  }), r(" removeSelfEdges", function() {
1280
- Rn(e);
1290
+ Ln(e);
1281
1291
  }), r(" acyclic", function() {
1282
- Zr(e);
1292
+ Kr(e);
1283
1293
  }), r(" nestingGraph.run", function() {
1284
- kt(e);
1294
+ It(e);
1285
1295
  }), r(" rank", function() {
1286
- bt(Le(e));
1296
+ kt($e(e));
1287
1297
  }), r(" injectEdgeLabelProxies", function() {
1288
- bn(e);
1298
+ kn(e);
1289
1299
  }), r(" removeEmptyRanks", function() {
1290
- et(e);
1300
+ tt(e);
1291
1301
  }), r(" nestingGraph.cleanup", function() {
1292
- It(e);
1302
+ Tt(e);
1293
1303
  }), r(" normalizeRanks", function() {
1294
- Hr(e);
1304
+ rt(e);
1295
1305
  }), r(" assignRankMinMax", function() {
1296
- yn(e);
1306
+ En(e);
1297
1307
  }), r(" removeEdgeLabelProxies", function() {
1298
- xn(e);
1308
+ Nn(e);
1299
1309
  }), r(" normalize.run", function() {
1300
- dt(e);
1310
+ st(e);
1301
1311
  }), r(" parentDummyChains", function() {
1302
- Yt(e);
1312
+ zt(e);
1303
1313
  }), r(" addBorderSegments", function() {
1304
- nt(e);
1314
+ ut(e);
1305
1315
  }), r(" order", function() {
1306
- qt(e);
1316
+ Bt(e);
1307
1317
  }), r(" insertSelfEdges", function() {
1308
- Tn(e);
1318
+ $n(e);
1309
1319
  }), r(" adjustCoordinateSystem", function() {
1310
- ot(e);
1320
+ at(e);
1311
1321
  }), r(" position", function() {
1312
- on(e);
1322
+ dn(e);
1313
1323
  }), r(" positionSelfEdges", function() {
1314
- Mn(e);
1324
+ Cn(e);
1315
1325
  }), r(" removeBorderNodes", function() {
1316
- _n(e);
1326
+ Mn(e);
1317
1327
  }), r(" normalize.undo", function() {
1318
- ft(e);
1328
+ gt(e);
1319
1329
  }), r(" fixupEdgeLabelCoords", function() {
1320
- Nn(e);
1330
+ Rn(e);
1321
1331
  }), r(" undoCoordinateSystem", function() {
1322
- it(e);
1332
+ dt(e);
1323
1333
  }), r(" translateGraph", function() {
1324
- kn(e);
1334
+ In(e);
1325
1335
  }), r(" assignNodeIntersects", function() {
1326
- En(e);
1336
+ _n(e);
1327
1337
  }), r(" reversePoints", function() {
1328
- In(e);
1338
+ Tn(e);
1329
1339
  }), r(" acyclic.undo", function() {
1330
- Kr(e);
1340
+ Hr(e);
1331
1341
  });
1332
1342
  }
1333
- function dn(e, r) {
1343
+ function sn(e, r) {
1334
1344
  f(e.nodes(), function(t) {
1335
1345
  var n = e.node(t), o = r.node(t);
1336
1346
  n && (n.x = o.x, n.y = o.y, r.children(t).length && (n.width = o.width, n.height = o.height));
@@ -1339,37 +1349,37 @@ function dn(e, r) {
1339
1349
  n.points = o.points, p(o, "x") && (n.x = o.x, n.y = o.y);
1340
1350
  }), e.graph().width = r.graph().width, e.graph().height = r.graph().height;
1341
1351
  }
1342
- var cn = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], fn = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, sn = ["acyclicer", "ranker", "rankdir", "align"], vn = ["width", "height"], gn = { width: 0, height: 0 }, hn = ["minlen", "weight", "width", "height", "labeloffset"], ln = {
1352
+ var vn = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], gn = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, hn = ["acyclicer", "ranker", "rankdir", "align"], ln = ["width", "height"], pn = { width: 0, height: 0 }, mn = ["minlen", "weight", "width", "height", "labeloffset"], wn = {
1343
1353
  minlen: 1,
1344
1354
  weight: 1,
1345
1355
  width: 0,
1346
1356
  height: 0,
1347
1357
  labeloffset: 10,
1348
1358
  labelpos: "r"
1349
- }, pn = ["labelpos"];
1350
- function mn(e) {
1359
+ }, bn = ["labelpos"];
1360
+ function yn(e) {
1351
1361
  var r = new y({ multigraph: !0, compound: !0 }), t = Q(e.graph());
1352
1362
  return r.setGraph(
1353
- W({}, fn, U(t, cn), F(t, sn))
1363
+ W({}, gn, U(t, vn), F(t, hn))
1354
1364
  ), f(e.nodes(), function(n) {
1355
1365
  var o = Q(e.node(n));
1356
- r.setNode(n, kr(U(o, vn), gn)), r.setParent(n, e.parent(n));
1366
+ r.setNode(n, Nr(U(o, ln), pn)), r.setParent(n, e.parent(n));
1357
1367
  }), f(e.edges(), function(n) {
1358
1368
  var o = Q(e.edge(n));
1359
1369
  r.setEdge(
1360
1370
  n,
1361
- W({}, ln, U(o, hn), F(o, pn))
1371
+ W({}, wn, U(o, mn), F(o, bn))
1362
1372
  );
1363
1373
  }), r;
1364
1374
  }
1365
- function wn(e) {
1375
+ function xn(e) {
1366
1376
  var r = e.graph();
1367
1377
  r.ranksep /= 2, f(e.edges(), function(t) {
1368
1378
  var n = e.edge(t);
1369
1379
  n.minlen *= 2, n.labelpos.toLowerCase() !== "c" && (r.rankdir === "TB" || r.rankdir === "BT" ? n.width += n.labeloffset : n.height += n.labeloffset);
1370
1380
  });
1371
1381
  }
1372
- function bn(e) {
1382
+ function kn(e) {
1373
1383
  f(e.edges(), function(r) {
1374
1384
  var t = e.edge(r);
1375
1385
  if (t.width && t.height) {
@@ -1378,20 +1388,20 @@ function bn(e) {
1378
1388
  }
1379
1389
  });
1380
1390
  }
1381
- function yn(e) {
1391
+ function En(e) {
1382
1392
  var r = 0;
1383
1393
  f(e.nodes(), function(t) {
1384
1394
  var n = e.node(t);
1385
1395
  n.borderTop && (n.minRank = e.node(n.borderTop).rank, n.maxRank = e.node(n.borderBottom).rank, r = x(r, n.maxRank));
1386
1396
  }), e.graph().maxRank = r;
1387
1397
  }
1388
- function xn(e) {
1398
+ function Nn(e) {
1389
1399
  f(e.nodes(), function(r) {
1390
1400
  var t = e.node(r);
1391
1401
  t.dummy === "edge-proxy" && (e.edge(t.e).labelRank = t.rank, e.removeNode(r));
1392
1402
  });
1393
1403
  }
1394
- function kn(e) {
1404
+ function In(e) {
1395
1405
  var r = Number.POSITIVE_INFINITY, t = 0, n = Number.POSITIVE_INFINITY, o = 0, u = e.graph(), i = u.marginx || 0, a = u.marginy || 0;
1396
1406
  function d(c) {
1397
1407
  var s = c.x, v = c.y, g = c.width, h = c.height;
@@ -1412,13 +1422,13 @@ function kn(e) {
1412
1422
  }), p(s, "x") && (s.x -= r), p(s, "y") && (s.y -= n);
1413
1423
  }), u.width = t - r + i, u.height = o - n + a;
1414
1424
  }
1415
- function En(e) {
1425
+ function _n(e) {
1416
1426
  f(e.edges(), function(r) {
1417
1427
  var t = e.edge(r), n = e.node(r.v), o = e.node(r.w), u, i;
1418
- t.points ? (u = t.points[0], i = t.points[t.points.length - 1]) : (t.points = [], u = o, i = n), t.points.unshift(ce(n, u)), t.points.push(ce(o, i));
1428
+ t.points ? (u = t.points[0], i = t.points[t.points.length - 1]) : (t.points = [], u = o, i = n), t.points.unshift(fe(n, u)), t.points.push(fe(o, i));
1419
1429
  });
1420
1430
  }
1421
- function Nn(e) {
1431
+ function Rn(e) {
1422
1432
  f(e.edges(), function(r) {
1423
1433
  var t = e.edge(r);
1424
1434
  if (p(t, "x"))
@@ -1432,13 +1442,13 @@ function Nn(e) {
1432
1442
  }
1433
1443
  });
1434
1444
  }
1435
- function In(e) {
1445
+ function Tn(e) {
1436
1446
  f(e.edges(), function(r) {
1437
1447
  var t = e.edge(r);
1438
1448
  t.reversed && t.points.reverse();
1439
1449
  });
1440
1450
  }
1441
- function _n(e) {
1451
+ function Mn(e) {
1442
1452
  f(e.nodes(), function(r) {
1443
1453
  if (e.children(r).length) {
1444
1454
  var t = e.node(r), n = e.node(t.borderTop), o = e.node(t.borderBottom), u = e.node(j(t.borderLeft)), i = e.node(j(t.borderRight));
@@ -1448,7 +1458,7 @@ function _n(e) {
1448
1458
  e.node(r).dummy === "border" && e.removeNode(r);
1449
1459
  });
1450
1460
  }
1451
- function Rn(e) {
1461
+ function Ln(e) {
1452
1462
  f(e.edges(), function(r) {
1453
1463
  if (r.v === r.w) {
1454
1464
  var t = e.node(r.v);
@@ -1456,7 +1466,7 @@ function Rn(e) {
1456
1466
  }
1457
1467
  });
1458
1468
  }
1459
- function Tn(e) {
1469
+ function $n(e) {
1460
1470
  var r = Y(e);
1461
1471
  f(r, function(t) {
1462
1472
  var n = 0;
@@ -1480,7 +1490,7 @@ function Tn(e) {
1480
1490
  });
1481
1491
  });
1482
1492
  }
1483
- function Mn(e) {
1493
+ function Cn(e) {
1484
1494
  f(e.nodes(), function(r) {
1485
1495
  var t = e.node(r);
1486
1496
  if (t.dummy === "selfedge") {
@@ -1505,8 +1515,8 @@ function Q(e) {
1505
1515
  }), r;
1506
1516
  }
1507
1517
  export {
1508
- Cn as A,
1509
- kr as L,
1518
+ Pn as A,
1519
+ Nr as L,
1510
1520
  N,
1511
1521
  F as V,
1512
1522
  re as e,