@kong-ui-public/documentation 0.4.12 → 0.4.14

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 (56) hide show
  1. package/dist/arc-DI9wV-Mn-_GgJI37p.js +86 -0
  2. package/dist/{astro-D4FIwVxr-CovDYZfT.js → astro-U6b0KI4d-Bfq8RcMV.js} +1 -1
  3. package/dist/{blockDiagram-6b2b5046-BabM1eIl-C85stHtj.js → blockDiagram-91b80b7a-D3OZBNEF-BXra-uP1.js} +24 -24
  4. package/dist/{c4Diagram-b947cdbb-BBGJ9ivn-Dwz3JGTI.js → c4Diagram-b2a90758-wyqGQ69Q-3S5U0W2q.js} +133 -132
  5. package/dist/channel-Brhzsu_o-C42tcZPD.js +5 -0
  6. package/dist/{classDiagram-35230388-CRYNduH8-BOSSyxwU.js → classDiagram-30eddba6-0OAjss5X-DDloSHap.js} +8 -7
  7. package/dist/{classDiagram-v2-412acd34-5HbyJrnL-ST64CPx5.js → classDiagram-v2-f2df5561-Dn89kA5N-W6p27IrP.js} +7 -7
  8. package/dist/{clone-BoeTe_OS-CjGEkx_F.js → clone-Bsggwgls-BzwAVRKa.js} +1 -1
  9. package/dist/{createText-423428c9-Q0HfccbL-DBcIXsnc.js → createText-6b48ae7d-c5hzPIcj-DS42dDY6.js} +2 -1
  10. package/dist/documentation.es.js +5 -5
  11. package/dist/documentation.umd.js +991 -720
  12. package/dist/{edges-d417c7a0-DEJA2PwU-c5o-9uno.js → edges-d32062c0-CGbRbizB-BNCq9bff.js} +28 -27
  13. package/dist/{erDiagram-0ea73325-C3DQ6B1e-DjAGdzcu.js → erDiagram-47591fe2-CyCEEu9x-BoCVITkJ.js} +38 -38
  14. package/dist/{flowDb-d35e309a-RvFFqjek-pyC_lUzm.js → flowDb-4b19a42f-wIq43fe7-D6eWU8wc.js} +45 -45
  15. package/dist/{flowDiagram-d949d7c1-Boa20b_n-BKdBxRnq.js → flowDiagram-5540d9b9-D8Ak_JQc-66jM_qDv.js} +317 -309
  16. package/dist/{flowDiagram-v2-49332944-BJtijxhz-BfL0l3kS.js → flowDiagram-v2-3b53844e-DxkVnD_T-DVByZPqp.js} +5 -5
  17. package/dist/{flowchart-elk-definition-27cc417a-BBD3LS9k-DhfRKjaQ.js → flowchart-elk-definition-5fe447d6-CUIdb-2U-rw1sP1Nb.js} +10626 -10624
  18. package/dist/{ganttDiagram-5c869e3b-CRDFjzTp-C3-yl36r.js → ganttDiagram-9a3bba1f-U28Z8glu-okJ1HHdc.js} +488 -477
  19. package/dist/{git-rebase-sR-yVH_J-D5M2oE9O.js → git-rebase-B7sc3yJp-BPxHM_r2.js} +1 -1
  20. package/dist/gitGraphDiagram-96e6b4ee-DTO3lH8N-1qRg2G2i.js +1264 -0
  21. package/dist/{graph-BIq67vWs-B7ta0ZdY.js → graph-Bc1n6qSP-D5FVfre_.js} +64 -64
  22. package/dist/{haml-BT5dFrjs-CmYUmNQ_.js → haml-DsuMo-J7-DWhF2QrW.js} +1 -1
  23. package/dist/{http-DSIFYUfg-BZm1KGvb.js → http-ClrjZLFz-gNFfL9hE.js} +1 -1
  24. package/dist/{index-_NcqxG2P.js → index-3vhKKQrV.js} +2771 -2689
  25. package/dist/{index-8fae9850-CaUboB89-KhmQqIkN.js → index-fc10efb0-B2L-sBu4-xOwI5vt1.js} +11 -11
  26. package/dist/{infoDiagram-db7b18fc-DKsewKnu-nKlnfk12.js → infoDiagram-bcd20f53-DTO3TTbR-DxLIdeSc.js} +12 -12
  27. package/dist/{journeyDiagram-d5636530-ClddNDmR-DXRHq-4M.js → journeyDiagram-4fe6b3dc-qVhc1UAl-_d--6Ls9.js} +42 -42
  28. package/dist/katex-BQC_klMa-CaeA20wX.js +11636 -0
  29. package/dist/{latex-QX-FNvxY-DfqkUAVR.js → latex-9g43iAzl-B3VseW3K.js} +1 -1
  30. package/dist/{layout-Cz0dAJah-BTgthZsZ.js → layout-DcWyZN_J-vui7Gviz.js} +132 -132
  31. package/dist/{line-BCVITS7s-Ckay3mGw.js → line-BeML9Stu-Dy9lL6FR.js} +1 -1
  32. package/dist/{linear-CLHAbj67-CRi7BpMp.js → linear-S-ccJMdE-6xfCU5AQ.js} +35 -35
  33. package/dist/{mindmap-definition-377f8f1f-BwEJ-DVg-DWk6Jo2n.js → mindmap-definition-f354de21-DH1Q4t1U-DzFbmWqo.js} +6647 -6414
  34. package/dist/{pieDiagram-b0208e96-Cyz2Kcfu-BKQLF9sW.js → pieDiagram-79897490-BNP6ubu_-6WJB20-7.js} +68 -68
  35. package/dist/{quadrantDiagram-0332be45-CDMkEQj0-B8KMwkcO.js → quadrantDiagram-62f64e94-BwUp7akV-DvMoXd98.js} +2 -2
  36. package/dist/{requirementDiagram-bf7890df-Jk3SQ-Q1-ub7Z0GPl.js → requirementDiagram-05bf5f74-N_qzJROT-CrkeOa_P.js} +30 -30
  37. package/dist/{rst-Bm1i8IkK-C9EaDq6g.js → rst-iTJmEY_6-AgWIzPqn.js} +2 -2
  38. package/dist/{ruby-CZZKXaz8-BxaDEkRP.js → ruby-3Bt2I2On--AixRnjJ.js} +1 -1
  39. package/dist/{sankeyDiagram-0acdec17-BJuIUJd_-BnkIVf8S.js → sankeyDiagram-97764748-bwaduY7g-VneUYt0y.js} +22 -22
  40. package/dist/{sequenceDiagram-c18d009d-B4IxGCEM-B3uFgxU_.js → sequenceDiagram-acc0e65c-Bk-fBLta-CsMH0Cqo.js} +917 -884
  41. package/dist/shellscript-DQ1J75ow-DQ1J75ow.js +7 -0
  42. package/dist/{shellsession-BIPXtZci-D6avbCwN.js → shellsession-btSM7PAE-lMmUmCMx.js} +1 -1
  43. package/dist/{stateDiagram-43596fc0-0xEMkbt_-BALY6uIB.js → stateDiagram-0ff1cf1a-Bi3BTd4c-qFbxEDNM.js} +5 -5
  44. package/dist/{stateDiagram-v2-2ead4f9c-DS4afpcC-B7o3rR3l.js → stateDiagram-v2-9a9d610d-IejNE6-r-bIvS4iK_.js} +12 -12
  45. package/dist/{styles-7383a064-C7WyH3qz-C_v2lpXJ.js → styles-3ed67cfa-BaFO0Ztt-yz8KrlaH.js} +140 -137
  46. package/dist/{styles-6860f46c-ZdhsT5S9-obFqRkzA.js → styles-991ebdfc-D4EpkGAf-B-Xwx8uG.js} +19 -19
  47. package/dist/{styles-b2c874b6-BFg-Nblp-DDESTBsS.js → styles-d20c7d72-DqCTX9VL-CceYqMjq.js} +24 -24
  48. package/dist/{svgDrawCommon-0ee1b4e9-CpOZq9bS-Cw8Tr_3J.js → svgDrawCommon-5ccd53ef-C-vBitUh-C3LZR4L9.js} +4 -4
  49. package/dist/{timeline-definition-d977decf-BqZwyTB6-C3j7tbKa.js → timeline-definition-fea2a41d-Bd7A9rUe-DzZgbnY-.js} +2 -2
  50. package/dist/{twig-B_Gr-ODl-Cl9Q0GWo.js → twig-Dcp9VbaI-FN48_KCA.js} +1 -1
  51. package/dist/{xychartDiagram-e50adddc-C1fuuOEQ-CF13knJk.js → xychartDiagram-ab372869-3O-Pt-l7-P2dDKl4d.js} +30 -30
  52. package/package.json +3 -3
  53. package/dist/arc-C2t0ExPw-CR_0vqRg.js +0 -86
  54. package/dist/channel-DXyvEer2-OyVZq8Xo.js +0 -5
  55. package/dist/gitGraphDiagram-b9d81de9-D1rNIGL0-BG2n_b9U.js +0 -1262
  56. package/dist/shellscript-CUUTQKn5-CUUTQKn5.js +0 -7
