@kong-ui-public/entities-plugins 9.77.3 → 9.77.4

package/dist/entities-plugins.es.js

@@ -17373,12 +17373,189 @@ const fP = { render: dP }, pP = {
   "OPTIONS",
   "TRACE",
   "CONNECT"
-], Um = "application/x-datakit+json";
-function bP(e) {
+], Um = "application/x-datakit+json", ro = {
+  padding: 80,
+  gaps: {
+    nodes: 40,
+    edges: 80,
+    ranks: 40
+  }
+}, bP = 1600, wP = 1.2, EP = 0, Hm = Symbol("confirm-modal"), Bi = "{key}", Hn = {
+  "kong.client.consumer": {
+    dataType: "object",
+    writable: !1,
+    readable: !0
+  },
+  "kong.client.consumer_groups": {
+    dataType: "array",
+    writable: !1,
+    readable: !0
+  },
+  "kong.client.credential": {
+    dataType: "object",
+    writable: !1,
+    readable: !0
+  },
+  "kong.client.get_identity_realm_source": {
+    dataType: "object",
+    writable: !1,
+    readable: !0
+  },
+  "kong.client.forwarded_ip": {
+    dataType: "string",
+    writable: !1,
+    readable: !0
+  },
+  "kong.client.forwarded_port": {
+    dataType: "number",
+    writable: !1,
+    readable: !0
+  },
+  "kong.client.ip": {
+    dataType: "string",
+    writable: !1,
+    readable: !0
+  },
+  "kong.client.port": {
+    dataType: "number",
+    writable: !1,
+    readable: !0
+  },
+  "kong.client.protocol": {
+    dataType: "string",
+    writable: !1,
+    readable: !0
+  },
+  "kong.request.forwarded_host": {
+    dataType: "string",
+    writable: !1,
+    readable: !0
+  },
+  "kong.request.forwarded_port": {
+    dataType: "number",
+    writable: !1,
+    readable: !0
+  },
+  "kong.request.forwarded_scheme": {
+    dataType: "string",
+    writable: !1,
+    readable: !0
+  },
+  "kong.request.port": {
+    dataType: "number",
+    writable: !1,
+    readable: !0
+  },
+  "kong.response.source": {
+    dataType: "string",
+    writable: !1,
+    readable: !0
+  },
+  "kong.router.route": {
+    dataType: "object",
+    writable: !1,
+    readable: !0
+  },
+  "kong.route_id": {
+    dataType: "string",
+    writable: !1,
+    readable: !0
+  },
+  "kong.route_name": {
+    dataType: "string",
+    writable: !1,
+    readable: !0
+  },
+  "kong.router.service": {
+    dataType: "object",
+    writable: !1,
+    readable: !0
+  },
+  "kong.service_name": {
+    dataType: "string",
+    writable: !1,
+    readable: !0
+  },
+  "kong.service_id": {
+    dataType: "string",
+    writable: !1,
+    readable: !0
+  },
+  "kong.service.response.status": {
+    dataType: "number",
+    writable: !1,
+    readable: !0
+  },
+  "kong.version": {
+    dataType: "string",
+    writable: !1,
+    readable: !0
+  },
+  "kong.node.id": {
+    dataType: "string",
+    writable: !1,
+    readable: !0
+  },
+  "kong.configuration.{key}": {
+    dataType: "any",
+    writable: !1,
+    readable: !0
+  },
+  "kong.service.target": {
+    dataType: "string ({host}:{port})",
+    writable: !0,
+    readable: !1
+  },
+  "kong.service.request_scheme": {
+    dataType: "string ({scheme})",
+    writable: !0,
+    readable: !1
+  },
+  "kong.ctx.plugin.{key}": {
+    dataType: "any",
+    writable: !0,
+    readable: !0
+  },
+  "kong.ctx.shared.{key}": {
+    dataType: "any",
+    writable: !0,
+    readable: !0
+  }
+}, ka = Object.keys(Hn).filter((e) => e.includes(Bi)).map((e) => e.replace(Bi, ""));
+function zs(e) {
+  if (!e || !Do(e)) return;
+  const t = ka.find((n) => e.startsWith(n));
+  if (t)
+    return e.slice(t.length).replace(Bi, "");
+}
+function fo(e) {
+  if (!e) return null;
+  const t = ka.find((n) => e.startsWith(n));
+  return t || e;
+}
+function Do(e) {
+  return e ? ka.some((t) => e.startsWith(t)) : !1;
+}
+function Gm(e) {
+  return e ? Do(e) ? fo(e) + Bi : e : null;
+}
+function zl(e) {
+  var n;
+  if (!e) return !1;
+  const t = Gm(e);
+  return t ? ((n = Hn[t]) == null ? void 0 : n.readable) ?? !1 : !1;
+}
+function Us(e) {
+  var n;
+  if (!e) return !1;
+  const t = Gm(e);
+  return t ? ((n = Hn[t]) == null ? void 0 : n.writable) ?? !1 : !1;
+}
+function kP(e) {
   return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
 }
-var wP = "\0", Bn = "\0", id = "
";
-let EP = class {
+var CP = "\0", Bn = "\0", id = "
";
+let SP = class {
   constructor(t) {
     lt(this, "_isDirected", !0);
     lt(this, "_isMultigraph", !1);
@@ -17694,13 +17871,13 @@ let EP = class {
   setEdge() {
     var t, n, i, o, r = !1, a = arguments[0];
     typeof a == "object" && a !== null && "v" in a ? (t = a.v, n = a.w, i = a.name, arguments.length === 2 && (o = arguments[1], r = !0)) : (t = a, n = arguments[1], i = arguments[3], arguments.length > 2 && (o = arguments[2], r = !0)), t = "" + t, n = "" + n, i !== void 0 && (i = "" + i);
-    var s = fo(this._isDirected, t, n, i);
+    var s = po(this._isDirected, t, n, i);
     if (Object.hasOwn(this._edgeLabels, s))
       return r && (this._edgeLabels[s] = o), this;
     if (i !== void 0 && !this._isMultigraph)
       throw new Error("Cannot set a named edge when isMultigraph = false");
     this.setNode(t), this.setNode(n), this._edgeLabels[s] = r ? o : this._defaultEdgeLabelFn(t, n, i);
-    var l = kP(this._isDirected, t, n, i);
+    var l = xP(this._isDirected, t, n, i);
     return t = l.v, n = l.w, Object.freeze(l), this._edgeObjs[s] = l, od(this._preds[n], t), od(this._sucs[t], n), this._in[n][s] = l, this._out[t][s] = l, this._edgeCount++, this;
   }
   /**
@@ -17708,7 +17885,7 @@ let EP = class {
    * Complexity: O(1).
    */
   edge(t, n, i) {
-    var o = arguments.length === 1 ? Xa(this._isDirected, arguments[0]) : fo(this._isDirected, t, n, i);
+    var o = arguments.length === 1 ? Xa(this._isDirected, arguments[0]) : po(this._isDirected, t, n, i);
     return this._edgeLabels[o];
   }
   /**
@@ -17724,7 +17901,7 @@ let EP = class {
    * Complexity: O(1).
    */
   hasEdge(t, n, i) {
-    var o = arguments.length === 1 ? Xa(this._isDirected, arguments[0]) : fo(this._isDirected, t, n, i);
+    var o = arguments.length === 1 ? Xa(this._isDirected, arguments[0]) : po(this._isDirected, t, n, i);
     return Object.hasOwn(this._edgeLabels, o);
   }
   /**
@@ -17732,7 +17909,7 @@ let EP = class {
    * Complexity: O(1).
    */
   removeEdge(t, n, i) {
-    var o = arguments.length === 1 ? Xa(this._isDirected, arguments[0]) : fo(this._isDirected, t, n, i), r = this._edgeObjs[o];
+    var o = arguments.length === 1 ? Xa(this._isDirected, arguments[0]) : po(this._isDirected, t, n, i), r = this._edgeObjs[o];
     return r && (t = r.v, n = r.w, delete this._edgeLabels[o], delete this._edgeObjs[o], rd(this._preds[n], t), rd(this._sucs[t], n), delete this._in[n][o], delete this._out[t][o], this._edgeCount--), this;
   }
   /**
@@ -17776,15 +17953,15 @@ function od(e, t) {
 function rd(e, t) {
   --e[t] || delete e[t];
 }
-function fo(e, t, n, i) {
+function po(e, t, n, i) {
   var o = "" + t, r = "" + n;
   if (!e && o > r) {
     var a = o;
     o = r, r = a;
   }
-  return o + id + r + id + (i === void 0 ? wP : i);
+  return o + id + r + id + (i === void 0 ? CP : i);
 }
-function kP(e, t, n, i) {
+function xP(e, t, n, i) {
   var o = "" + t, r = "" + n;
   if (!e && o > r) {
     var a = o;
@@ -17794,49 +17971,49 @@ function kP(e, t, n, i) {
   return i && (s.name = i), s;
 }
 function Xa(e, t) {
-  return fo(e, t.v, t.w, t.name);
-}
-var zl = EP, CP = "2.2.4", SP = {
-  Graph: zl,
-  version: CP
-}, xP = zl, AP = {
-  write: TP,
-  read: NP
+  return po(e, t.v, t.w, t.name);
+}
+var Ul = SP, AP = "2.2.4", TP = {
+  Graph: Ul,
+  version: AP
+}, IP = Ul, $P = {
+  write: NP,
+  read: MP
 };
-function TP(e) {
+function NP(e) {
   var t = {
     options: {
       directed: e.isDirected(),
       multigraph: e.isMultigraph(),
       compound: e.isCompound()
     },
-    nodes: IP(e),
-    edges: $P(e)
+    nodes: OP(e),
+    edges: PP(e)
   };
   return e.graph() !== void 0 && (t.value = structuredClone(e.graph())), t;
 }
-function IP(e) {
+function OP(e) {
   return e.nodes().map(function(t) {
     var n = e.node(t), i = e.parent(t), o = { v: t };
     return n !== void 0 && (o.value = n), i !== void 0 && (o.parent = i), o;
   });
 }
-function $P(e) {
+function PP(e) {
   return e.edges().map(function(t) {
     var n = e.edge(t), i = { v: t.v, w: t.w };
     return t.name !== void 0 && (i.name = t.name), n !== void 0 && (i.value = n), i;
   });
 }
-function NP(e) {
-  var t = new xP(e.options).setGraph(e.value);
+function MP(e) {
+  var t = new IP(e.options).setGraph(e.value);
   return e.nodes.forEach(function(n) {
     t.setNode(n.v, n.value), n.parent && t.setParent(n.v, n.parent);
   }), e.edges.forEach(function(n) {
     t.setEdge({ v: n.v, w: n.w, name: n.name }, n.value);
   }), t;
 }
-var OP = PP;
-function PP(e) {
+var FP = RP;
+function RP(e) {
   var t = {}, n = [], i;
   function o(r) {
     Object.hasOwn(t, r) || (t[r] = !0, i.push(r), e.successors(r).forEach(o), e.predecessors(r).forEach(o));
@@ -17845,7 +18022,7 @@ function PP(e) {
     i = [], o(r), i.length && n.push(i);
   }), n;
 }
-let MP = class {
+let DP = class {
   constructor() {
     lt(this, "_arr", []);
     lt(this, "_keyIndices", {});
@@ -17940,19 +18117,19 @@ let MP = class {
     i[t] = a, i[n] = r, o[a.key] = t, o[r.key] = n;
   }
 };
-var Hm = MP, FP = Hm, Gm = DP, RP = () => 1;
-function DP(e, t, n, i) {
-  return LP(
+var Ym = DP, LP = Ym, Wm = BP, KP = () => 1;
+function BP(e, t, n, i) {
+  return VP(
     e,
     String(t),
-    n || RP,
+    n || KP,
     i || function(o) {
       return e.outEdges(o);
     }
   );
 }
-function LP(e, t, n, i) {
-  var o = {}, r = new FP(), a, s, l = function(u) {
+function VP(e, t, n, i) {
+  var o = {}, r = new LP(), a, s, l = function(u) {
     var d = u.v !== a ? u.v : u.w, c = o[d], f = n(u), m = s.distance + f;
     if (f < 0)
       throw new Error("dijkstra does not allow negative edge weights. Bad edge: " + u + " Weight: " + f);
@@ -17965,14 +18142,14 @@ function LP(e, t, n, i) {
     i(a).forEach(l);
   return o;
 }
-var KP = Gm, BP = VP;
-function VP(e, t, n) {
+var jP = Wm, qP = zP;
+function zP(e, t, n) {
   return e.nodes().reduce(function(i, o) {
-    return i[o] = KP(e, o, t, n), i;
+    return i[o] = jP(e, o, t, n), i;
   }, {});
 }
-var Ym = jP;
-function jP(e) {
+var Xm = UP;
+function UP(e) {
   var t = 0, n = [], i = {}, o = [];
   function r(a) {
     var s = i[a] = {
@@ -17994,23 +18171,23 @@ function jP(e) {
     Object.hasOwn(i, a) || r(a);
   }), o;
 }
-var qP = Ym, zP = UP;
-function UP(e) {
-  return qP(e).filter(function(t) {
+var HP = Xm, GP = YP;
+function YP(e) {
+  return HP(e).filter(function(t) {
     return t.length > 1 || t.length === 1 && e.hasEdge(t[0], t[0]);
   });
 }
-var HP = YP, GP = () => 1;
-function YP(e, t, n) {
-  return WP(
+var WP = ZP, XP = () => 1;
+function ZP(e, t, n) {
+  return JP(
     e,
-    t || GP,
+    t || XP,
     n || function(i) {
       return e.outEdges(i);
     }
   );
 }
-function WP(e, t, n) {
+function JP(e, t, n) {
   var i = {}, o = e.nodes();
   return o.forEach(function(r) {
     i[r] = {}, i[r][r] = { distance: 0 }, o.forEach(function(a) {
@@ -18030,26 +18207,26 @@ function WP(e, t, n) {
     });
   }), i;
 }
-function Wm(e) {
+function Zm(e) {
   var t = {}, n = {}, i = [];
   function o(r) {
     if (Object.hasOwn(n, r))
-      throw new zs();
+      throw new Hs();
     Object.hasOwn(t, r) || (n[r] = !0, t[r] = !0, e.predecessors(r).forEach(o), delete n[r], i.push(r));
   }
   if (e.sinks().forEach(o), Object.keys(t).length !== e.nodeCount())
-    throw new zs();
+    throw new Hs();
   return i;
 }
-class zs extends Error {
+class Hs extends Error {
   constructor() {
     super(...arguments);
   }
 }
-var Xm = Wm;
-Wm.CycleException = zs;
-var ad = Xm, XP = ZP;
-function ZP(e) {
+var Jm = Zm;
+Zm.CycleException = Hs;
+var ad = Jm, QP = eM;
+function eM(e) {
   try {
     ad(e);
   } catch (t) {
@@ -18059,44 +18236,44 @@ function ZP(e) {
   }
   return !0;
 }
-var Zm = JP;
-function JP(e, t, n) {
+var Qm = tM;
+function tM(e, t, n) {
   Array.isArray(t) || (t = [t]);
-  var i = e.isDirected() ? (s) => e.successors(s) : (s) => e.neighbors(s), o = n === "post" ? QP : eM, r = [], a = {};
+  var i = e.isDirected() ? (s) => e.successors(s) : (s) => e.neighbors(s), o = n === "post" ? nM : iM, r = [], a = {};
   return t.forEach((s) => {
     if (!e.hasNode(s))
       throw new Error("Graph does not have node: " + s);
     o(s, i, a, r);
   }), r;
 }
-function QP(e, t, n, i) {
+function nM(e, t, n, i) {
   for (var o = [[e, !1]]; o.length > 0; ) {
     var r = o.pop();
-    r[1] ? i.push(r[0]) : Object.hasOwn(n, r[0]) || (n[r[0]] = !0, o.push([r[0], !0]), Jm(t(r[0]), (a) => o.push([a, !1])));
+    r[1] ? i.push(r[0]) : Object.hasOwn(n, r[0]) || (n[r[0]] = !0, o.push([r[0], !0]), eg(t(r[0]), (a) => o.push([a, !1])));
   }
 }
-function eM(e, t, n, i) {
+function iM(e, t, n, i) {
   for (var o = [e]; o.length > 0; ) {
     var r = o.pop();
-    Object.hasOwn(n, r) || (n[r] = !0, i.push(r), Jm(t(r), (a) => o.push(a)));
+    Object.hasOwn(n, r) || (n[r] = !0, i.push(r), eg(t(r), (a) => o.push(a)));
   }
 }
-function Jm(e, t) {
+function eg(e, t) {
   for (var n = e.length; n--; )
     t(e[n], n, e);
   return e;
 }
-var tM = Zm, nM = iM;
-function iM(e, t) {
-  return tM(e, t, "post");
-}
-var oM = Zm, rM = aM;
+var oM = Qm, rM = aM;
 function aM(e, t) {
-  return oM(e, t, "pre");
+  return oM(e, t, "post");
+}
+var sM = Qm, lM = uM;
+function uM(e, t) {
+  return sM(e, t, "pre");
 }
-var sM = zl, lM = Hm, uM = cM;
-function cM(e, t) {
-  var n = new sM(), i = {}, o = new lM(), r;
+var cM = Ul, dM = Ym, fM = pM;
+function pM(e, t) {
+  var n = new cM(), i = {}, o = new dM(), r;
   function a(l) {
     var u = l.v === r ? l.w : l.v, d = o.priority(u);
     if (d !== void 0) {
@@ -18121,25 +18298,25 @@ function cM(e, t) {
   }
   return n;
 }
-var dM = {
-  components: OP,
-  dijkstra: Gm,
-  dijkstraAll: BP,
-  findCycles: zP,
-  floydWarshall: HP,
-  isAcyclic: XP,
-  postorder: nM,
-  preorder: rM,
-  prim: uM,
-  tarjan: Ym,
-  topsort: Xm
-}, sd = SP, Xt = {
+var mM = {
+  components: FP,
+  dijkstra: Wm,
+  dijkstraAll: qP,
+  findCycles: GP,
+  floydWarshall: WP,
+  isAcyclic: QP,
+  postorder: rM,
+  preorder: lM,
+  prim: fM,
+  tarjan: Xm,
+  topsort: Jm
+}, sd = TP, Xt = {
   Graph: sd.Graph,
-  json: AP,
-  alg: dM,
+  json: $P,
+  alg: mM,
   version: sd.version
 };
-let fM = class {
+let gM = class {
   constructor() {
     let t = {};
     t._next = t._prev = t, this._sentinel = t;
@@ -18156,28 +18333,28 @@ let fM = class {
   toString() {
     let t = [], n = this._sentinel, i = n._prev;
     for (; i !== n; )
-      t.push(JSON.stringify(i, pM)), i = i._prev;
+      t.push(JSON.stringify(i, hM)), i = i._prev;
     return "[" + t.join(", ") + "]";
   }
 };
 function ld(e) {
   e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
 }
-function pM(e, t) {
+function hM(e, t) {
   if (e !== "_next" && e !== "_prev")
     return t;
 }
-var mM = fM;
-let gM = Xt.Graph, hM = mM;
-var vM = _M;
-let yM = () => 1;
-function _M(e, t) {
+var vM = gM;
+let yM = Xt.Graph, _M = vM;
+var bM = EM;
+let wM = () => 1;
+function EM(e, t) {
   if (e.nodeCount() <= 1)
     return [];
-  let n = wM(e, t || yM);
-  return bM(n.graph, n.buckets, n.zeroIdx).flatMap((o) => e.outEdges(o.v, o.w));
+  let n = CM(e, t || wM);
+  return kM(n.graph, n.buckets, n.zeroIdx).flatMap((o) => e.outEdges(o.v, o.w));
 }
-function bM(e, t, n) {
+function kM(e, t, n) {
   let i = [], o = t[t.length - 1], r = t[0], a;
   for (; e.nodeCount(); ) {
     for (; a = r.dequeue(); )
@@ -18198,64 +18375,64 @@ function Za(e, t, n, i, o) {
   let r = o ? [] : void 0;
   return e.inEdges(i.v).forEach((a) => {
     let s = e.edge(a), l = e.node(a.v);
-    o && r.push({ v: a.v, w: a.w }), l.out -= s, Us(t, n, l);
+    o && r.push({ v: a.v, w: a.w }), l.out -= s, Gs(t, n, l);
   }), e.outEdges(i.v).forEach((a) => {
     let s = e.edge(a), l = a.w, u = e.node(l);
-    u.in -= s, Us(t, n, u);
+    u.in -= s, Gs(t, n, u);
   }), e.removeNode(i.v), r;
 }
-function wM(e, t) {
-  let n = new gM(), i = 0, o = 0;
+function CM(e, t) {
+  let n = new yM(), i = 0, o = 0;
   e.nodes().forEach((s) => {
     n.setNode(s, { v: s, in: 0, out: 0 });
   }), e.edges().forEach((s) => {
     let l = n.edge(s.v, s.w) || 0, u = t(s), d = l + u;
     n.setEdge(s.v, s.w, d), o = Math.max(o, n.node(s.v).out += u), i = Math.max(i, n.node(s.w).in += u);
   });
-  let r = EM(o + i + 3).map(() => new hM()), a = i + 1;
+  let r = SM(o + i + 3).map(() => new _M()), a = i + 1;
   return n.nodes().forEach((s) => {
-    Us(r, a, n.node(s));
+    Gs(r, a, n.node(s));
   }), { graph: n, buckets: r, zeroIdx: a };
 }
-function Us(e, t, n) {
+function Gs(e, t, n) {
   n.out ? n.in ? e[n.out - n.in + t].enqueue(n) : e[e.length - 1].enqueue(n) : e[0].enqueue(n);
 }
-function EM(e) {
+function SM(e) {
   const t = [];
   for (let n = 0; n < e; n++)
     t.push(n);
   return t;
 }
-let Qm = Xt.Graph;
+let tg = Xt.Graph;
 var ft = {
-  addBorderNode: NM,
-  addDummyNode: eg,
-  applyWithChunking: ka,
-  asNonCompoundGraph: CM,
-  buildLayerMatrix: TM,
-  intersectRect: AM,
-  mapValues: LM,
-  maxRank: ng,
-  normalizeRanks: IM,
-  notime: FM,
-  partition: PM,
-  pick: DM,
-  predecessorWeights: xM,
-  range: og,
-  removeEmptyRanks: $M,
-  simplify: kM,
-  successorWeights: SM,
-  time: MM,
-  uniqueId: ig,
-  zipObject: Ul
+  addBorderNode: MM,
+  addDummyNode: ng,
+  applyWithChunking: Ca,
+  asNonCompoundGraph: AM,
+  buildLayerMatrix: NM,
+  intersectRect: $M,
+  mapValues: VM,
+  maxRank: og,
+  normalizeRanks: OM,
+  notime: LM,
+  partition: RM,
+  pick: BM,
+  predecessorWeights: IM,
+  range: ag,
+  removeEmptyRanks: PM,
+  simplify: xM,
+  successorWeights: TM,
+  time: DM,
+  uniqueId: rg,
+  zipObject: Hl
 };
-function eg(e, t, n, i) {
+function ng(e, t, n, i) {
   for (var o = i; e.hasNode(o); )
-    o = ig(i);
+    o = rg(i);
   return n.dummy = t, e.setNode(o, n), o;
 }
-function kM(e) {
-  let t = new Qm().setGraph(e.graph());
+function xM(e) {
+  let t = new tg().setGraph(e.graph());
   return e.nodes().forEach((n) => t.setNode(n, e.node(n))), e.edges().forEach((n) => {
     let i = t.edge(n.v, n.w) || { weight: 0, minlen: 1 }, o = e.edge(n);
     t.setEdge(n.v, n.w, {
@@ -18264,58 +18441,58 @@ function kM(e) {
     });
   }), t;
 }
-function CM(e) {
-  let t = new Qm({ multigraph: e.isMultigraph() }).setGraph(e.graph());
+function AM(e) {
+  let t = new tg({ multigraph: e.isMultigraph() }).setGraph(e.graph());
   return e.nodes().forEach((n) => {
     e.children(n).length || t.setNode(n, e.node(n));
   }), e.edges().forEach((n) => {
     t.setEdge(n, e.edge(n));
   }), t;
 }
-function SM(e) {
+function TM(e) {
   let t = e.nodes().map((n) => {
     let i = {};
     return e.outEdges(n).forEach((o) => {
       i[o.w] = (i[o.w] || 0) + e.edge(o).weight;
     }), i;
   });
-  return Ul(e.nodes(), t);
+  return Hl(e.nodes(), t);
 }
-function xM(e) {
+function IM(e) {
   let t = e.nodes().map((n) => {
     let i = {};
     return e.inEdges(n).forEach((o) => {
       i[o.v] = (i[o.v] || 0) + e.edge(o).weight;
     }), i;
   });
-  return Ul(e.nodes(), t);
+  return Hl(e.nodes(), t);
 }
-function AM(e, t) {
+function $M(e, t) {
   let n = e.x, i = e.y, o = t.x - n, r = t.y - i, a = e.width / 2, s = e.height / 2;
   if (!o && !r)
     throw new Error("Not possible to find intersection inside of the rectangle");
   let l, u;
   return Math.abs(r) * a > Math.abs(o) * s ? (r < 0 && (s = -s), l = s * o / r, u = s) : (o < 0 && (a = -a), l = a, u = a * r / o), { x: n + l, y: i + u };
 }
-function TM(e) {
-  let t = og(ng(e) + 1).map(() => []);
+function NM(e) {
+  let t = ag(og(e) + 1).map(() => []);
   return e.nodes().forEach((n) => {
     let i = e.node(n), o = i.rank;
     o !== void 0 && (t[o][i.order] = n);
   }), t;
 }
-function IM(e) {
+function OM(e) {
   let t = e.nodes().map((i) => {
     let o = e.node(i).rank;
     return o === void 0 ? Number.MAX_VALUE : o;
-  }), n = ka(Math.min, t);
+  }), n = Ca(Math.min, t);
   e.nodes().forEach((i) => {
     let o = e.node(i);
     Object.hasOwn(o, "rank") && (o.rank -= n);
   });
 }
-function $M(e) {
-  let t = e.nodes().map((a) => e.node(a).rank), n = ka(Math.min, t), i = [];
+function PM(e) {
+  let t = e.nodes().map((a) => e.node(a).rank), n = Ca(Math.min, t), i = [];
   e.nodes().forEach((a) => {
     let s = e.node(a).rank - n;
     i[s] || (i[s] = []), i[s].push(a);
@@ -18325,14 +18502,14 @@ function $M(e) {
     a === void 0 && s % r !== 0 ? --o : a !== void 0 && o && a.forEach((l) => e.node(l).rank += o);
   });
 }
-function NM(e, t, n, i) {
+function MM(e, t, n, i) {
   let o = {
     width: 0,
     height: 0
   };
-  return arguments.length >= 4 && (o.rank = n, o.order = i), eg(e, "border", o, t);
+  return arguments.length >= 4 && (o.rank = n, o.order = i), ng(e, "border", o, t);
 }
-function OM(e, t = tg) {
+function FM(e, t = ig) {
   const n = [];
   for (let i = 0; i < e.length; i += t) {
     const o = e.slice(i, i + t);
@@ -18340,28 +18517,28 @@ function OM(e, t = tg) {
   }
   return n;
 }
-const tg = 65535;
-function ka(e, t) {
-  if (t.length > tg) {
-    const n = OM(t);
+const ig = 65535;
+function Ca(e, t) {
+  if (t.length > ig) {
+    const n = FM(t);
     return e.apply(null, n.map((i) => e.apply(null, i)));
   } else
     return e.apply(null, t);
 }
-function ng(e) {
+function og(e) {
   const n = e.nodes().map((i) => {
     let o = e.node(i).rank;
     return o === void 0 ? Number.MIN_VALUE : o;
   });
-  return ka(Math.max, n);
+  return Ca(Math.max, n);
 }
-function PM(e, t) {
+function RM(e, t) {
   let n = { lhs: [], rhs: [] };
   return e.forEach((i) => {
     t(i) ? n.lhs.push(i) : n.rhs.push(i);
   }), n;
 }
-function MM(e, t) {
+function DM(e, t) {
   let n = Date.now();
   try {
     return t();
@@ -18369,15 +18546,15 @@ function MM(e, t) {
     console.log(e + " time: " + (Date.now() - n) + "ms");
   }
 }
-function FM(e, t) {
+function LM(e, t) {
   return t();
 }
-let RM = 0;
-function ig(e) {
-  var t = ++RM;
+let KM = 0;
+function rg(e) {
+  var t = ++KM;
   return e + ("" + t);
 }
-function og(e, t, n = 1) {
+function ag(e, t, n = 1) {
   t == null && (t = e, e = 0);
   let i = (r) => r < t;
   n < 0 && (i = (r) => t < r);
@@ -18386,34 +18563,34 @@ function og(e, t, n = 1) {
     o.push(r);
   return o;
 }
-function DM(e, t) {
+function BM(e, t) {
   const n = {};
   for (const i of t)
     e[i] !== void 0 && (n[i] = e[i]);
   return n;
 }
-function LM(e, t) {
+function VM(e, t) {
   let n = t;
   return typeof t == "string" && (n = (i) => i[t]), Object.entries(e).reduce((i, [o, r]) => (i[o] = n(r, o), i), {});
 }
-function Ul(e, t) {
+function Hl(e, t) {
   return e.reduce((n, i, o) => (n[i] = t[o], n), {});
 }
-let KM = vM, BM = ft.uniqueId;
-var VM = {
-  run: jM,
-  undo: zM
+let jM = bM, qM = ft.uniqueId;
+var zM = {
+  run: UM,
+  undo: GM
 };
-function jM(e) {
-  (e.graph().acyclicer === "greedy" ? KM(e, n(e)) : qM(e)).forEach((i) => {
+function UM(e) {
+  (e.graph().acyclicer === "greedy" ? jM(e, n(e)) : HM(e)).forEach((i) => {
     let o = e.edge(i);
-    e.removeEdge(i), o.forwardName = i.name, o.reversed = !0, e.setEdge(i.w, i.v, o, BM("rev"));
+    e.removeEdge(i), o.forwardName = i.name, o.reversed = !0, e.setEdge(i.w, i.v, o, qM("rev"));
   });
   function n(i) {
     return (o) => i.edge(o).weight;
   }
 }
-function qM(e) {
+function HM(e) {
   let t = [], n = {}, i = {};
   function o(r) {
     Object.hasOwn(i, r) || (i[r] = !0, n[r] = !0, e.outEdges(r).forEach((a) => {
@@ -18422,7 +18599,7 @@ function qM(e) {
   }
   return e.nodes().forEach(o), t;
 }
-function zM(e) {
+function GM(e) {
   e.edges().forEach((t) => {
     let n = e.edge(t);
     if (n.reversed) {
@@ -18432,15 +18609,15 @@ function zM(e) {
     }
   });
 }
-let UM = ft;
-var HM = {
-  run: GM,
-  undo: WM
+let YM = ft;
+var WM = {
+  run: XM,
+  undo: JM
 };
-function GM(e) {
-  e.graph().dummyChains = [], e.edges().forEach((t) => YM(e, t));
+function XM(e) {
+  e.graph().dummyChains = [], e.edges().forEach((t) => ZM(e, t));
 }
-function YM(e, t) {
+function ZM(e, t) {
   let n = t.v, i = e.node(n).rank, o = t.w, r = e.node(o).rank, a = t.name, s = e.edge(t), l = s.labelRank;
   if (r === i + 1) return;
   e.removeEdge(t);
@@ -18452,22 +18629,22 @@ function YM(e, t) {
       edgeLabel: s,
       edgeObj: t,
       rank: i
-    }, u = UM.addDummyNode(e, "edge", d, "_d"), i === l && (d.width = s.width, d.height = s.height, d.dummy = "edge-label", d.labelpos = s.labelpos), e.setEdge(n, u, { weight: s.weight }, a), c === 0 && e.graph().dummyChains.push(u), n = u;
+    }, u = YM.addDummyNode(e, "edge", d, "_d"), i === l && (d.width = s.width, d.height = s.height, d.dummy = "edge-label", d.labelpos = s.labelpos), e.setEdge(n, u, { weight: s.weight }, a), c === 0 && e.graph().dummyChains.push(u), n = u;
   e.setEdge(n, o, { weight: s.weight }, a);
 }
-function WM(e) {
+function JM(e) {
   e.graph().dummyChains.forEach((t) => {
     let n = e.node(t), i = n.edgeLabel, o;
     for (e.setEdge(n.edgeObj, i); n.dummy; )
       o = e.successors(t)[0], e.removeNode(t), i.points.push({ x: n.x, y: n.y }), n.dummy === "edge-label" && (i.x = n.x, i.y = n.y, i.width = n.width, i.height = n.height), t = o, n = e.node(t);
   });
 }
-const { applyWithChunking: XM } = ft;
-var Ca = {
-  longestPath: ZM,
-  slack: JM
+const { applyWithChunking: QM } = ft;
+var Sa = {
+  longestPath: e2,
+  slack: t2
 };
-function ZM(e) {
+function e2(e) {
   var t = {};
   function n(i) {
     var o = e.node(i);
@@ -18475,23 +18652,23 @@ function ZM(e) {
       return o.rank;
     t[i] = !0;
     let r = e.outEdges(i).map((s) => s == null ? Number.POSITIVE_INFINITY : n(s.w) - e.edge(s).minlen);
-    var a = XM(Math.min, r);
+    var a = QM(Math.min, r);
     return a === Number.POSITIVE_INFINITY && (a = 0), o.rank = a;
   }
   e.sources().forEach(n);
 }
-function JM(e, t) {
+function t2(e, t) {
   return e.node(t.w).rank - e.node(t.v).rank - e.edge(t).minlen;
 }
-var QM = Xt.Graph, jr = Ca.slack, rg = e2;
-function e2(e) {
-  var t = new QM({ directed: !1 }), n = e.nodes()[0], i = e.nodeCount();
+var n2 = Xt.Graph, jr = Sa.slack, sg = i2;
+function i2(e) {
+  var t = new n2({ directed: !1 }), n = e.nodes()[0], i = e.nodeCount();
   t.setNode(n, {});
-  for (var o, r; t2(t, e) < i; )
-    o = n2(t, e), r = t.hasNode(o.v) ? jr(e, o) : -jr(e, o), i2(t, e, r);
+  for (var o, r; o2(t, e) < i; )
+    o = r2(t, e), r = t.hasNode(o.v) ? jr(e, o) : -jr(e, o), a2(t, e, r);
   return t;
 }
-function t2(e, t) {
+function o2(e, t) {
   function n(i) {
     t.nodeEdges(i).forEach((o) => {
       var r = o.v, a = i === r ? o.w : r;
@@ -18500,63 +18677,63 @@ function t2(e, t) {
   }
   return e.nodes().forEach(n), e.nodeCount();
 }
-function n2(e, t) {
+function r2(e, t) {
   return t.edges().reduce((i, o) => {
     let r = Number.POSITIVE_INFINITY;
     return e.hasNode(o.v) !== e.hasNode(o.w) && (r = jr(t, o)), r < i[0] ? [r, o] : i;
   }, [Number.POSITIVE_INFINITY, null])[1];
 }
-function i2(e, t, n) {
+function a2(e, t, n) {
   e.nodes().forEach((i) => t.node(i).rank += n);
 }
-var o2 = rg, ud = Ca.slack, r2 = Ca.longestPath, a2 = Xt.alg.preorder, s2 = Xt.alg.postorder, l2 = ft.simplify, u2 = ci;
-ci.initLowLimValues = Gl;
-ci.initCutValues = Hl;
-ci.calcCutValue = ag;
-ci.leaveEdge = lg;
-ci.enterEdge = ug;
-ci.exchangeEdges = cg;
+var s2 = sg, ud = Sa.slack, l2 = Sa.longestPath, u2 = Xt.alg.preorder, c2 = Xt.alg.postorder, d2 = ft.simplify, f2 = ci;
+ci.initLowLimValues = Yl;
+ci.initCutValues = Gl;
+ci.calcCutValue = lg;
+ci.leaveEdge = cg;
+ci.enterEdge = dg;
+ci.exchangeEdges = fg;
 function ci(e) {
-  e = l2(e), r2(e);
-  var t = o2(e);
-  Gl(t), Hl(t, e);
-  for (var n, i; n = lg(t); )
-    i = ug(t, e, n), cg(t, e, n, i);
+  e = d2(e), l2(e);
+  var t = s2(e);
+  Yl(t), Gl(t, e);
+  for (var n, i; n = cg(t); )
+    i = dg(t, e, n), fg(t, e, n, i);
 }
-function Hl(e, t) {
-  var n = s2(e, e.nodes());
-  n = n.slice(0, n.length - 1), n.forEach((i) => c2(e, t, i));
+function Gl(e, t) {
+  var n = c2(e, e.nodes());
+  n = n.slice(0, n.length - 1), n.forEach((i) => p2(e, t, i));
 }
-function c2(e, t, n) {
+function p2(e, t, n) {
   var i = e.node(n), o = i.parent;
-  e.edge(n, o).cutvalue = ag(e, t, n);
+  e.edge(n, o).cutvalue = lg(e, t, n);
 }
-function ag(e, t, n) {
+function lg(e, t, n) {
   var i = e.node(n), o = i.parent, r = !0, a = t.edge(n, o), s = 0;
   return a || (r = !1, a = t.edge(o, n)), s = a.weight, t.nodeEdges(n).forEach((l) => {
     var u = l.v === n, d = u ? l.w : l.v;
     if (d !== o) {
       var c = u === r, f = t.edge(l).weight;
-      if (s += c ? f : -f, f2(e, n, d)) {
+      if (s += c ? f : -f, g2(e, n, d)) {
         var m = e.edge(n, d).cutvalue;
         s += c ? -m : m;
       }
     }
   }), s;
 }
-function Gl(e, t) {
-  arguments.length < 2 && (t = e.nodes()[0]), sg(e, {}, 1, t);
+function Yl(e, t) {
+  arguments.length < 2 && (t = e.nodes()[0]), ug(e, {}, 1, t);
 }
-function sg(e, t, n, i, o) {
+function ug(e, t, n, i, o) {
   var r = n, a = e.node(i);
   return t[i] = !0, e.neighbors(i).forEach((s) => {
-    Object.hasOwn(t, s) || (n = sg(e, t, n, s, i));
+    Object.hasOwn(t, s) || (n = ug(e, t, n, s, i));
   }), a.low = r, a.lim = n++, o ? a.parent = o : delete a.parent, n;
 }
-function lg(e) {
+function cg(e) {
   return e.edges().find((t) => e.edge(t).cutvalue < 0);
 }
-function ug(e, t, n) {
+function dg(e, t, n) {
   var i = n.v, o = n.w;
   t.hasEdge(i, o) || (i = n.w, o = n.v);
   var r = e.node(i), a = e.node(o), s = r, l = !1;
@@ -18564,25 +18741,25 @@ function ug(e, t, n) {
   var u = t.edges().filter((d) => l === cd(e, e.node(d.v), s) && l !== cd(e, e.node(d.w), s));
   return u.reduce((d, c) => ud(t, c) < ud(t, d) ? c : d);
 }
-function cg(e, t, n, i) {
+function fg(e, t, n, i) {
   var o = n.v, r = n.w;
-  e.removeEdge(o, r), e.setEdge(i.v, i.w, {}), Gl(e), Hl(e, t), d2(e, t);
+  e.removeEdge(o, r), e.setEdge(i.v, i.w, {}), Yl(e), Gl(e, t), m2(e, t);
 }
-function d2(e, t) {
-  var n = e.nodes().find((o) => !t.node(o).parent), i = a2(e, n);
+function m2(e, t) {
+  var n = e.nodes().find((o) => !t.node(o).parent), i = u2(e, n);
   i = i.slice(1), i.forEach((o) => {
     var r = e.node(o).parent, a = t.edge(o, r), s = !1;
     a || (a = t.edge(r, o), s = !0), t.node(o).rank = t.node(r).rank + (s ? a.minlen : -a.minlen);
   });
 }
-function f2(e, t, n) {
+function g2(e, t, n) {
   return e.hasEdge(t, n);
 }
 function cd(e, t, n) {
   return n.low <= t.lim && t.lim <= n.lim;
 }
-var p2 = Ca, dg = p2.longestPath, m2 = rg, g2 = u2, h2 = v2;
-function v2(e) {
+var h2 = Sa, pg = h2.longestPath, v2 = sg, y2 = f2, _2 = b2;
+function b2(e) {
   var t = e.graph().ranker;
   if (t instanceof Function)
     return t(e);
@@ -18591,10 +18768,10 @@ function v2(e) {
       dd(e);
       break;
     case "tight-tree":
-      _2(e);
+      E2(e);
       break;
     case "longest-path":
-      y2(e);
+      w2(e);
       break;
     case "none":
       break;
@@ -18602,18 +18779,18 @@ function v2(e) {
       dd(e);
   }
 }
-var y2 = dg;
-function _2(e) {
-  dg(e), m2(e);
+var w2 = pg;
+function E2(e) {
+  pg(e), v2(e);
 }
 function dd(e) {
-  g2(e);
+  y2(e);
 }
-var b2 = w2;
-function w2(e) {
-  let t = k2(e);
+var k2 = C2;
+function C2(e) {
+  let t = x2(e);
   e.graph().dummyChains.forEach((n) => {
-    let i = e.node(n), o = i.edgeObj, r = E2(e, t, o.v, o.w), a = r.path, s = r.lca, l = 0, u = a[l], d = !0;
+    let i = e.node(n), o = i.edgeObj, r = S2(e, t, o.v, o.w), a = r.path, s = r.lca, l = 0, u = a[l], d = !0;
     for (; n !== o.w; ) {
       if (i = e.node(n), d) {
         for (; (u = a[l]) !== s && e.node(u).maxRank < i.rank; )
@@ -18629,7 +18806,7 @@ function w2(e) {
     }
   });
 }
-function E2(e, t, n, i) {
+function S2(e, t, n, i) {
   let o = [], r = [], a = Math.min(t[n].low, t[i].low), s = Math.max(t[n].lim, t[i].lim), l, u;
   l = n;
   do
@@ -18639,7 +18816,7 @@ function E2(e, t, n, i) {
     r.push(l);
   return { path: o.concat(r.reverse()), lca: u };
 }
-function k2(e) {
+function x2(e) {
   let t = {}, n = 0;
   function i(o) {
     let r = n;
@@ -18648,17 +18825,17 @@ function k2(e) {
   return e.children().forEach(i), t;
 }
 let qr = ft;
-var C2 = {
-  run: S2,
-  cleanup: T2
+var A2 = {
+  run: T2,
+  cleanup: N2
 };
-function S2(e) {
-  let t = qr.addDummyNode(e, "root", {}, "_root"), n = x2(e), i = Object.values(n), o = qr.applyWithChunking(Math.max, i) - 1, r = 2 * o + 1;
+function T2(e) {
+  let t = qr.addDummyNode(e, "root", {}, "_root"), n = I2(e), i = Object.values(n), o = qr.applyWithChunking(Math.max, i) - 1, r = 2 * o + 1;
   e.graph().nestingRoot = t, e.edges().forEach((s) => e.edge(s).minlen *= r);
-  let a = A2(e) + 1;
-  e.children().forEach((s) => fg(e, t, r, a, o, n, s)), e.graph().nodeRankFactor = r;
+  let a = $2(e) + 1;
+  e.children().forEach((s) => mg(e, t, r, a, o, n, s)), e.graph().nodeRankFactor = r;
 }
-function fg(e, t, n, i, o, r, a) {
+function mg(e, t, n, i, o, r, a) {
   let s = e.children(a);
   if (!s.length) {
     a !== t && e.setEdge(t, a, { weight: 0, minlen: n });
@@ -18666,7 +18843,7 @@ function fg(e, t, n, i, o, r, a) {
   }
   let l = qr.addBorderNode(e, "_bt"), u = qr.addBorderNode(e, "_bb"), d = e.node(a);
   e.setParent(l, a), d.borderTop = l, e.setParent(u, a), d.borderBottom = u, s.forEach((c) => {
-    fg(e, t, n, i, o, r, c);
+    mg(e, t, n, i, o, r, c);
     let f = e.node(c), m = f.borderTop ? f.borderTop : c, h = f.borderBottom ? f.borderBottom : c, v = f.borderTop ? i : 2 * i, g = m !== h ? 1 : o - r[a] + 1;
     e.setEdge(l, m, {
       weight: v,
@@ -18679,7 +18856,7 @@ function fg(e, t, n, i, o, r, a) {
     });
   }), e.parent(a) || e.setEdge(t, l, { weight: 0, minlen: o + r[a] });
 }
-function x2(e) {
+function I2(e) {
   var t = {};
   function n(i, o) {
     var r = e.children(i);
@@ -18687,19 +18864,19 @@ function x2(e) {
   }
   return e.children().forEach((i) => n(i, 1)), t;
 }
-function A2(e) {
+function $2(e) {
   return e.edges().reduce((t, n) => t + e.edge(n).weight, 0);
 }
-function T2(e) {
+function N2(e) {
   var t = e.graph();
   e.removeNode(t.nestingRoot), delete t.nestingRoot, e.edges().forEach((n) => {
     var i = e.edge(n);
     i.nestingEdge && e.removeEdge(n);
   });
 }
-let I2 = ft;
-var $2 = N2;
-function N2(e) {
+let O2 = ft;
+var P2 = M2;
+function M2(e) {
   function t(n) {
     let i = e.children(n), o = e.node(n);
     if (i.length && i.forEach(t), Object.hasOwn(o, "minRank")) {
@@ -18711,29 +18888,29 @@ function N2(e) {
   e.children().forEach(t);
 }
 function fd(e, t, n, i, o, r) {
-  let a = { width: 0, height: 0, rank: r, borderType: t }, s = o[t][r - 1], l = I2.addDummyNode(e, "border", a, n);
+  let a = { width: 0, height: 0, rank: r, borderType: t }, s = o[t][r - 1], l = O2.addDummyNode(e, "border", a, n);
   o[t][r] = l, e.setParent(l, i), s && e.setEdge(s, l, { weight: 1 });
 }
-var O2 = {
-  adjust: P2,
-  undo: M2
+var F2 = {
+  adjust: R2,
+  undo: D2
 };
-function P2(e) {
+function R2(e) {
   let t = e.graph().rankdir.toLowerCase();
-  (t === "lr" || t === "rl") && pg(e);
+  (t === "lr" || t === "rl") && gg(e);
 }
-function M2(e) {
+function D2(e) {
   let t = e.graph().rankdir.toLowerCase();
-  (t === "bt" || t === "rl") && F2(e), (t === "lr" || t === "rl") && (R2(e), pg(e));
+  (t === "bt" || t === "rl") && L2(e), (t === "lr" || t === "rl") && (K2(e), gg(e));
 }
-function pg(e) {
+function gg(e) {
   e.nodes().forEach((t) => pd(e.node(t))), e.edges().forEach((t) => pd(e.edge(t)));
 }
 function pd(e) {
   let t = e.width;
   e.width = e.height, e.height = t;
 }
-function F2(e) {
+function L2(e) {
   e.nodes().forEach((t) => Ja(e.node(t))), e.edges().forEach((t) => {
     let n = e.edge(t);
     n.points.forEach(Ja), Object.hasOwn(n, "y") && Ja(n);
@@ -18742,7 +18919,7 @@ function F2(e) {
 function Ja(e) {
   e.y = -e.y;
 }
-function R2(e) {
+function K2(e) {
   e.nodes().forEach((t) => Qa(e.node(t))), e.edges().forEach((t) => {
     let n = e.edge(t);
     n.points.forEach(Qa), Object.hasOwn(n, "x") && Qa(n);
@@ -18753,8 +18930,8 @@ function Qa(e) {
   e.x = e.y, e.y = t;
 }
 let md = ft;
-var D2 = L2;
-function L2(e) {
+var B2 = V2;
+function V2(e) {
   let t = {}, n = e.nodes().filter((l) => !e.children(l).length), i = n.map((l) => e.node(l).rank), o = md.applyWithChunking(Math.max, i), r = md.range(o + 1).map(() => []);
   function a(l) {
     if (t[l]) return;
@@ -18764,16 +18941,16 @@ function L2(e) {
   }
   return n.sort((l, u) => e.node(l).rank - e.node(u).rank).forEach(a), r;
 }
-let K2 = ft.zipObject;
-var B2 = V2;
-function V2(e, t) {
+let j2 = ft.zipObject;
+var q2 = z2;
+function z2(e, t) {
   let n = 0;
   for (let i = 1; i < t.length; ++i)
-    n += j2(e, t[i - 1], t[i]);
+    n += U2(e, t[i - 1], t[i]);
   return n;
 }
-function j2(e, t, n) {
-  let i = K2(n, n.map((u, d) => d)), o = t.flatMap((u) => e.outEdges(u).map((d) => ({ pos: i[d.w], weight: e.edge(d).weight })).sort((d, c) => d.pos - c.pos)), r = 1;
+function U2(e, t, n) {
+  let i = j2(n, n.map((u, d) => d)), o = t.flatMap((u) => e.outEdges(u).map((d) => ({ pos: i[d.w], weight: e.edge(d).weight })).sort((d, c) => d.pos - c.pos)), r = 1;
   for (; r < n.length; ) r <<= 1;
   let a = 2 * r - 1;
   r -= 1;
@@ -18787,8 +18964,8 @@ function j2(e, t, n) {
     l += u.weight * c;
   }), l;
 }
-var q2 = z2;
-function z2(e, t = []) {
+var H2 = G2;
+function G2(e, t = []) {
   return t.map((n) => {
     let i = e.inEdges(n);
     if (i.length) {
@@ -18808,9 +18985,9 @@ function z2(e, t = []) {
       return { v: n };
   });
 }
-let U2 = ft;
-var H2 = G2;
-function G2(e, t) {
+let Y2 = ft;
+var W2 = X2;
+function X2(e, t) {
   let n = {};
   e.forEach((o, r) => {
     let a = n[o.v] = {
@@ -18826,13 +19003,13 @@ function G2(e, t) {
     r !== void 0 && a !== void 0 && (a.indegree++, r.out.push(n[o.w]));
   });
   let i = Object.values(n).filter((o) => !o.indegree);
-  return Y2(i);
+  return Z2(i);
 }
-function Y2(e) {
+function Z2(e) {
   let t = [];
   function n(o) {
     return (r) => {
-      r.merged || (r.barycenter === void 0 || o.barycenter === void 0 || r.barycenter >= o.barycenter) && W2(o, r);
+      r.merged || (r.barycenter === void 0 || o.barycenter === void 0 || r.barycenter >= o.barycenter) && J2(o, r);
     };
   }
   function i(o) {
@@ -18844,17 +19021,17 @@ function Y2(e) {
     let o = e.pop();
     t.push(o), o.in.reverse().forEach(n(o)), o.out.forEach(i(o));
   }
-  return t.filter((o) => !o.merged).map((o) => U2.pick(o, ["vs", "i", "barycenter", "weight"]));
+  return t.filter((o) => !o.merged).map((o) => Y2.pick(o, ["vs", "i", "barycenter", "weight"]));
 }
-function W2(e, t) {
+function J2(e, t) {
   let n = 0, i = 0;
   e.weight && (n += e.barycenter * e.weight, i += e.weight), t.weight && (n += t.barycenter * t.weight, i += t.weight), e.vs = t.vs.concat(e.vs), e.barycenter = n / i, e.weight = i, e.i = Math.min(t.i, e.i), t.merged = !0;
 }
-let X2 = ft;
-var Z2 = J2;
-function J2(e, t) {
-  let n = X2.partition(e, (d) => Object.hasOwn(d, "barycenter")), i = n.lhs, o = n.rhs.sort((d, c) => c.i - d.i), r = [], a = 0, s = 0, l = 0;
-  i.sort(Q2(!!t)), l = gd(r, o, l), i.forEach((d) => {
+let Q2 = ft;
+var eF = tF;
+function tF(e, t) {
+  let n = Q2.partition(e, (d) => Object.hasOwn(d, "barycenter")), i = n.lhs, o = n.rhs.sort((d, c) => c.i - d.i), r = [], a = 0, s = 0, l = 0;
+  i.sort(nF(!!t)), l = gd(r, o, l), i.forEach((d) => {
     l += d.vs.length, r.push(d.vs), a += d.barycenter * d.weight, s += d.weight, l = gd(r, o, l);
   });
   let u = { vs: r.flat(!0) };
@@ -18866,42 +19043,42 @@ function gd(e, t, n) {
     t.pop(), e.push(i.vs), n++;
   return n;
 }
-function Q2(e) {
+function nF(e) {
   return (t, n) => t.barycenter < n.barycenter ? -1 : t.barycenter > n.barycenter ? 1 : e ? n.i - t.i : t.i - n.i;
 }
-let eF = q2, tF = H2, nF = Z2;
-var iF = mg;
-function mg(e, t, n, i) {
+let iF = H2, oF = W2, rF = eF;
+var aF = hg;
+function hg(e, t, n, i) {
   let o = e.children(t), r = e.node(t), a = r ? r.borderLeft : void 0, s = r ? r.borderRight : void 0, l = {};
   a && (o = o.filter((f) => f !== a && f !== s));
-  let u = eF(e, o);
+  let u = iF(e, o);
   u.forEach((f) => {
     if (e.children(f.v).length) {
-      let m = mg(e, f.v, n, i);
-      l[f.v] = m, Object.hasOwn(m, "barycenter") && rF(f, m);
+      let m = hg(e, f.v, n, i);
+      l[f.v] = m, Object.hasOwn(m, "barycenter") && lF(f, m);
     }
   });
-  let d = tF(u, n);
-  oF(d, l);
-  let c = nF(d, i);
+  let d = oF(u, n);
+  sF(d, l);
+  let c = rF(d, i);
   if (a && (c.vs = [a, c.vs, s].flat(!0), e.predecessors(a).length)) {
     let f = e.node(e.predecessors(a)[0]), m = e.node(e.predecessors(s)[0]);
     Object.hasOwn(c, "barycenter") || (c.barycenter = 0, c.weight = 0), c.barycenter = (c.barycenter * c.weight + f.order + m.order) / (c.weight + 2), c.weight += 2;
   }
   return c;
 }
-function oF(e, t) {
+function sF(e, t) {
   e.forEach((n) => {
     n.vs = n.vs.flatMap((i) => t[i] ? t[i].vs : i);
   });
 }
-function rF(e, t) {
+function lF(e, t) {
   e.barycenter !== void 0 ? (e.barycenter = (e.barycenter * e.weight + t.barycenter * t.weight) / (e.weight + t.weight), e.weight += t.weight) : (e.barycenter = t.barycenter, e.weight = t.weight);
 }
-let aF = Xt.Graph, sF = ft;
-var lF = uF;
-function uF(e, t, n) {
-  let i = cF(e), o = new aF({ compound: !0 }).setGraph({ root: i }).setDefaultNodeLabel((r) => e.node(r));
+let uF = Xt.Graph, cF = ft;
+var dF = fF;
+function fF(e, t, n) {
+  let i = pF(e), o = new uF({ compound: !0 }).setGraph({ root: i }).setDefaultNodeLabel((r) => e.node(r));
   return e.nodes().forEach((r) => {
     let a = e.node(r), s = e.parent(r);
     (a.rank === t || a.minRank <= t && t <= a.maxRank) && (o.setNode(r), o.setParent(r, s || i), e[n](r).forEach((l) => {
@@ -18913,12 +19090,12 @@ function uF(e, t, n) {
     }));
   }), o;
 }
-function cF(e) {
-  for (var t; e.hasNode(t = sF.uniqueId("_root")); ) ;
+function pF(e) {
+  for (var t; e.hasNode(t = cF.uniqueId("_root")); ) ;
   return t;
 }
-var dF = fF;
-function fF(e, t, n) {
+var mF = gF;
+function gF(e, t, n) {
   let i = {}, o;
   n.forEach((r) => {
     let a = e.parent(r), s, l;
@@ -18931,67 +19108,67 @@ function fF(e, t, n) {
     }
   });
 }
-let pF = D2, mF = B2, gF = iF, hF = lF, vF = dF, yF = Xt.Graph, ar = ft;
-var _F = gg;
-function gg(e, t) {
+let hF = B2, vF = q2, yF = aF, _F = dF, bF = mF, wF = Xt.Graph, ar = ft;
+var EF = vg;
+function vg(e, t) {
   if (t && typeof t.customOrder == "function") {
-    t.customOrder(e, gg);
+    t.customOrder(e, vg);
     return;
   }
-  let n = ar.maxRank(e), i = hd(e, ar.range(1, n + 1), "inEdges"), o = hd(e, ar.range(n - 1, -1, -1), "outEdges"), r = pF(e);
+  let n = ar.maxRank(e), i = hd(e, ar.range(1, n + 1), "inEdges"), o = hd(e, ar.range(n - 1, -1, -1), "outEdges"), r = hF(e);
   if (vd(e, r), t && t.disableOptimalOrderHeuristic)
     return;
   let a = Number.POSITIVE_INFINITY, s;
   for (let l = 0, u = 0; u < 4; ++l, ++u) {
-    bF(l % 2 ? i : o, l % 4 >= 2), r = ar.buildLayerMatrix(e);
-    let d = mF(e, r);
+    kF(l % 2 ? i : o, l % 4 >= 2), r = ar.buildLayerMatrix(e);
+    let d = vF(e, r);
     d < a && (u = 0, s = Object.assign({}, r), a = d);
   }
   vd(e, s);
 }
 function hd(e, t, n) {
   return t.map(function(i) {
-    return hF(e, i, n);
+    return _F(e, i, n);
   });
 }
-function bF(e, t) {
-  let n = new yF();
+function kF(e, t) {
+  let n = new wF();
   e.forEach(function(i) {
-    let o = i.graph().root, r = gF(i, o, n, t);
-    r.vs.forEach((a, s) => i.node(a).order = s), vF(i, n, r.vs);
+    let o = i.graph().root, r = yF(i, o, n, t);
+    r.vs.forEach((a, s) => i.node(a).order = s), bF(i, n, r.vs);
   });
 }
 function vd(e, t) {
   Object.values(t).forEach((n) => n.forEach((i, o) => e.node(i).order = o));
 }
-let wF = Xt.Graph, fn = ft;
-var EF = {
-  positionX: PF
+let CF = Xt.Graph, fn = ft;
+var SF = {
+  positionX: RF
 };
-function kF(e, t) {
+function xF(e, t) {
   let n = {};
   function i(o, r) {
     let a = 0, s = 0, l = o.length, u = r[r.length - 1];
     return r.forEach((d, c) => {
-      let f = SF(e, d), m = f ? e.node(f).order : l;
+      let f = TF(e, d), m = f ? e.node(f).order : l;
       (f || d === u) && (r.slice(s, c + 1).forEach((h) => {
         e.predecessors(h).forEach((v) => {
           let g = e.node(v), y = g.order;
-          (y < a || m < y) && !(g.dummy && e.node(h).dummy) && hg(n, v, h);
+          (y < a || m < y) && !(g.dummy && e.node(h).dummy) && yg(n, v, h);
         });
       }), s = c + 1, a = m);
     }), r;
   }
   return t.length && t.reduce(i), n;
 }
-function CF(e, t) {
+function AF(e, t) {
   let n = {};
   function i(r, a, s, l, u) {
     let d;
     fn.range(a, s).forEach((c) => {
       d = r[c], e.node(d).dummy && e.predecessors(d).forEach((f) => {
         let m = e.node(f);
-        m.dummy && (m.order < l || m.order > u) && hg(n, f, d);
+        m.dummy && (m.order < l || m.order > u) && yg(n, f, d);
       });
     });
   }
@@ -19007,11 +19184,11 @@ function CF(e, t) {
   }
   return t.length && t.reduce(o), n;
 }
-function SF(e, t) {
+function TF(e, t) {
   if (e.node(t).dummy)
     return e.predecessors(t).find((n) => e.node(n).dummy);
 }
-function hg(e, t, n) {
+function yg(e, t, n) {
   if (t > n) {
     let o = t;
     t = n, n = o;
@@ -19019,14 +19196,14 @@ function hg(e, t, n) {
   let i = e[t];
   i || (e[t] = i = {}), i[n] = !0;
 }
-function xF(e, t, n) {
+function IF(e, t, n) {
   if (t > n) {
     let i = t;
     t = n, n = i;
   }
   return !!e[t] && Object.hasOwn(e[t], n);
 }
-function AF(e, t, n, i) {
+function $F(e, t, n, i) {
   let o = {}, r = {}, a = {};
   return t.forEach((s) => {
     s.forEach((l, u) => {
@@ -19041,14 +19218,14 @@ function AF(e, t, n, i) {
         let c = (d.length - 1) / 2;
         for (let f = Math.floor(c), m = Math.ceil(c); f <= m; ++f) {
           let h = d[f];
-          r[u] === u && l < a[h] && !xF(n, u, h) && (r[h] = u, r[u] = o[u] = o[h], l = a[h]);
+          r[u] === u && l < a[h] && !IF(n, u, h) && (r[h] = u, r[u] = o[u] = o[h], l = a[h]);
         }
       }
     });
   }), { root: o, align: r };
 }
-function TF(e, t, n, i, o) {
-  let r = {}, a = IF(e, t, n, o), s = o ? "borderLeft" : "borderRight";
+function NF(e, t, n, i, o) {
+  let r = {}, a = OF(e, t, n, o), s = o ? "borderLeft" : "borderRight";
   function l(c, f) {
     let m = a.nodes(), h = m.pop(), v = {};
     for (; h; )
@@ -19063,8 +19240,8 @@ function TF(e, t, n, i, o) {
   }
   return l(u, a.predecessors.bind(a)), l(d, a.successors.bind(a)), Object.keys(i).forEach((c) => r[c] = r[n[c]]), r;
 }
-function IF(e, t, n, i) {
-  let o = new wF(), r = e.graph(), a = MF(r.nodesep, r.edgesep, i);
+function OF(e, t, n, i) {
+  let o = new CF(), r = e.graph(), a = DF(r.nodesep, r.edgesep, i);
   return t.forEach((s) => {
     let l;
     s.forEach((u) => {
@@ -19077,18 +19254,18 @@ function IF(e, t, n, i) {
     });
   }), o;
 }
-function $F(e, t) {
+function PF(e, t) {
   return Object.values(t).reduce((n, i) => {
     let o = Number.NEGATIVE_INFINITY, r = Number.POSITIVE_INFINITY;
     Object.entries(i).forEach(([s, l]) => {
-      let u = FF(e, s) / 2;
+      let u = LF(e, s) / 2;
       o = Math.max(l + u, o), r = Math.min(l - u, r);
     });
     const a = o - r;
     return a < n[0] && (n = [a, i]), n;
   }, [Number.POSITIVE_INFINITY, null])[1];
 }
-function NF(e, t) {
+function MF(e, t) {
   let n = Object.values(t), i = fn.applyWithChunking(Math.min, n), o = fn.applyWithChunking(Math.max, n);
   ["u", "d"].forEach((r) => {
     ["l", "r"].forEach((a) => {
@@ -19099,7 +19276,7 @@ function NF(e, t) {
     });
   });
 }
-function OF(e, t) {
+function FF(e, t) {
   return fn.mapValues(e.ul, (n, i) => {
     if (t)
       return e[t.toLowerCase()][i];
@@ -19109,15 +19286,15 @@ function OF(e, t) {
     }
   });
 }
-function PF(e) {
+function RF(e) {
   let t = fn.buildLayerMatrix(e), n = Object.assign(
-    kF(e, t),
-    CF(e, t)
+    xF(e, t),
+    AF(e, t)
   ), i = {}, o;
   ["u", "d"].forEach((a) => {
     o = a === "u" ? t : Object.values(t).reverse(), ["l", "r"].forEach((s) => {
       s === "r" && (o = o.map((c) => Object.values(c).reverse()));
-      let l = (a === "u" ? e.predecessors : e.successors).bind(e), u = AF(e, o, n, l), d = TF(
+      let l = (a === "u" ? e.predecessors : e.successors).bind(e), u = $F(e, o, n, l), d = NF(
         e,
         o,
         u.root,
@@ -19127,10 +19304,10 @@ function PF(e) {
       s === "r" && (d = fn.mapValues(d, (c) => -c)), i[a + s] = d;
     });
   });
-  let r = $F(e, i);
-  return NF(i, r), OF(i, e.graph().align);
+  let r = PF(e, i);
+  return MF(i, r), FF(i, e.graph().align);
 }
-function MF(e, t, n) {
+function DF(e, t, n) {
   return (i, o, r) => {
     let a = i.node(o), s = i.node(r), l = 0, u;
     if (l += a.width / 2, Object.hasOwn(a, "labelpos"))
@@ -19154,16 +19331,16 @@ function MF(e, t, n) {
     return u && (l += n ? u : -u), u = 0, l;
   };
 }
-function FF(e, t) {
+function LF(e, t) {
   return e.node(t).width;
 }
-let vg = ft, RF = EF.positionX;
-var DF = LF;
-function LF(e) {
-  e = vg.asNonCompoundGraph(e), KF(e), Object.entries(RF(e)).forEach(([t, n]) => e.node(t).x = n);
+let _g = ft, KF = SF.positionX;
+var BF = VF;
+function VF(e) {
+  e = _g.asNonCompoundGraph(e), jF(e), Object.entries(KF(e)).forEach(([t, n]) => e.node(t).x = n);
 }
-function KF(e) {
-  let t = vg.buildLayerMatrix(e), n = e.graph().ranksep, i = 0;
+function jF(e) {
+  let t = _g.buildLayerMatrix(e), n = e.graph().ranksep, i = 0;
   t.forEach((o) => {
     const r = o.reduce((a, s) => {
       const l = e.node(s).height;
@@ -19172,19 +19349,19 @@ function KF(e) {
     o.forEach((a) => e.node(a).y = i + r / 2), i += r + n;
   });
 }
-let yd = VM, _d = HM, BF = h2, VF = ft.normalizeRanks, jF = b2, qF = ft.removeEmptyRanks, bd = C2, zF = $2, wd = O2, UF = _F, HF = DF, Bt = ft, GF = Xt.Graph;
-var YF = WF;
-function WF(e, t) {
+let yd = zM, _d = WM, qF = _2, zF = ft.normalizeRanks, UF = k2, HF = ft.removeEmptyRanks, bd = A2, GF = P2, wd = F2, YF = EF, WF = BF, Bt = ft, XF = Xt.Graph;
+var ZF = JF;
+function JF(e, t) {
   let n = t && t.debugTiming ? Bt.time : Bt.notime;
   n("layout", () => {
-    let i = n("  buildLayoutGraph", () => rR(e));
-    n("  runLayout", () => XF(i, n, t)), n("  updateInputGraph", () => ZF(e, i));
+    let i = n("  buildLayoutGraph", () => lR(e));
+    n("  runLayout", () => QF(i, n, t)), n("  updateInputGraph", () => eR(e, i));
   });
 }
-function XF(e, t, n) {
-  t("    makeSpaceForEdgeLabels", () => aR(e)), t("    removeSelfEdges", () => gR(e)), t("    acyclic", () => yd.run(e)), t("    nestingGraph.run", () => bd.run(e)), t("    rank", () => BF(Bt.asNonCompoundGraph(e))), t("    injectEdgeLabelProxies", () => sR(e)), t("    removeEmptyRanks", () => qF(e)), t("    nestingGraph.cleanup", () => bd.cleanup(e)), t("    normalizeRanks", () => VF(e)), t("    assignRankMinMax", () => lR(e)), t("    removeEdgeLabelProxies", () => uR(e)), t("    normalize.run", () => _d.run(e)), t("    parentDummyChains", () => jF(e)), t("    addBorderSegments", () => zF(e)), t("    order", () => UF(e, n)), t("    insertSelfEdges", () => hR(e)), t("    adjustCoordinateSystem", () => wd.adjust(e)), t("    position", () => HF(e)), t("    positionSelfEdges", () => vR(e)), t("    removeBorderNodes", () => mR(e)), t("    normalize.undo", () => _d.undo(e)), t("    fixupEdgeLabelCoords", () => fR(e)), t("    undoCoordinateSystem", () => wd.undo(e)), t("    translateGraph", () => cR(e)), t("    assignNodeIntersects", () => dR(e)), t("    reversePoints", () => pR(e)), t("    acyclic.undo", () => yd.undo(e));
+function QF(e, t, n) {
+  t("    makeSpaceForEdgeLabels", () => uR(e)), t("    removeSelfEdges", () => yR(e)), t("    acyclic", () => yd.run(e)), t("    nestingGraph.run", () => bd.run(e)), t("    rank", () => qF(Bt.asNonCompoundGraph(e))), t("    injectEdgeLabelProxies", () => cR(e)), t("    removeEmptyRanks", () => HF(e)), t("    nestingGraph.cleanup", () => bd.cleanup(e)), t("    normalizeRanks", () => zF(e)), t("    assignRankMinMax", () => dR(e)), t("    removeEdgeLabelProxies", () => fR(e)), t("    normalize.run", () => _d.run(e)), t("    parentDummyChains", () => UF(e)), t("    addBorderSegments", () => GF(e)), t("    order", () => YF(e, n)), t("    insertSelfEdges", () => _R(e)), t("    adjustCoordinateSystem", () => wd.adjust(e)), t("    position", () => WF(e)), t("    positionSelfEdges", () => bR(e)), t("    removeBorderNodes", () => vR(e)), t("    normalize.undo", () => _d.undo(e)), t("    fixupEdgeLabelCoords", () => gR(e)), t("    undoCoordinateSystem", () => wd.undo(e)), t("    translateGraph", () => pR(e)), t("    assignNodeIntersects", () => mR(e)), t("    reversePoints", () => hR(e)), t("    acyclic.undo", () => yd.undo(e));
 }
-function ZF(e, t) {
+function eR(e, t) {
   e.nodes().forEach((n) => {
     let i = e.node(n), o = t.node(n);
     i && (i.x = o.x, i.y = o.y, i.rank = o.rank, t.children(n).length && (i.width = o.width, i.height = o.height));
@@ -19193,24 +19370,24 @@ function ZF(e, t) {
     i.points = o.points, Object.hasOwn(o, "x") && (i.x = o.x, i.y = o.y);
   }), e.graph().width = t.graph().width, e.graph().height = t.graph().height;
 }
-let JF = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], QF = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, eR = ["acyclicer", "ranker", "rankdir", "align"], tR = ["width", "height", "rank"], Ed = { width: 0, height: 0 }, nR = ["minlen", "weight", "width", "height", "labeloffset"], iR = {
+let tR = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], nR = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, iR = ["acyclicer", "ranker", "rankdir", "align"], oR = ["width", "height", "rank"], Ed = { width: 0, height: 0 }, rR = ["minlen", "weight", "width", "height", "labeloffset"], aR = {
   minlen: 1,
   weight: 1,
   width: 0,
   height: 0,
   labeloffset: 10,
   labelpos: "r"
-}, oR = ["labelpos"];
-function rR(e) {
-  let t = new GF({ multigraph: !0, compound: !0 }), n = ts(e.graph());
+}, sR = ["labelpos"];
+function lR(e) {
+  let t = new XF({ multigraph: !0, compound: !0 }), n = ts(e.graph());
   return t.setGraph(Object.assign(
     {},
-    QF,
-    es(n, JF),
-    Bt.pick(n, eR)
+    nR,
+    es(n, tR),
+    Bt.pick(n, iR)
   )), e.nodes().forEach((i) => {
     let o = ts(e.node(i));
-    const r = es(o, tR);
+    const r = es(o, oR);
     Object.keys(Ed).forEach((a) => {
       r[a] === void 0 && (r[a] = Ed[a]);
     }), t.setNode(i, r), t.setParent(i, e.parent(i));
@@ -19218,20 +19395,20 @@ function rR(e) {
     let o = ts(e.edge(i));
     t.setEdge(i, Object.assign(
       {},
-      iR,
-      es(o, nR),
-      Bt.pick(o, oR)
+      aR,
+      es(o, rR),
+      Bt.pick(o, sR)
     ));
   }), t;
 }
-function aR(e) {
+function uR(e) {
   let t = e.graph();
   t.ranksep /= 2, e.edges().forEach((n) => {
     let i = e.edge(n);
     i.minlen *= 2, i.labelpos.toLowerCase() !== "c" && (t.rankdir === "TB" || t.rankdir === "BT" ? i.width += i.labeloffset : i.height += i.labeloffset);
   });
 }
-function sR(e) {
+function cR(e) {
   e.edges().forEach((t) => {
     let n = e.edge(t);
     if (n.width && n.height) {
@@ -19240,20 +19417,20 @@ function sR(e) {
     }
   });
 }
-function lR(e) {
+function dR(e) {
   let t = 0;
   e.nodes().forEach((n) => {
     let i = e.node(n);
     i.borderTop && (i.minRank = e.node(i.borderTop).rank, i.maxRank = e.node(i.borderBottom).rank, t = Math.max(t, i.maxRank));
   }), e.graph().maxRank = t;
 }
-function uR(e) {
+function fR(e) {
   e.nodes().forEach((t) => {
     let n = e.node(t);
     n.dummy === "edge-proxy" && (e.edge(n.e).labelRank = n.rank, e.removeNode(t));
   });
 }
-function cR(e) {
+function pR(e) {
   let t = Number.POSITIVE_INFINITY, n = 0, i = Number.POSITIVE_INFINITY, o = 0, r = e.graph(), a = r.marginx || 0, s = r.marginy || 0;
   function l(u) {
     let d = u.x, c = u.y, f = u.width, m = u.height;
@@ -19272,13 +19449,13 @@ function cR(e) {
     }), Object.hasOwn(d, "x") && (d.x -= t), Object.hasOwn(d, "y") && (d.y -= i);
   }), r.width = n - t + a, r.height = o - i + s;
 }
-function dR(e) {
+function mR(e) {
   e.edges().forEach((t) => {
     let n = e.edge(t), i = e.node(t.v), o = e.node(t.w), r, a;
     n.points ? (r = n.points[0], a = n.points[n.points.length - 1]) : (n.points = [], r = o, a = i), n.points.unshift(Bt.intersectRect(i, r)), n.points.push(Bt.intersectRect(o, a));
   });
 }
-function fR(e) {
+function gR(e) {
   e.edges().forEach((t) => {
     let n = e.edge(t);
     if (Object.hasOwn(n, "x"))
@@ -19292,13 +19469,13 @@ function fR(e) {
       }
   });
 }
-function pR(e) {
+function hR(e) {
   e.edges().forEach((t) => {
     let n = e.edge(t);
     n.reversed && n.points.reverse();
   });
 }
-function mR(e) {
+function vR(e) {
   e.nodes().forEach((t) => {
     if (e.children(t).length) {
       let n = e.node(t), i = e.node(n.borderTop), o = e.node(n.borderBottom), r = e.node(n.borderLeft[n.borderLeft.length - 1]), a = e.node(n.borderRight[n.borderRight.length - 1]);
@@ -19308,7 +19485,7 @@ function mR(e) {
     e.node(t).dummy === "border" && e.removeNode(t);
   });
 }
-function gR(e) {
+function yR(e) {
   e.edges().forEach((t) => {
     if (t.v === t.w) {
       var n = e.node(t.v);
@@ -19316,7 +19493,7 @@ function gR(e) {
     }
   });
 }
-function hR(e) {
+function _R(e) {
   var t = Bt.buildLayerMatrix(e);
   t.forEach((n) => {
     var i = 0;
@@ -19335,7 +19512,7 @@ function hR(e) {
     });
   });
 }
-function vR(e) {
+function bR(e) {
   e.nodes().forEach((t) => {
     var n = e.node(t);
     if (n.dummy === "selfedge") {
@@ -19359,12 +19536,12 @@ function ts(e) {
     typeof n == "string" && (n = n.toLowerCase()), t[n] = i;
   }), t;
 }
-let yR = ft, _R = Xt.Graph;
-var bR = {
-  debugOrdering: wR
+let wR = ft, ER = Xt.Graph;
+var kR = {
+  debugOrdering: CR
 };
-function wR(e) {
-  let t = yR.buildLayerMatrix(e), n = new _R({ compound: !0, multigraph: !0 }).setGraph({});
+function CR(e) {
+  let t = wR.buildLayerMatrix(e), n = new ER({ compound: !0, multigraph: !0 }).setGraph({});
   return e.nodes().forEach((i) => {
     n.setNode(i, { label: i }), n.setParent(i, "layer" + e.node(i).rank);
   }), e.edges().forEach((i) => n.setEdge(i.v, i.w, {}, i.name)), t.forEach((i, o) => {
@@ -19372,31 +19549,23 @@ function wR(e) {
     n.setNode(r, { rank: "same" }), i.reduce((a, s) => (n.setEdge(a, s, { style: "invis" }), s));
   }), n;
 }
-var ER = "1.1.5", kR = {
+var SR = "1.1.5", xR = {
   graphlib: Xt,
-  layout: YF,
-  debug: bR,
+  layout: ZF,
+  debug: kR,
   util: {
     time: ft.time,
     notime: ft.notime
   },
-  version: ER
+  version: SR
 };
-const kd = /* @__PURE__ */ bP(kR);
-function CR() {
+const kd = /* @__PURE__ */ kP(xR);
+function AR() {
   const t = it(m1, (...n) => {
     console.warn("TOASTER_PROVIDER is not provided", ...n);
   });
   return (n) => t(n);
 }
-const ro = {
-  padding: 80,
-  gaps: {
-    nodes: 40,
-    edges: 80,
-    ranks: 40
-  }
-}, SR = 1600, xR = 1.2, AR = 0, yg = Symbol("confirm-modal");
 function zr(e, t, n) {
   const i = t ? In(e, n, t) : void 0;
   return `${e.name}${i ? `.${i.name}` : ""}`;
@@ -19408,7 +19577,7 @@ function wo(e, t) {
     zr(i, e.targetField, "input")
   ];
 }
-function Hs(e, t, n, i, o) {
+function Ys(e, t, n, i, o) {
   const r = o(e), a = o(n);
   return [
     zr(r, t, "output"),
@@ -19416,13 +19585,13 @@ function Hs(e, t, n, i, o) {
   ];
 }
 function TR(e) {
-  nt(yg, e);
+  nt(Hm, e);
 }
-function _g() {
-  return it(yg, void 0);
+function bg() {
+  return it(Hm, void 0);
 }
 function IR() {
-  const e = _g();
+  const e = bg();
   if (!e) throw new Error("Confirm modal not provided");
   return e;
 }
@@ -19453,9 +19622,9 @@ const NR = {
   hover: mk,
   selected: pk
 };
-let bg, Gs;
+let wg, Ws;
 function sr(e) {
-  const t = e.id === bg ? "selected" : e.id === Gs ? "hover" : "default", n = NR[t], { markerEnd: i } = e, o = typeof i == "object" ? { ...i, color: n } : { type: i, color: n };
+  const t = e.id === wg ? "selected" : e.id === Ws ? "hover" : "default", n = NR[t], { markerEnd: i } = e, o = typeof i == "object" ? { ...i, color: n } : { type: i, color: n };
   return {
     ...e,
     style: {
@@ -19476,7 +19645,7 @@ const [OR, PR] = zd(
       nodes: l = ro.gaps.nodes,
       edges: u = ro.gaps.edges,
       ranks: d = ro.gaps.ranks
-    } = s, c = Ye(n), f = Ft(), m = _g(), h = CR(), { i18n: { t: v } } = qe(), {
+    } = s, c = Ye(n), f = Ft(), m = bg(), h = AR(), { i18n: { t: v } } = qe(), {
       findNode: g,
       fitView: y,
       deleteKeyCode: b,
@@ -19571,7 +19740,7 @@ const [OR, PR] = zd(
         targetField: T == null ? void 0 : T.field
       }, !1);
       if (re.push(
-        Hs(
+        Ys(
           X,
           C == null ? void 0 : C.field,
           R,
@@ -19604,7 +19773,7 @@ const [OR, PR] = zd(
       X && U(X.id, X.position);
     }), N((X) => {
       X.filter((R) => R.type === "select").sort((R, k) => R.selected === k.selected ? 0 : R.selected ? 1 : -1).forEach((R) => {
-        bg = R.selected ? R.id : void 0, I((k) => k.map((C) => C.id !== R.id || !C.markerEnd ? C : sr({
+        wg = R.selected ? R.id : void 0, I((k) => k.map((C) => C.id !== R.id || !C.markerEnd ? C : sr({
           ...C,
           zIndex: R.selected ? 1 : void 0
         })));
@@ -19612,9 +19781,9 @@ const [OR, PR] = zd(
         R.type === "remove" && K(R.id, !0);
       });
     }), Y(({ edge: X }) => {
-      Gs = X.id, I((ae) => ae.map((R) => R.id !== X.id ? R : sr(R)));
+      Ws = X.id, I((ae) => ae.map((R) => R.id !== X.id ? R : sr(R)));
     }), W(({ edge: X }) => {
-      Gs = void 0, I((ae) => ae.map((R) => R.id !== X.id ? R : sr(R)));
+      Ws = void 0, I((ae) => ae.map((R) => R.id !== X.id ? R : sr(R)));
     }), j(({ edge: X, connection: ae }) => {
       K(X.id, !1), Se(ae);
     });
@@ -19700,7 +19869,7 @@ const [OR, PR] = zd(
       }
       const B = z(), ne = B.x2 - B.x1, q = B.y2 - B.y1, we = Math.max(
         0,
-        Math.min(Ie(r == null ? void 0 : r.width) ?? Number.POSITIVE_INFINITY, SR) - ne - 2 * l - T.dimensions.width - A.dimensions.width - 2 * a
+        Math.min(Ie(r == null ? void 0 : r.width) ?? Number.POSITIVE_INFINITY, bP) - ne - 2 * l - T.dimensions.width - A.dimensions.width - 2 * a
       ), ge = B.y1 + q / 2;
       U(X.data.id, {
         x: B.x1 - l - we / 2 - T.dimensions.width,
@@ -19727,178 +19896,7 @@ const [OR, PR] = zd(
       fitView: ue
     };
   }
-), Bi = "{key}", Hn = {
-  "kong.client.consumer": {
-    dataType: "object",
-    writable: !1,
-    readable: !0
-  },
-  "kong.client.consumer_groups": {
-    dataType: "array",
-    writable: !1,
-    readable: !0
-  },
-  "kong.client.credential": {
-    dataType: "object",
-    writable: !1,
-    readable: !0
-  },
-  "kong.client.get_identity_realm_source": {
-    dataType: "object",
-    writable: !1,
-    readable: !0
-  },
-  "kong.client.forwarded_ip": {
-    dataType: "string",
-    writable: !1,
-    readable: !0
-  },
-  "kong.client.forwarded_port": {
-    dataType: "number",
-    writable: !1,
-    readable: !0
-  },
-  "kong.client.ip": {
-    dataType: "string",
-    writable: !1,
-    readable: !0
-  },
-  "kong.client.port": {
-    dataType: "number",
-    writable: !1,
-    readable: !0
-  },
-  "kong.client.protocol": {
-    dataType: "string",
-    writable: !1,
-    readable: !0
-  },
-  "kong.request.forwarded_host": {
-    dataType: "string",
-    writable: !1,
-    readable: !0
-  },
-  "kong.request.forwarded_port": {
-    dataType: "number",
-    writable: !1,
-    readable: !0
-  },
-  "kong.request.forwarded_scheme": {
-    dataType: "string",
-    writable: !1,
-    readable: !0
-  },
-  "kong.request.port": {
-    dataType: "number",
-    writable: !1,
-    readable: !0
-  },
-  "kong.response.source": {
-    dataType: "string",
-    writable: !1,
-    readable: !0
-  },
-  "kong.router.route": {
-    dataType: "object",
-    writable: !1,
-    readable: !0
-  },
-  "kong.route_id": {
-    dataType: "string",
-    writable: !1,
-    readable: !0
-  },
-  "kong.route_name": {
-    dataType: "string",
-    writable: !1,
-    readable: !0
-  },
-  "kong.router.service": {
-    dataType: "object",
-    writable: !1,
-    readable: !0
-  },
-  "kong.service_name": {
-    dataType: "string",
-    writable: !1,
-    readable: !0
-  },
-  "kong.service_id": {
-    dataType: "string",
-    writable: !1,
-    readable: !0
-  },
-  "kong.service.response.status": {
-    dataType: "number",
-    writable: !1,
-    readable: !0
-  },
-  "kong.version": {
-    dataType: "string",
-    writable: !1,
-    readable: !0
-  },
-  "kong.node.id": {
-    dataType: "string",
-    writable: !1,
-    readable: !0
-  },
-  "kong.configuration.{key}": {
-    dataType: "any",
-    writable: !1,
-    readable: !0
-  },
-  "kong.service.target": {
-    dataType: "string ({host}:{port})",
-    writable: !0,
-    readable: !1
-  },
-  "kong.service.request_scheme": {
-    dataType: "string ({scheme})",
-    writable: !0,
-    readable: !1
-  },
-  "kong.ctx.plugin.{key}": {
-    dataType: "any",
-    writable: !0,
-    readable: !0
-  },
-  "kong.ctx.shared.{key}": {
-    dataType: "any",
-    writable: !0,
-    readable: !0
-  }
-}, Sa = Object.keys(Hn).filter((e) => e.includes(Bi)).map((e) => e.replace(Bi, ""));
-function Ys(e) {
-  if (!e || !Do(e)) return;
-  const t = Sa.find((n) => e.startsWith(n));
-  if (t)
-    return e.slice(t.length).replace(Bi, "");
-}
-function po(e) {
-  if (!e) return null;
-  const t = Sa.find((n) => e.startsWith(n));
-  return t || e;
-}
-function Do(e) {
-  return e ? Sa.some((t) => e.startsWith(t)) : !1;
-}
-function wg(e) {
-  return e ? Do(e) ? po(e) + Bi : e : null;
-}
-function Yl(e) {
-  var n;
-  if (!e) return !1;
-  const t = wg(e);
-  return t ? ((n = Hn[t]) == null ? void 0 : n.readable) ?? !1 : !1;
-}
-function Ws(e) {
-  var n;
-  if (!e) return !1;
-  const t = wg(e);
-  return t ? ((n = Hn[t]) == null ? void 0 : n.writable) ?? !1 : !1;
-}
-const MR = /* @__PURE__ */ he({
+), MR = /* @__PURE__ */ he({
   __name: "HandleTwig",
   props: {
     color: {},
@@ -19977,14 +19975,14 @@ const MR = /* @__PURE__ */ he({
       var x, S;
       if (e.data.type === "property") {
         const E = (x = e.data.config) == null ? void 0 : x.property;
-        return Ws(E);
+        return Us(E);
       }
       return (S = a.value.io) == null ? void 0 : S.input;
     }), f = F(() => {
       var x, S;
       if (e.data.type === "property") {
         const E = (x = e.data.config) == null ? void 0 : x.property;
-        return Yl(E);
+        return zl(E);
       }
       return (S = a.value.io) == null ? void 0 : S.output;
     }), m = F(() => Mp(e.data)), h = F(() => e.data.phase === "response"), v = F(() => e.data.phase === "request" ? Te.Left : Te.Right), g = F(() => e.data.phase === "request" ? Te.Right : Te.Left), y = F(() => m.value ? t(`plugins.free-form.datakit.flow_editor.node_types.${e.data.type}.name`) : e.data.name), b = F(() => m.value ? uk : ck);
@@ -20146,8 +20144,8 @@ const MR = /* @__PURE__ */ he({
       ], 2)
     ], 2));
   }
-}), kg = /* @__PURE__ */ Pe(WR, [["__scopeId", "data-v-e55b53e2"]]), XR = /* @__PURE__ */ he({
-  __name: "EditorCanvasFlow",
+}), kg = /* @__PURE__ */ Pe(WR, [["__scopeId", "data-v-53d68cac"]]), XR = /* @__PURE__ */ he({
+  __name: "FlowCanvas",
   props: {
     flowId: {},
     phase: {},
@@ -20216,8 +20214,8 @@ const MR = /* @__PURE__ */ he({
         class: Ge(["flow", { readonly: Y.readonly }]),
         edges: p(u),
         "elements-selectable": !Y.readonly,
-        "max-zoom": p(xR),
-        "min-zoom": p(AR),
+        "max-zoom": p(wP),
+        "min-zoom": p(EP),
         "multi-selection-key-code": null,
         nodes: p(l),
         "nodes-connectable": !Y.readonly,
@@ -20262,8 +20260,8 @@ const MR = /* @__PURE__ */ he({
       }, 8, ["id", "class", "edges", "elements-selectable", "max-zoom", "min-zoom", "nodes", "nodes-connectable", "nodes-draggable", "pan-on-drag", "pan-on-scroll", "zoom-on-double-click", "zoom-on-pinch", "zoom-on-scroll"])
     ], 512));
   }
-}), Sd = /* @__PURE__ */ Pe(XR, [["__scopeId", "data-v-f5036b92"]]), ZR = /* @__PURE__ */ he({
-  __name: "EditorCanvas",
+}), Sd = /* @__PURE__ */ Pe(XR, [["__scopeId", "data-v-7a524f21"]]), ZR = /* @__PURE__ */ he({
+  __name: "FlowPanels",
   props: {
     readonly: { type: Boolean },
     resizable: { type: Boolean }
@@ -20378,7 +20376,7 @@ const MR = /* @__PURE__ */ he({
       ], 6)
     ], 512));
   }
-}), Cg = /* @__PURE__ */ Pe(ZR, [["__scopeId", "data-v-b40e388c"]]), JR = { class: "dk-confirm-modal-body" }, QR = { class: "dk-confirm-modal-connections" }, eD = /* @__PURE__ */ he({
+}), Cg = /* @__PURE__ */ Pe(ZR, [["__scopeId", "data-v-9e1d5742"]]), JR = { class: "dk-confirm-modal-body" }, QR = { class: "dk-confirm-modal-connections" }, eD = /* @__PURE__ */ he({
   __name: "ConflictConnectionConfirmModal",
   props: {
     title: {},
@@ -20561,7 +20559,7 @@ const MR = /* @__PURE__ */ he({
       ], 512)
     ]));
   }
-}), fD = /* @__PURE__ */ Pe(dD, [["__scopeId", "data-v-2abb236d"]]), pD = { class: "icon" }, mD = { class: "content" }, gD = { class: "title" }, hD = { class: "description" }, vD = /* @__PURE__ */ he({
+}), fD = /* @__PURE__ */ Pe(dD, [["__scopeId", "data-v-8f04d495"]]), pD = { class: "icon" }, mD = { class: "content" }, gD = { class: "title" }, hD = { class: "description" }, vD = /* @__PURE__ */ he({
   __name: "NodePanelItem",
   props: {
     type: {}
@@ -21348,7 +21346,7 @@ function di(e, t) {
       target: e,
       targetField: xe
     }, !1);
-    const ue = Hs(
+    const ue = Ys(
       fe,
       pe,
       e,
@@ -21377,7 +21375,7 @@ function di(e, t) {
       targetField: void 0
       // input does not have a field
     }, !1);
-    const pe = Hs(
+    const pe = Ys(
       ee,
       fe,
       e,
@@ -21399,7 +21397,7 @@ function di(e, t) {
     var oe, de;
     const L = [];
     for (const ee of n.value.nodes)
-      if ((oe = Nl(ee.type).io) != null && oe.output && ee.fields.output && ee.id !== e && !(ee.type === "property" && !Yl((de = ee.config) == null ? void 0 : de.property)) && !$(ee.id)) {
+      if ((oe = Nl(ee.type).io) != null && oe.output && ee.fields.output && ee.id !== e && !(ee.type === "property" && !zl((de = ee.config) == null ? void 0 : de.property)) && !$(ee.id)) {
         L.push({ value: ee.id, label: ee.name });
         for (const pe of ee.fields.output)
           L.push({
@@ -22040,7 +22038,7 @@ const ZD = /* @__PURE__ */ he({
   },
   emits: ["update:model-value", "update:property-key"],
   setup(e, { emit: t }) {
-    const { i18n: { t: n } } = qe(), i = e, o = t, { formData: r } = st(), a = ie(po(r.property)), s = F(() => Do(r.property)), l = ie(Ys(r.property)), u = F(() => r.property ?? ""), d = F(() => Object.entries(Hn).map(([m]) => {
+    const { i18n: { t: n } } = qe(), i = e, o = t, { formData: r } = st(), a = ie(fo(r.property)), s = F(() => Do(r.property)), l = ie(zs(r.property)), u = F(() => r.property ?? ""), d = F(() => Object.entries(Hn).map(([m]) => {
       var g;
       const h = Do(m) ? (g = r.property) == null ? void 0 : g.startsWith(m.replace(Bi, "")) : r.property === m;
       return {
@@ -22050,17 +22048,17 @@ const ZD = /* @__PURE__ */ he({
       };
     }));
     function c(m) {
-      const h = Sa.find((v) => {
+      const h = ka.find((v) => {
         var g;
         return (g = r.property) == null ? void 0 : g.startsWith(v);
       });
       h && (r.property = h + m, i.validators.key.handleChange(r.property), o("update:property-key", r.property));
     }
     function f(m) {
-      a.value !== po(m == null ? void 0 : m.value) && (r.property = (m == null ? void 0 : m.value) || null, a.value = po(r.property), i.validators.property.handleBlur(() => r.property), o("update:model-value", r.property));
+      a.value !== fo(m == null ? void 0 : m.value) && (r.property = (m == null ? void 0 : m.value) || null, a.value = fo(r.property), i.validators.property.handleBlur(() => r.property), o("update:model-value", r.property));
     }
     return $e(() => r.property, (m) => {
-      l.value = Ys(m), a.value = po(m);
+      l.value = zs(m), a.value = fo(m);
     }), (m, h) => {
       const v = be("KBadge"), g = be("KSelect"), y = be("KInput");
       return w(), Q(Re, null, [
@@ -22144,13 +22142,13 @@ const ZD = /* @__PURE__ */ he({
       toggleNodeValid: h,
       skipValidationOnMount: v,
       fieldNameValidator: g
-    } = di(e.nodeId, () => t.value.getInnerData()), y = F(() => Ws(a.value.property));
+    } = di(e.nodeId, () => t.value.getInnerData()), y = F(() => Us(a.value.property));
     function b(x) {
       var E;
       const S = (E = n.value) == null ? void 0 : E.id;
       if (!S)
         throw new Error("Expected selectedNode to be defined");
-      Yl(x) || o(S, !1), Ws(x) || i(S, !1), l();
+      zl(x) || o(S, !1), Us(x) || i(S, !1), l();
     }
     const {
       fields: _
@@ -22165,7 +22163,7 @@ const ZD = /* @__PURE__ */ he({
       }),
       getValidationData: () => ({
         property: a.value.property,
-        key: Ys(a.value.property)
+        key: zs(a.value.property)
       }),
       skipValidationOnMount: v,
       toggleNodeValid: h
@@ -22467,7 +22465,7 @@ const ZD = /* @__PURE__ */ he({
       ]);
     };
   }
-}), CL = /* @__PURE__ */ Pe(kL, [["__scopeId", "data-v-615e9dae"]]), SL = ["innerHTML"], xL = /* @__PURE__ */ he({
+}), CL = /* @__PURE__ */ Pe(kL, [["__scopeId", "data-v-0ff36ac6"]]), SL = ["innerHTML"], xL = /* @__PURE__ */ he({
   __name: "DatakitForm",
   props: {
     generalInfoTitle: {},