@@ -1,5 +1,5 @@
1
- import { S as be, $ as S, e as ze, C as ye, Y as I, I as xe, a as Ue, U as Ke, J as P, m as f, Z as y, b as ke, c as Ze, d as b, E as p, H as E, K as q, j as He, x as Ee, D as C, T as Je, f as We } from "./graph-BIq67vWs-B7ta0ZdY.js";
2
- import { C as Ne, aa as V, a3 as Ie, a7 as Xe, ab as Qe, ac as er, H as J, K as _e, F as W, a6 as rr, T as F, V as tr, $ as Te, ad as Z, ae as nr, af as or, a1 as ir, I as ur } from "./index-_NcqxG2P.js";
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-Bc1n6qSP-D5FVfre_.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-3vhKKQrV.js";
3
3
  var ar = /\s/;
4
4
  function dr(e) {
5
5
  for (var r = e.length; r-- && ar.test(e.charAt(r)); )
@@ -16,9 +16,9 @@ function lr(e) {
16
16
  return e;
17
17
  if (P(e))
18
18
  return ue;
19
- if (F(e)) {
19
+ if (G(e)) {
20
20
  var r = typeof e.valueOf == "function" ? e.valueOf() : e;
21
- e = F(r) ? r + "" : r;
21
+ e = G(r) ? r + "" : r;
22
22
  }
23
23
  if (typeof e != "string")
24
24
  return e === 0 ? e : +e;
@@ -45,21 +45,21 @@ function _(e) {
45
45
  return r ? be(e, 1) : [];
46
46
  }
47
47
  function wr(e) {
48
- return Qe(er(e, void 0, _), e + "");
48
+ return He(er(e, void 0, _), e + "");
49
49
  }
50
50
  var br = 1, yr = 4;
51
51
  function xr(e) {
52
- return He(e, br | yr);
52
+ return Ze(e, br | yr);
53
53
  }
54
54
  var de = function() {
55
55
  return nr.Date.now();
56
- }, Re = Object.prototype, kr = Re.hasOwnProperty, Er = Ne(function(e, r) {
56
+ }, Te = Object.prototype, kr = Te.hasOwnProperty, Er = Ne(function(e, r) {
57
57
  e = Object(e);
58
58
  var t = -1, n = r.length, o = n > 2 ? r[2] : void 0;
59
59
  for (o && V(r[0], r[1], o) && (n = 1); ++t < n; )
60
60
  for (var u = r[t], i = Ie(u), a = -1, d = i.length; ++a < d; ) {
61
61
  var c = i[a], s = e[c];
62
- (s === void 0 || Xe(s, Re[c]) && !kr.call(e, c)) && (e[c] = u[c]);
62
+ (s === void 0 || Xe(s, Te[c]) && !kr.call(e, c)) && (e[c] = u[c]);
63
63
  }
64
64
  return e;
65
65
  });
@@ -82,14 +82,14 @@ function Ir(e) {
82
82
  };
83
83
  }
84
84
  var _r = Math.max;
85
- function Tr(e, r, t) {
85
+ function Rr(e, r, t) {
86
86
  var n = e == null ? 0 : e.length;
87
87
  if (!n)
88
88
  return -1;
89
89
  var o = t == null ? 0 : mr(t);
90
- return o < 0 && (o = _r(n + o, 0)), We(e, I(r), o);
90
+ return o < 0 && (o = _r(n + o, 0)), Ke(e, I(r), o);
91
91
  }
92
- var X = Ir(Tr);
92
+ var X = Ir(Rr);
93
93
  function Me(e, r) {
94
94
  var t = -1, n = _e(e) ? Array(e.length) : [];
95
95
  return ze(e, function(o, u, i) {
@@ -97,19 +97,19 @@ function Me(e, r) {
97
97
  }), n;
98
98
  }
99
99
  function m(e, r) {
100
- var t = W(e) ? S : Me;
100
+ var t = K(e) ? S : Me;
101
101
  return t(e, I(r));
102
102
  }
103
- function Rr(e, r) {
103
+ function Tr(e, r) {
104
104
  return e == null ? e : ir(e, Ee(r), Ie);
105
105
  }
106
106
  function Mr(e, r) {
107
107
  return e && ke(e, Ee(r));
108
108
  }
109
- function $r(e, r) {
109
+ function Lr(e, r) {
110
110
  return e > r;
111
111
  }
112
- function $e(e, r) {
112
+ function Le(e, r) {
113
113
  return e < r;
114
114
  }
115
115
  function A(e, r) {
@@ -118,7 +118,7 @@ function A(e, r) {
118
118
  or(t, o, r(n, o, u));
119
119
  }), t;
120
120
  }
121
- function Q(e, r, t) {
121
+ function H(e, r, t) {
122
122
  for (var n = -1, o = e.length; ++n < o; ) {
123
123
  var u = e[n], i = r(u);
124
124
  if (i != null && (a === void 0 ? i === i && !P(i) : t(i, a)))
@@ -127,34 +127,34 @@ function Q(e, r, t) {
127
127
  return d;
128
128
  }
129
129
  function x(e) {
130
- return e && e.length ? Q(e, J, $r) : void 0;
130
+ return e && e.length ? H(e, J, Lr) : void 0;
131
131
  }
132
132
  function M(e) {
133
- return e && e.length ? Q(e, J, $e) : void 0;
133
+ return e && e.length ? H(e, J, Le) : void 0;
134
134
  }
135
135
  function ee(e, r) {
136
- return e && e.length ? Q(e, I(r), $e) : void 0;
136
+ return e && e.length ? H(e, I(r), Le) : void 0;
137
137
  }
138
- function Cr(e, r, t, n) {
139
- if (!F(e))
138
+ function $r(e, r, t, n) {
139
+ if (!G(e))
140
140
  return e;
141
141
  r = xe(r, e);
142
142
  for (var o = -1, u = r.length, i = u - 1, a = e; a != null && ++o < u; ) {
143
- var d = Ke(r[o]), c = t;
143
+ var d = Qe(r[o]), c = t;
144
144
  if (d === "__proto__" || d === "constructor" || d === "prototype")
145
145
  return e;
146
146
  if (o != i) {
147
147
  var s = a[d];
148
- c = n ? n(s, d, a) : void 0, c === void 0 && (c = F(s) ? s : tr(r[o + 1]) ? [] : {});
148
+ c = n ? n(s, d, a) : void 0, c === void 0 && (c = G(s) ? s : tr(r[o + 1]) ? [] : {});
149
149
  }
150
- Te(a, d, c), a = a[d];
150
+ Re(a, d, c), a = a[d];
151
151
  }
152
152
  return e;
153
153
  }
154
- function Lr(e, r, t) {
154
+ function Cr(e, r, t) {
155
155
  for (var n = -1, o = r.length, u = {}; ++n < o; ) {
156
156
  var i = r[n], a = ye(e, i);
157
- t(a, i) && Cr(u, xe(i, e), a);
157
+ t(a, i) && $r(u, xe(i, e), a);
158
158
  }
159
159
  return u;
160
160
  }
@@ -188,7 +188,7 @@ function Pr(e, r, t) {
188
188
  }
189
189
  function Vr(e, r, t) {
190
190
  r.length ? r = S(r, function(u) {
191
- return W(u) ? function(i) {
191
+ return K(u) ? function(i) {
192
192
  return ye(i, u.length === 1 ? u[0] : u);
193
193
  } : u;
194
194
  }) : r = [J];
@@ -204,16 +204,16 @@ function Vr(e, r, t) {
204
204
  return Pr(u, i, t);
205
205
  });
206
206
  }
207
- function Fr(e, r) {
208
- return Lr(e, r, function(t, n) {
207
+ function Gr(e, r) {
208
+ return Cr(e, r, function(t, n) {
209
209
  return Ue(e, n);
210
210
  });
211
211
  }
212
- var G = wr(function(e, r) {
213
- return e == null ? {} : Fr(e, r);
214
- }), jr = Math.ceil, Gr = Math.max;
212
+ var F = wr(function(e, r) {
213
+ return e == null ? {} : Gr(e, r);
214
+ }), jr = Math.ceil, Fr = Math.max;
215
215
  function qr(e, r, t, n) {
216
- for (var o = -1, u = Gr(jr((r - e) / (t || 1)), 0), i = Array(u); u--; )
216
+ for (var o = -1, u = Fr(jr((r - e) / (t || 1)), 0), i = Array(u); u--; )
217
217
  i[n ? u : ++o] = e, e += t;
218
218
  return i;
219
219
  }
@@ -222,7 +222,7 @@ function Ar(e) {
222
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);
223
223
  };
224
224
  }
225
- var N = Ar(), L = Ne(function(e, r) {
225
+ var N = Ar(), C = Ne(function(e, r) {
226
226
  if (e == null)
227
227
  return [];
228
228
  var t = r.length;
@@ -230,7 +230,7 @@ var N = Ar(), L = Ne(function(e, r) {
230
230
  }), Yr = 0;
231
231
  function re(e) {
232
232
  var r = ++Yr;
233
- return Ze(e) + r;
233
+ return We(e) + r;
234
234
  }
235
235
  function Br(e, r, t) {
236
236
  for (var n = -1, o = e.length, u = r.length, i = {}; ++n < o; ) {
@@ -240,7 +240,7 @@ function Br(e, r, t) {
240
240
  return i;
241
241
  }
242
242
  function Dr(e, r) {
243
- return Br(e || [], r || [], Te);
243
+ return Br(e || [], r || [], Re);
244
244
  }
245
245
  class zr {
246
246
  constructor() {
@@ -269,18 +269,18 @@ function Ur(e, r) {
269
269
  if (e !== "_next" && e !== "_prev")
270
270
  return r;
271
271
  }
272
- var Kr = ur(1);
273
- function Zr(e, r) {
272
+ var Qr = ur(1);
273
+ function Wr(e, r) {
274
274
  if (e.nodeCount() <= 1)
275
275
  return [];
276
- var t = Jr(e, r || Kr), n = Hr(t.graph, t.buckets, t.zeroIdx);
276
+ var t = Jr(e, r || Qr), n = Zr(t.graph, t.buckets, t.zeroIdx);
277
277
  return _(
278
278
  m(n, function(o) {
279
279
  return e.outEdges(o.v, o.w);
280
280
  })
281
281
  );
282
282
  }
283
- function Hr(e, r, t) {
283
+ function Zr(e, r, t) {
284
284
  for (var n = [], o = r[r.length - 1], u = r[0], i; e.nodeCount(); ) {
285
285
  for (; i = u.dequeue(); )
286
286
  B(e, r, t, i);
@@ -300,10 +300,10 @@ function B(e, r, t, n, o) {
300
300
  var u = o ? [] : void 0;
301
301
  return f(e.inEdges(n.v), function(i) {
302
302
  var a = e.edge(i), d = e.node(i.v);
303
- o && u.push({ v: i.v, w: i.w }), d.out -= a, H(r, t, d);
303
+ o && u.push({ v: i.v, w: i.w }), d.out -= a, Z(r, t, d);
304
304
  }), f(e.outEdges(n.v), function(i) {
305
305
  var a = e.edge(i), d = i.w, c = e.node(d);
306
- c.in -= a, H(r, t, c);
306
+ c.in -= a, Z(r, t, c);
307
307
  }), e.removeNode(n.v), u;
308
308
  }
309
309
  function Jr(e, r) {
@@ -318,14 +318,14 @@ function Jr(e, r) {
318
318
  return new zr();
319
319
  }), i = n + 1;
320
320
  return f(t.nodes(), function(a) {
321
- H(u, i, t.node(a));
321
+ Z(u, i, t.node(a));
322
322
  }), { graph: t, buckets: u, zeroIdx: i };
323
323
  }
324
- function H(e, r, t) {
324
+ function Z(e, r, t) {
325
325
  t.out ? t.in ? e[t.out - t.in + r].enqueue(t) : e[e.length - 1].enqueue(t) : e[0].enqueue(t);
326
326
  }
327
- function Wr(e) {
328
- var r = e.graph().acyclicer === "greedy" ? Zr(e, t(e)) : Xr(e);
327
+ function Kr(e) {
328
+ var r = e.graph().acyclicer === "greedy" ? Wr(e, t(e)) : Xr(e);
329
329
  f(r, function(n) {
330
330
  var o = e.edge(n);
331
331
  e.removeEdge(n), o.forwardName = n.name, o.reversed = !0, e.setEdge(n.w, n.v, o, re("rev"));
@@ -345,7 +345,7 @@ function Xr(e) {
345
345
  }
346
346
  return f(e.nodes(), o), r;
347
347
  }
348
- function Qr(e) {
348
+ function Hr(e) {
349
349
  f(e.edges(), function(r) {
350
350
  var t = e.edge(r);
351
351
  if (t.reversed) {
@@ -355,7 +355,7 @@ function Qr(e) {
355
355
  }
356
356
  });
357
357
  }
358
- function T(e, r, t, n) {
358
+ function R(e, r, t, n) {
359
359
  var o;
360
360
  do
361
361
  o = re(n);
@@ -374,7 +374,7 @@ function et(e) {
374
374
  });
375
375
  }), r;
376
376
  }
377
- function Ce(e) {
377
+ function $e(e) {
378
378
  var r = new y({ multigraph: e.isMultigraph() }).setGraph(e.graph());
379
379
  return f(e.nodes(), function(t) {
380
380
  e.children(t).length || r.setNode(t, e.node(t));
@@ -390,7 +390,7 @@ function fe(e, r) {
390
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 };
391
391
  }
392
392
  function Y(e) {
393
- var r = m(N(Le(e) + 1), function() {
393
+ var r = m(N(Ce(e) + 1), function() {
394
394
  return [];
395
395
  });
396
396
  return f(e.nodes(), function(t) {
@@ -431,9 +431,9 @@ function se(e, r, t, n) {
431
431
  width: 0,
432
432
  height: 0
433
433
  };
434
- return arguments.length >= 4 && (o.rank = t, o.order = n), T(e, "border", o, r);
434
+ return arguments.length >= 4 && (o.rank = t, o.order = n), R(e, "border", o, r);
435
435
  }
436
- function Le(e) {
436
+ function Ce(e) {
437
437
  return x(
438
438
  m(e.nodes(), function(r) {
439
439
  var t = e.node(r).rank;
@@ -471,7 +471,7 @@ function ut(e) {
471
471
  f(e.children(), r);
472
472
  }
473
473
  function ve(e, r, t, n, o, u) {
474
- var i = { width: 0, height: 0, rank: u, borderType: r }, a = o[r][u - 1], d = T(e, "border", i, t);
474
+ var i = { width: 0, height: 0, rank: u, borderType: r }, a = o[r][u - 1], d = R(e, "border", i, t);
475
475
  o[r][u] = d, e.setParent(d, n), a && e.setEdge(a, d, { weight: 1 });
476
476
  }
477
477
  function at(e) {
@@ -533,7 +533,7 @@ function vt(e, r) {
533
533
  edgeLabel: a,
534
534
  edgeObj: r,
535
535
  rank: n
536
- }, c = T(e, "edge", s, "_d"), n === d && (s.width = a.width, s.height = a.height, s.dummy = "edge-label", s.labelpos = a.labelpos), e.setEdge(t, c, { weight: a.weight }, i), v === 0 && e.graph().dummyChains.push(c), t = c;
536
+ }, c = R(e, "edge", s, "_d"), n === d && (s.width = a.width, s.height = a.height, s.dummy = "edge-label", s.labelpos = a.labelpos), e.setEdge(t, c, { weight: a.weight }, i), v === 0 && e.graph().dummyChains.push(c), t = c;
537
537
  e.setEdge(t, o, { weight: a.weight }, i);
538
538
  }
539
539
  }
@@ -562,21 +562,21 @@ function te(e) {
562
562
  }
563
563
  f(e.sources(), t);
564
564
  }
565
- function $(e, r) {
565
+ function L(e, r) {
566
566
  return e.node(r.w).rank - e.node(r.v).rank - e.edge(r).minlen;
567
567
  }
568
568
  function Oe(e) {
569
569
  var r = new y({ directed: !1 }), t = e.nodes()[0], n = e.nodeCount();
570
570
  r.setNode(t, {});
571
571
  for (var o, u; ht(r, e) < n; )
572
- o = lt(r, e), u = r.hasNode(o.v) ? $(e, o) : -$(e, o), pt(r, e, u);
572
+ o = lt(r, e), u = r.hasNode(o.v) ? L(e, o) : -L(e, o), pt(r, e, u);
573
573
  return r;
574
574
  }
575
575
  function ht(e, r) {
576
576
  function t(n) {
577
577
  f(r.nodeEdges(n), function(o) {
578
578
  var u = o.v, i = n === u ? o.w : u;
579
- !e.hasNode(i) && !$(r, o) && (e.setNode(i, {}), e.setEdge(n, i, {}), t(i));
579
+ !e.hasNode(i) && !L(r, o) && (e.setNode(i, {}), e.setEdge(n, i, {}), t(i));
580
580
  });
581
581
  }
582
582
  return f(e.nodes(), t), e.nodeCount();
@@ -584,7 +584,7 @@ function ht(e, r) {
584
584
  function lt(e, r) {
585
585
  return ee(r.edges(), function(t) {
586
586
  if (e.hasNode(t.v) !== e.hasNode(t.w))
587
- return $(r, t);
587
+ return L(r, t);
588
588
  });
589
589
  }
590
590
  function pt(e, r, t) {
@@ -593,7 +593,7 @@ function pt(e, r, t) {
593
593
  });
594
594
  }
595
595
  function Pe(e, r, t) {
596
- W(r) || (r = [r]);
596
+ K(r) || (r = [r]);
597
597
  var n = (e.isDirected() ? e.successors : e.neighbors).bind(e), o = [], u = {};
598
598
  return f(r, function(i) {
599
599
  if (!e.hasNode(i))
@@ -614,15 +614,15 @@ function wt(e, r) {
614
614
  }
615
615
  k.initLowLimValues = oe;
616
616
  k.initCutValues = ne;
617
- k.calcCutValue = Fe;
618
- k.leaveEdge = Ge;
617
+ k.calcCutValue = Ge;
618
+ k.leaveEdge = Fe;
619
619
  k.enterEdge = qe;
620
620
  k.exchangeEdges = Ae;
621
621
  function k(e) {
622
622
  e = et(e), te(e);
623
623
  var r = Oe(e);
624
624
  oe(r), ne(r, e);
625
- for (var t, n; t = Ge(r); )
625
+ for (var t, n; t = Fe(r); )
626
626
  n = qe(r, e, t), Ae(r, e, t, n);
627
627
  }
628
628
  function ne(e, r) {
@@ -633,9 +633,9 @@ function ne(e, r) {
633
633
  }
634
634
  function bt(e, r, t) {
635
635
  var n = e.node(t), o = n.parent;
636
- e.edge(t, o).cutvalue = Fe(e, r, t);
636
+ e.edge(t, o).cutvalue = Ge(e, r, t);
637
637
  }
638
- function Fe(e, r, t) {
638
+ function Ge(e, r, t) {
639
639
  var n = e.node(t), o = n.parent, u = !0, i = r.edge(t, o), a = 0;
640
640
  return i || (u = !1, i = r.edge(o, t)), a = i.weight, f(r.nodeEdges(t), function(d) {
641
641
  var c = d.v === t, s = c ? d.w : d.v;
@@ -657,7 +657,7 @@ function je(e, r, t, n, o) {
657
657
  p(r, a) || (t = je(e, r, t, a, n));
658
658
  }), i.low = u, i.lim = t++, o ? i.parent = o : delete i.parent, t;
659
659
  }
660
- function Ge(e) {
660
+ function Fe(e) {
661
661
  return X(e.edges(), function(r) {
662
662
  return e.edge(r).cutvalue < 0;
663
663
  });
@@ -667,11 +667,11 @@ function qe(e, r, t) {
667
667
  r.hasEdge(n, o) || (n = t.w, o = t.v);
668
668
  var u = e.node(n), i = e.node(o), a = u, d = !1;
669
669
  u.lim > i.lim && (a = i, d = !0);
670
- var c = C(r.edges(), function(s) {
670
+ var c = $(r.edges(), function(s) {
671
671
  return d === he(e, e.node(s.v), a) && d !== he(e, e.node(s.w), a);
672
672
  });
673
673
  return ee(c, function(s) {
674
- return $(r, s);
674
+ return L(r, s);
675
675
  });
676
676
  }
677
677
  function Ae(e, r, t, n) {
@@ -716,11 +716,11 @@ function le(e) {
716
716
  k(e);
717
717
  }
718
718
  function It(e) {
719
- var r = T(e, "root", {}, "_root"), t = _t(e), n = x(E(t)) - 1, o = 2 * n + 1;
719
+ var r = R(e, "root", {}, "_root"), t = _t(e), n = x(E(t)) - 1, o = 2 * n + 1;
720
720
  e.graph().nestingRoot = r, f(e.edges(), function(i) {
721
721
  e.edge(i).minlen *= o;
722
722
  });
723
- var u = Tt(e) + 1;
723
+ var u = Rt(e) + 1;
724
724
  f(e.children(), function(i) {
725
725
  Ye(e, r, o, u, n, t, i);
726
726
  }), e.graph().nodeRankFactor = o;
@@ -734,14 +734,14 @@ function Ye(e, r, t, n, o, u, i) {
734
734
  var d = se(e, "_bt"), c = se(e, "_bb"), s = e.node(i);
735
735
  e.setParent(d, i), s.borderTop = d, e.setParent(c, i), s.borderBottom = c, f(a, function(v) {
736
736
  Ye(e, r, t, n, o, u, v);
737
- var g = e.node(v), h = g.borderTop ? g.borderTop : v, l = g.borderBottom ? g.borderBottom : v, w = g.borderTop ? n : 2 * n, R = h !== l ? 1 : o - u[i] + 1;
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;
738
738
  e.setEdge(d, h, {
739
739
  weight: w,
740
- minlen: R,
740
+ minlen: T,
741
741
  nestingEdge: !0
742
742
  }), e.setEdge(l, c, {
743
743
  weight: w,
744
- minlen: R,
744
+ minlen: T,
745
745
  nestingEdge: !0
746
746
  });
747
747
  }), e.parent(i) || e.setEdge(r, d, { weight: 0, minlen: o + u[i] });
@@ -758,7 +758,7 @@ function _t(e) {
758
758
  t(n, 1);
759
759
  }), r;
760
760
  }
761
- function Tt(e) {
761
+ function Rt(e) {
762
762
  return q(
763
763
  e.edges(),
764
764
  function(r, t) {
@@ -767,7 +767,7 @@ function Tt(e) {
767
767
  0
768
768
  );
769
769
  }
770
- function Rt(e) {
770
+ function Tt(e) {
771
771
  var r = e.graph();
772
772
  e.removeNode(r.nestingRoot), delete r.nestingRoot, f(e.edges(), function(t) {
773
773
  var n = e.edge(t);
@@ -786,8 +786,8 @@ function Mt(e, r, t) {
786
786
  }
787
787
  });
788
788
  }
789
- function $t(e, r, t) {
790
- var n = Ct(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) {
791
791
  return e.node(u);
792
792
  });
793
793
  return f(e.nodes(), function(u) {
@@ -801,12 +801,12 @@ function $t(e, r, t) {
801
801
  }));
802
802
  }), o;
803
803
  }
804
- function Ct(e) {
804
+ function $t(e) {
805
805
  for (var r; e.hasNode(r = re("_root")); )
806
806
  ;
807
807
  return r;
808
808
  }
809
- function Lt(e, r) {
809
+ function Ct(e, r) {
810
810
  for (var t = 0, n = 1; n < r.length; ++n)
811
811
  t += St(e, r[n - 1], r[n]);
812
812
  return t;
@@ -819,7 +819,7 @@ function St(e, r, t) {
819
819
  })
820
820
  ), o = _(
821
821
  m(r, function(c) {
822
- return L(
822
+ return C(
823
823
  m(e.outEdges(c), function(s) {
824
824
  return { pos: n[s.w], weight: e.edge(s).weight };
825
825
  }),
@@ -845,7 +845,7 @@ function St(e, r, t) {
845
845
  ), d;
846
846
  }
847
847
  function Ot(e) {
848
- var r = {}, t = C(e.nodes(), function(a) {
848
+ var r = {}, t = $(e.nodes(), function(a) {
849
849
  return !e.children(a).length;
850
850
  }), n = x(
851
851
  m(t, function(a) {
@@ -861,7 +861,7 @@ function Ot(e) {
861
861
  o[d.rank].push(a), f(e.successors(a), u);
862
862
  }
863
863
  }
864
- var i = L(t, function(a) {
864
+ var i = C(t, function(a) {
865
865
  return e.node(a).rank;
866
866
  });
867
867
  return f(i, u), o;
@@ -905,12 +905,12 @@ function Vt(e, r) {
905
905
  var u = t[o.v], i = t[o.w];
906
906
  !b(u) && !b(i) && (i.indegree++, u.out.push(t[o.w]));
907
907
  });
908
- var n = C(t, function(o) {
908
+ var n = $(t, function(o) {
909
909
  return !o.indegree;
910
910
  });
911
- return Ft(n);
911
+ return Gt(n);
912
912
  }
913
- function Ft(e) {
913
+ function Gt(e) {
914
914
  var r = [];
915
915
  function t(u) {
916
916
  return function(i) {
@@ -927,11 +927,11 @@ function Ft(e) {
927
927
  r.push(o), f(o.in.reverse(), t(o)), f(o.out, n(o));
928
928
  }
929
929
  return m(
930
- C(r, function(u) {
930
+ $(r, function(u) {
931
931
  return !u.merged;
932
932
  }),
933
933
  function(u) {
934
- return G(u, ["vs", "i", "barycenter", "weight"]);
934
+ return F(u, ["vs", "i", "barycenter", "weight"]);
935
935
  }
936
936
  );
937
937
  }
@@ -939,10 +939,10 @@ function jt(e, r) {
939
939
  var t = 0, n = 0;
940
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;
941
941
  }
942
- function Gt(e, r) {
942
+ function Ft(e, r) {
943
943
  var t = nt(e, function(s) {
944
944
  return p(s, "barycenter");
945
- }), n = t.lhs, o = L(t.rhs, function(s) {
945
+ }), n = t.lhs, o = C(t.rhs, function(s) {
946
946
  return -s.i;
947
947
  }), u = [], i = 0, a = 0, d = 0;
948
948
  n.sort(qt(!!r)), d = pe(u, o, d), f(n, function(s) {
@@ -963,7 +963,7 @@ function qt(e) {
963
963
  }
964
964
  function Be(e, r, t, n) {
965
965
  var o = e.children(r), u = e.node(r), i = u ? u.borderLeft : void 0, a = u ? u.borderRight : void 0, d = {};
966
- i && (o = C(o, function(l) {
966
+ i && (o = $(o, function(l) {
967
967
  return l !== i && l !== a;
968
968
  }));
969
969
  var c = Pt(e, o);
@@ -975,7 +975,7 @@ function Be(e, r, t, n) {
975
975
  });
976
976
  var s = Vt(c, t);
977
977
  At(s, d);
978
- var v = Gt(s, n);
978
+ var v = Ft(s, n);
979
979
  if (i && (v.vs = _([i, v.vs, a]), e.predecessors(i).length)) {
980
980
  var g = e.node(e.predecessors(i)[0]), h = e.node(e.predecessors(a)[0]);
981
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;
@@ -995,18 +995,18 @@ function Yt(e, r) {
995
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);
996
996
  }
997
997
  function Bt(e) {
998
- var r = Le(e), t = me(e, N(1, r + 1), "inEdges"), n = me(e, N(r - 1, -1, -1), "outEdges"), o = Ot(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
999
  we(e, o);
1000
1000
  for (var u = Number.POSITIVE_INFINITY, i, a = 0, d = 0; d < 4; ++a, ++d) {
1001
1001
  Dt(a % 2 ? t : n, a % 4 >= 2), o = Y(e);
1002
- var c = Lt(e, o);
1002
+ var c = Ct(e, o);
1003
1003
  c < u && (d = 0, i = xr(o), u = c);
1004
1004
  }
1005
1005
  we(e, i);
1006
1006
  }
1007
1007
  function me(e, r, t) {
1008
1008
  return m(r, function(n) {
1009
- return $t(e, n, t);
1009
+ return Lt(e, n, t);
1010
1010
  });
1011
1011
  }
1012
1012
  function Dt(e, r) {
@@ -1026,7 +1026,7 @@ function we(e, r) {
1026
1026
  });
1027
1027
  }
1028
1028
  function zt(e) {
1029
- var r = Kt(e);
1029
+ var r = Qt(e);
1030
1030
  f(e.graph().dummyChains, function(t) {
1031
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; ) {
1032
1032
  if (n = e.node(t), s) {
@@ -1053,7 +1053,7 @@ function Ut(e, r, t, n) {
1053
1053
  u.push(d);
1054
1054
  return { path: o.concat(u.reverse()), lca: c };
1055
1055
  }
1056
- function Kt(e) {
1056
+ function Qt(e) {
1057
1057
  var r = {}, t = 0;
1058
1058
  function n(o) {
1059
1059
  var u = t;
@@ -1061,7 +1061,7 @@ function Kt(e) {
1061
1061
  }
1062
1062
  return f(e.children(), n), r;
1063
1063
  }
1064
- function Zt(e, r) {
1064
+ function Wt(e, r) {
1065
1065
  var t = {};
1066
1066
  function n(o, u) {
1067
1067
  var i = 0, a = 0, d = o.length, c = j(u);
@@ -1069,15 +1069,15 @@ function Zt(e, r) {
1069
1069
  var g = Jt(e, s), h = g ? e.node(g).order : d;
1070
1070
  (g || s === c) && (f(u.slice(a, v + 1), function(l) {
1071
1071
  f(e.predecessors(l), function(w) {
1072
- var R = e.node(w), ie = R.order;
1073
- (ie < i || h < ie) && !(R.dummy && e.node(l).dummy) && De(t, w, l);
1072
+ var T = e.node(w), ie = T.order;
1073
+ (ie < i || h < ie) && !(T.dummy && e.node(l).dummy) && De(t, w, l);
1074
1074
  });
1075
1075
  }), a = v + 1, i = h);
1076
1076
  }), u;
1077
1077
  }
1078
1078
  return q(r, n), t;
1079
1079
  }
1080
- function Ht(e, r) {
1080
+ function Zt(e, r) {
1081
1081
  var t = {};
1082
1082
  function n(u, i, a, d, c) {
1083
1083
  var s;
@@ -1114,7 +1114,7 @@ function De(e, r, t) {
1114
1114
  var o = e[r];
1115
1115
  o || (e[r] = o = {}), o[t] = !0;
1116
1116
  }
1117
- function Wt(e, r, t) {
1117
+ function Kt(e, r, t) {
1118
1118
  if (r > t) {
1119
1119
  var n = r;
1120
1120
  r = t, t = n;
@@ -1132,18 +1132,18 @@ function Xt(e, r, t, n) {
1132
1132
  f(a, function(c) {
1133
1133
  var s = n(c);
1134
1134
  if (s.length) {
1135
- s = L(s, function(w) {
1135
+ s = C(s, function(w) {
1136
1136
  return i[w];
1137
1137
  });
1138
1138
  for (var v = (s.length - 1) / 2, g = Math.floor(v), h = Math.ceil(v); g <= h; ++g) {
1139
1139
  var l = s[g];
1140
- 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]);
1141
1141
  }
1142
1142
  }
1143
1143
  });
1144
1144
  }), { root: o, align: u };
1145
1145
  }
1146
- function Qt(e, r, t, n, o) {
1146
+ function Ht(e, r, t, n, o) {
1147
1147
  var u = {}, i = en(e, r, t, o), a = o ? "borderLeft" : "borderRight";
1148
1148
  function d(v, g) {
1149
1149
  for (var h = i.nodes(), l = h.pop(), w = {}; l; )
@@ -1181,7 +1181,7 @@ function en(e, r, t, n) {
1181
1181
  function rn(e, r) {
1182
1182
  return ee(E(r), function(t) {
1183
1183
  var n = Number.NEGATIVE_INFINITY, o = Number.POSITIVE_INFINITY;
1184
- return Rr(t, function(u, i) {
1184
+ return Tr(t, function(u, i) {
1185
1185
  var a = an(e, i) / 2;
1186
1186
  n = Math.max(u + a, n), o = Math.min(u - a, o);
1187
1187
  }), n - o;
@@ -1205,18 +1205,18 @@ function nn(e, r) {
1205
1205
  return A(e.ul, function(t, n) {
1206
1206
  if (r)
1207
1207
  return e[r.toLowerCase()][n];
1208
- var o = L(m(e, n));
1208
+ var o = C(m(e, n));
1209
1209
  return (o[1] + o[2]) / 2;
1210
1210
  });
1211
1211
  }
1212
1212
  function on(e) {
1213
- var r = Y(e), t = Z(Zt(e, r), Ht(e, r)), n = {}, o;
1213
+ var r = Y(e), t = W(Wt(e, r), Zt(e, r)), n = {}, o;
1214
1214
  f(["u", "d"], function(i) {
1215
1215
  o = i === "u" ? r : E(r).reverse(), f(["l", "r"], function(a) {
1216
1216
  a === "r" && (o = m(o, function(v) {
1217
1217
  return E(v).reverse();
1218
1218
  }));
1219
- var d = (i === "u" ? e.predecessors : e.successors).bind(e), c = Xt(e, o, t, d), s = Qt(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");
1220
1220
  a === "r" && (s = A(s, function(v) {
1221
1221
  return -v;
1222
1222
  })), n[i + a] = s;
@@ -1253,7 +1253,7 @@ function an(e, r) {
1253
1253
  return e.node(r).width;
1254
1254
  }
1255
1255
  function dn(e) {
1256
- e = Ce(e), cn(e), Mr(on(e), function(r, t) {
1256
+ e = $e(e), cn(e), Mr(on(e), function(r, t) {
1257
1257
  e.node(t).x = r;
1258
1258
  });
1259
1259
  }
@@ -1287,19 +1287,19 @@ function fn(e, r) {
1287
1287
  r(" makeSpaceForEdgeLabels", function() {
1288
1288
  xn(e);
1289
1289
  }), r(" removeSelfEdges", function() {
1290
- $n(e);
1290
+ Ln(e);
1291
1291
  }), r(" acyclic", function() {
1292
- Wr(e);
1292
+ Kr(e);
1293
1293
  }), r(" nestingGraph.run", function() {
1294
1294
  It(e);
1295
1295
  }), r(" rank", function() {
1296
- kt(Ce(e));
1296
+ kt($e(e));
1297
1297
  }), r(" injectEdgeLabelProxies", function() {
1298
1298
  kn(e);
1299
1299
  }), r(" removeEmptyRanks", function() {
1300
1300
  tt(e);
1301
1301
  }), r(" nestingGraph.cleanup", function() {
1302
- Rt(e);
1302
+ Tt(e);
1303
1303
  }), r(" normalizeRanks", function() {
1304
1304
  rt(e);
1305
1305
  }), r(" assignRankMinMax", function() {
@@ -1315,19 +1315,19 @@ function fn(e, r) {
1315
1315
  }), r(" order", function() {
1316
1316
  Bt(e);
1317
1317
  }), r(" insertSelfEdges", function() {
1318
- Cn(e);
1318
+ $n(e);
1319
1319
  }), r(" adjustCoordinateSystem", function() {
1320
1320
  at(e);
1321
1321
  }), r(" position", function() {
1322
1322
  dn(e);
1323
1323
  }), r(" positionSelfEdges", function() {
1324
- Ln(e);
1324
+ Cn(e);
1325
1325
  }), r(" removeBorderNodes", function() {
1326
1326
  Mn(e);
1327
1327
  }), r(" normalize.undo", function() {
1328
1328
  gt(e);
1329
1329
  }), r(" fixupEdgeLabelCoords", function() {
1330
- Tn(e);
1330
+ Rn(e);
1331
1331
  }), r(" undoCoordinateSystem", function() {
1332
1332
  dt(e);
1333
1333
  }), r(" translateGraph", function() {
@@ -1335,9 +1335,9 @@ function fn(e, r) {
1335
1335
  }), r(" assignNodeIntersects", function() {
1336
1336
  _n(e);
1337
1337
  }), r(" reversePoints", function() {
1338
- Rn(e);
1338
+ Tn(e);
1339
1339
  }), r(" acyclic.undo", function() {
1340
- Qr(e);
1340
+ Hr(e);
1341
1341
  });
1342
1342
  }
1343
1343
  function sn(e, r) {
@@ -1358,17 +1358,17 @@ var vn = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], gn = { ranksep
1358
1358
  labelpos: "r"
1359
1359
  }, bn = ["labelpos"];
1360
1360
  function yn(e) {
1361
- var r = new y({ multigraph: !0, compound: !0 }), t = K(e.graph());
1361
+ var r = new y({ multigraph: !0, compound: !0 }), t = Q(e.graph());
1362
1362
  return r.setGraph(
1363
- Z({}, gn, U(t, vn), G(t, hn))
1363
+ W({}, gn, U(t, vn), F(t, hn))
1364
1364
  ), f(e.nodes(), function(n) {
1365
- var o = K(e.node(n));
1365
+ var o = Q(e.node(n));
1366
1366
  r.setNode(n, Nr(U(o, ln), pn)), r.setParent(n, e.parent(n));
1367
1367
  }), f(e.edges(), function(n) {
1368
- var o = K(e.edge(n));
1368
+ var o = Q(e.edge(n));
1369
1369
  r.setEdge(
1370
1370
  n,
1371
- Z({}, wn, U(o, mn), G(o, bn))
1371
+ W({}, wn, U(o, mn), F(o, bn))
1372
1372
  );
1373
1373
  }), r;
1374
1374
  }
@@ -1384,7 +1384,7 @@ function kn(e) {
1384
1384
  var t = e.edge(r);
1385
1385
  if (t.width && t.height) {
1386
1386
  var n = e.node(r.v), o = e.node(r.w), u = { rank: (o.rank - n.rank) / 2 + n.rank, e: r };
1387
- T(e, "edge-proxy", u, "_ep");
1387
+ R(e, "edge-proxy", u, "_ep");
1388
1388
  }
1389
1389
  });
1390
1390
  }
@@ -1428,7 +1428,7 @@ function _n(e) {
1428
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));
1429
1429
  });
1430
1430
  }
1431
- function Tn(e) {
1431
+ function Rn(e) {
1432
1432
  f(e.edges(), function(r) {
1433
1433
  var t = e.edge(r);
1434
1434
  if (p(t, "x"))
@@ -1442,7 +1442,7 @@ function Tn(e) {
1442
1442
  }
1443
1443
  });
1444
1444
  }
1445
- function Rn(e) {
1445
+ function Tn(e) {
1446
1446
  f(e.edges(), function(r) {
1447
1447
  var t = e.edge(r);
1448
1448
  t.reversed && t.points.reverse();
@@ -1458,7 +1458,7 @@ function Mn(e) {
1458
1458
  e.node(r).dummy === "border" && e.removeNode(r);
1459
1459
  });
1460
1460
  }
1461
- function $n(e) {
1461
+ function Ln(e) {
1462
1462
  f(e.edges(), function(r) {
1463
1463
  if (r.v === r.w) {
1464
1464
  var t = e.node(r.v);
@@ -1466,14 +1466,14 @@ function $n(e) {
1466
1466
  }
1467
1467
  });
1468
1468
  }
1469
- function Cn(e) {
1469
+ function $n(e) {
1470
1470
  var r = Y(e);
1471
1471
  f(r, function(t) {
1472
1472
  var n = 0;
1473
1473
  f(t, function(o, u) {
1474
1474
  var i = e.node(o);
1475
1475
  i.order = u + n, f(i.selfEdges, function(a) {
1476
- T(
1476
+ R(
1477
1477
  e,
1478
1478
  "selfedge",
1479
1479
  {
@@ -1490,7 +1490,7 @@ function Cn(e) {
1490
1490
  });
1491
1491
  });
1492
1492
  }
1493
- function Ln(e) {
1493
+ function Cn(e) {
1494
1494
  f(e.nodes(), function(r) {
1495
1495
  var t = e.node(r);
1496
1496
  if (t.dummy === "selfedge") {
@@ -1506,9 +1506,9 @@ function Ln(e) {
1506
1506
  });
1507
1507
  }
1508
1508
  function U(e, r) {
1509
- return A(G(e, r), Number);
1509
+ return A(F(e, r), Number);
1510
1510
  }
1511
- function K(e) {
1511
+ function Q(e) {
1512
1512
  var r = {};
1513
1513
  return f(e, function(t, n) {
1514
1514
  r[n.toLowerCase()] = t;
@@ -1518,7 +1518,7 @@ export {
1518
1518
  Pn as A,
1519
1519
  Nr as L,
1520
1520
  N,
1521
- G as V,
1521
+ F as V,
1522
1522
  re as e,
1523
1523
  m
1524
1524
  };