vue-data-ui 3.9.3 → 3.9.5

package/dist/vue-ui-dag-BMXgf925.js

@@ -1,2687 +0,0 @@
-import { ref as y, watchEffect as qo, unref as v, defineAsyncComponent as Ue, toRefs as Ko, computed as j, onMounted as Pt, nextTick as Me, watch as $e, onBeforeUnmount as Jo, createElementBlock as N, openBlock as k, normalizeStyle as ie, normalizeClass as Bt, createCommentVNode as S, createBlock as U, createVNode as Xe, toDisplayString as ke, withCtx as M, renderSlot as A, normalizeProps as z, guardReactiveProps as V, createSlots as Qo, createElementVNode as ee, Fragment as le, renderList as De, withModifiers as en, mergeProps as qe, createTextVNode as tn, Transition as zt, Teleport as Vt } from "vue";
-import { c as st, az as on, t as nn, o as sn, g as It, l as Gt, X as rn, a9 as ln } from "./lib-_nVZfi2t.js";
-import { t as an, u as cn } from "./useResponsive-DfdjqQps.js";
-import { u as un } from "./usePanZoom-CDF7rb3o.js";
-import { u as dn, a as Ke } from "./useNestedProp-DjZhR3_5.js";
-import { u as fn, B as hn } from "./BaseScanner-BMpwQAfz.js";
-import { u as mn } from "./usePrinter-DXIMGR61.js";
-import { u as gn } from "./useSvgExport-DrjCWun4.js";
-import { u as vn } from "./useThemeCheck-DGJ31Vi5.js";
-import { u as pn } from "./useUserOptionState-BIvW1Kz7.js";
-import { u as bn } from "./useChartAccessibility-9icAAmYg.js";
-import wn from "./Title-Bf2WqM40.js";
-import { B as jt } from "./BaseZoomControls-gNf811C7.js";
-import yn from "./img-C5q4A7ke.js";
-import { _ as kn } from "./_plugin-vue_export-helper-CHgC5LLL.js";
-const En = "\0", te = "\0", Wt = "
";
-class X {
-  _isDirected = !0;
-  _isMultigraph = !1;
-  _isCompound = !1;
-  // Label for the graph itself
-  _label;
-  // Defaults to be set when creating a new node
-  _defaultNodeLabelFn = () => {
-  };
-  // Defaults to be set when creating a new edge
-  _defaultEdgeLabelFn = () => {
-  };
-  // v -> label
-  _nodes = {};
-  // v -> edgeObj
-  _in = {};
-  // u -> v -> Number
-  _preds = {};
-  // v -> edgeObj
-  _out = {};
-  // v -> w -> Number
-  _sucs = {};
-  // e -> edgeObj
-  _edgeObjs = {};
-  // e -> label
-  _edgeLabels = {};
-  /* Number of nodes in the graph. Should only be changed by the implementation. */
-  _nodeCount = 0;
-  /* Number of edges in the graph. Should only be changed by the implementation. */
-  _edgeCount = 0;
-  _parent;
-  _children;
-  constructor(t) {
-    t && (this._isDirected = Object.hasOwn(t, "directed") ? t.directed : !0, this._isMultigraph = Object.hasOwn(t, "multigraph") ? t.multigraph : !1, this._isCompound = Object.hasOwn(t, "compound") ? t.compound : !1), this._isCompound && (this._parent = {}, this._children = {}, this._children[te] = {});
-  }
-  /* === Graph functions ========= */
-  /**
-   * Whether graph was created with 'directed' flag set to true or not.
-   */
-  isDirected() {
-    return this._isDirected;
-  }
-  /**
-   * Whether graph was created with 'multigraph' flag set to true or not.
-   */
-  isMultigraph() {
-    return this._isMultigraph;
-  }
-  /**
-   * Whether graph was created with 'compound' flag set to true or not.
-   */
-  isCompound() {
-    return this._isCompound;
-  }
-  /**
-   * Sets the label of the graph.
-   */
-  setGraph(t) {
-    return this._label = t, this;
-  }
-  /**
-   * Gets the graph label.
-   */
-  graph() {
-    return this._label;
-  }
-  /* === Node functions ========== */
-  /**
-   * Sets the default node label. If newDefault is a function, it will be
-   * invoked each time when setting a label for a node. Otherwise, this label
-   * will be assigned as default label in case if no label was specified while
-   * setting a node.
-   * Complexity: O(1).
-   */
-  setDefaultNodeLabel(t) {
-    return this._defaultNodeLabelFn = t, typeof t != "function" && (this._defaultNodeLabelFn = () => t), this;
-  }
-  /**
-   * Gets the number of nodes in the graph.
-   * Complexity: O(1).
-   */
-  nodeCount() {
-    return this._nodeCount;
-  }
-  /**
-   * Gets all nodes of the graph. Note, the in case of compound graph subnodes are
-   * not included in list.
-   * Complexity: O(1).
-   */
-  nodes() {
-    return Object.keys(this._nodes);
-  }
-  /**
-   * Gets list of nodes without in-edges.
-   * Complexity: O(|V|).
-   */
-  sources() {
-    const t = this;
-    return this.nodes().filter((o) => Object.keys(t._in[o]).length === 0);
-  }
-  /**
-   * Gets list of nodes without out-edges.
-   * Complexity: O(|V|).
-   */
-  sinks() {
-    const t = this;
-    return this.nodes().filter((o) => Object.keys(t._out[o]).length === 0);
-  }
-  /**
-   * Invokes setNode method for each node in names list.
-   * Complexity: O(|names|).
-   */
-  setNodes(t, o) {
-    const n = arguments, s = this;
-    return t.forEach((i) => {
-      n.length > 1 ? s.setNode(i, o) : s.setNode(i);
-    }), this;
-  }
-  /**
-   * Creates or updates the value for the node v in the graph. If value is supplied
-   * it is set as the value for the node. If value is not supplied and the node was
-   * created by this call then the default node label will be assigned.
-   * Complexity: O(1).
-   */
-  setNode(t, o) {
-    return Object.hasOwn(this._nodes, t) ? (arguments.length > 1 && (this._nodes[t] = o), this) : (this._nodes[t] = arguments.length > 1 ? o : this._defaultNodeLabelFn(t), this._isCompound && (this._parent[t] = te, this._children[t] = {}, this._children[te][t] = !0), this._in[t] = {}, this._preds[t] = {}, this._out[t] = {}, this._sucs[t] = {}, ++this._nodeCount, this);
-  }
-  /**
-   * Gets the label of node with specified name.
-   * Complexity: O(1).
-   */
-  node(t) {
-    return this._nodes[t];
-  }
-  /**
-   * Detects whether graph has a node with specified name or not.
-   */
-  hasNode(t) {
-    return Object.hasOwn(this._nodes, t);
-  }
-  /**
-   * Remove the node with the name from the graph or do nothing if the node is not in
-   * the graph. If the node was removed this function also removes any incident
-   * edges.
-   * Complexity: O(1).
-   */
-  removeNode(t) {
-    const o = this;
-    if (Object.hasOwn(this._nodes, t)) {
-      const n = (s) => o.removeEdge(o._edgeObjs[s]);
-      delete this._nodes[t], this._isCompound && (this._removeFromParentsChildList(t), delete this._parent[t], this.children(t).forEach((s) => {
-        o.setParent(s);
-      }), delete this._children[t]), Object.keys(this._in[t]).forEach(n), delete this._in[t], delete this._preds[t], Object.keys(this._out[t]).forEach(n), delete this._out[t], delete this._sucs[t], --this._nodeCount;
-    }
-    return this;
-  }
-  /**
-   * Sets node parentId as a parent for node nodeId if it is defined, or removes the
-   * parent for nodeId if parentId is undefined. Method throws an exception in case of
-   * invoking it in context of noncompound graph.
-   * Average-case complexity: O(1).
-   */
-  setParent(t, o) {
-    if (!this._isCompound)
-      throw new Error("Cannot set parent in a non-compound graph");
-    if (o === void 0)
-      o = te;
-    else {
-      o += "";
-      for (let n = o; n !== void 0; n = this.parent(n))
-        if (n === t)
-          throw new Error(
-            "Setting " + o + " as parent of " + t + " would create a cycle"
-          );
-      this.setNode(o);
-    }
-    return this.setNode(t), this._removeFromParentsChildList(t), this._parent[t] = o, this._children[o][t] = !0, this;
-  }
-  _removeFromParentsChildList(t) {
-    delete this._children[this._parent[t]][t];
-  }
-  /**
-   * Gets parent node for node nodeId.
-   * Complexity: O(1).
-   */
-  parent(t) {
-    if (this._isCompound) {
-      const o = this._parent[t];
-      if (o !== te)
-        return o;
-    }
-  }
-  /**
-   * Gets list of direct children of node nodeId.
-   * Complexity: O(1).
-   */
-  children(t = te) {
-    if (this._isCompound) {
-      const o = this._children[t];
-      if (o)
-        return Object.keys(o);
-    } else {
-      if (t === te)
-        return this.nodes();
-      if (this.hasNode(t))
-        return [];
-    }
-  }
-  /**
-   * Return all nodes that are predecessors of the specified node or undefined if nodeId is not in
-   * the graph. Behavior is undefined for undirected graphs - use neighbors instead.
-   * Complexity: O(|V|).
-   */
-  predecessors(t) {
-    const o = this._preds[t];
-    if (o)
-      return Object.keys(o);
-  }
-  /**
-   * Return all nodes that are successors of the specified node or undefined if nodeId is not in
-   * the graph. Behavior is undefined for undirected graphs - use neighbors instead.
-   * Complexity: O(|V|).
-   */
-  successors(t) {
-    const o = this._sucs[t];
-    if (o)
-      return Object.keys(o);
-  }
-  /**
-   * Return all nodes that are predecessors or successors of the specified node or undefined if
-   * nodeId is not in the graph.
-   * Complexity: O(|V|).
-   */
-  neighbors(t) {
-    const o = this.predecessors(t);
-    if (o) {
-      const n = new Set(o);
-      for (const s of this.successors(t))
-        n.add(s);
-      return Array.from(n.values());
-    }
-  }
-  isLeaf(t) {
-    let o;
-    return this.isDirected() ? o = this.successors(t) : o = this.neighbors(t), o.length === 0;
-  }
-  /**
-   * Creates new graph with nodes filtered via filter. Edges incident to rejected node
-   * are also removed. In case of compound graph, if parent is rejected by filter,
-   * then all its children are rejected too.
-   * Average-case complexity: O(|E|+|V|).
-   */
-  filterNodes(t) {
-    const o = new this.constructor({
-      directed: this._isDirected,
-      multigraph: this._isMultigraph,
-      compound: this._isCompound
-    });
-    o.setGraph(this.graph());
-    const n = this;
-    Object.entries(this._nodes).forEach(([r, l]) => {
-      t(r) && o.setNode(r, l);
-    }), Object.values(this._edgeObjs).forEach((r) => {
-      o.hasNode(r.v) && o.hasNode(r.w) && o.setEdge(r, n.edge(r));
-    });
-    const s = {};
-    function i(r) {
-      const l = n.parent(r);
-      return l === void 0 || o.hasNode(l) ? (s[r] = l, l) : l in s ? s[l] : i(l);
-    }
-    return this._isCompound && o.nodes().forEach((r) => o.setParent(r, i(r))), o;
-  }
-  /* === Edge functions ========== */
-  /**
-   * Sets the default edge label or factory function. This label will be
-   * assigned as default label in case if no label was specified while setting
-   * an edge or this function will be invoked each time when setting an edge
-   * with no label specified and returned value will be used as a label for edge.
-   * Complexity: O(1).
-   */
-  setDefaultEdgeLabel(t) {
-    return this._defaultEdgeLabelFn = t, typeof t != "function" && (this._defaultEdgeLabelFn = () => t), this;
-  }
-  /**
-   * Gets the number of edges in the graph.
-   * Complexity: O(1).
-   */
-  edgeCount() {
-    return this._edgeCount;
-  }
-  /**
-   * Gets edges of the graph. In case of compound graph subgraphs are not considered.
-   * Complexity: O(|E|).
-   */
-  edges() {
-    return Object.values(this._edgeObjs);
-  }
-  /**
-   * Establish an edges path over the nodes in nodeIds list. If some edge already
-   * exists, it will update its label, otherwise it will create an edge between pair
-   * of nodes with label provided or default label if no label provided.
-   * Complexity: O(|nodeIds|).
-   */
-  setPath(t, o) {
-    const n = this, s = arguments;
-    return t.reduce((i, r) => (s.length > 1 ? n.setEdge(i, r, o) : n.setEdge(i, r), r)), this;
-  }
-  /**
-   * Creates or updates the label for the edge (v, w) with the optionally supplied
-   * name. If value is supplied it is set as the value for the edge. If value is not
-   * supplied and the edge was created by this call then the default edge label will
-   * be assigned. The name parameter is only useful with multigraphs.
-   */
-  setEdge() {
-    let t, o, n, s, i = !1;
-    const r = arguments[0];
-    typeof r == "object" && r !== null && "v" in r ? (t = r.v, o = r.w, n = r.name, arguments.length === 2 && (s = arguments[1], i = !0)) : (t = r, o = arguments[1], n = arguments[3], arguments.length > 2 && (s = arguments[2], i = !0)), t = "" + t, o = "" + o, n !== void 0 && (n = "" + n);
-    let l = Ee(this._isDirected, t, o, n);
-    if (Object.hasOwn(this._edgeLabels, l))
-      return i && (this._edgeLabels[l] = s), this;
-    if (n !== void 0 && !this._isMultigraph)
-      throw new Error("Cannot set a named edge when isMultigraph = false");
-    this.setNode(t), this.setNode(o), this._edgeLabels[l] = i ? s : this._defaultEdgeLabelFn(t, o, n);
-    const a = Cn(this._isDirected, t, o, n);
-    return t = a.v, o = a.w, Object.freeze(a), this._edgeObjs[l] = a, Yt(this._preds[o], t), Yt(this._sucs[t], o), this._in[o][l] = a, this._out[t][l] = a, this._edgeCount++, this;
-  }
-  /**
-   * Gets the label for the specified edge.
-   * Complexity: O(1).
-   */
-  edge(t, o, n) {
-    const s = arguments.length === 1 ? Je(this._isDirected, arguments[0]) : Ee(this._isDirected, t, o, n);
-    return this._edgeLabels[s];
-  }
-  /**
-   * Gets the label for the specified edge and converts it to an object.
-   * Complexity: O(1)
-   */
-  edgeAsObj() {
-    const t = this.edge(...arguments);
-    return typeof t != "object" ? { label: t } : t;
-  }
-  /**
-   * Detects whether the graph contains specified edge or not. No subgraphs are considered.
-   * Complexity: O(1).
-   */
-  hasEdge(t, o, n) {
-    const s = arguments.length === 1 ? Je(this._isDirected, arguments[0]) : Ee(this._isDirected, t, o, n);
-    return Object.hasOwn(this._edgeLabels, s);
-  }
-  /**
-   * Removes the specified edge from the graph. No subgraphs are considered.
-   * Complexity: O(1).
-   */
-  removeEdge(t, o, n) {
-    const s = arguments.length === 1 ? Je(this._isDirected, arguments[0]) : Ee(this._isDirected, t, o, n), i = this._edgeObjs[s];
-    return i && (t = i.v, o = i.w, delete this._edgeLabels[s], delete this._edgeObjs[s], Ht(this._preds[o], t), Ht(this._sucs[t], o), delete this._in[o][s], delete this._out[t][s], this._edgeCount--), this;
-  }
-  /**
-   * Return all edges that point to the node v. Optionally filters those edges down to just those
-   * coming from node u. Behavior is undefined for undirected graphs - use nodeEdges instead.
-   * Complexity: O(|E|).
-   */
-  inEdges(t, o) {
-    const n = this._in[t];
-    if (n) {
-      const s = Object.values(n);
-      return o ? s.filter((i) => i.v === o) : s;
-    }
-  }
-  /**
-   * Return all edges that are pointed at by node v. Optionally filters those edges down to just
-   * those pointing to w. Behavior is undefined for undirected graphs - use nodeEdges instead.
-   * Complexity: O(|E|).
-   */
-  outEdges(t, o) {
-    const n = this._out[t];
-    if (n) {
-      const s = Object.values(n);
-      return o ? s.filter((i) => i.w === o) : s;
-    }
-  }
-  /**
-   * Returns all edges to or from node v regardless of direction. Optionally filters those edges
-   * down to just those between nodes v and w regardless of direction.
-   * Complexity: O(|E|).
-   */
-  nodeEdges(t, o) {
-    const n = this.inEdges(t, o);
-    if (n)
-      return n.concat(this.outEdges(t, o));
-  }
-}
-function Yt(e, t) {
-  e[t] ? e[t]++ : e[t] = 1;
-}
-function Ht(e, t) {
-  --e[t] || delete e[t];
-}
-function Ee(e, t, o, n) {
-  let s = "" + t, i = "" + o;
-  if (!e && s > i) {
-    const r = s;
-    s = i, i = r;
-  }
-  return s + Wt + i + Wt + (n === void 0 ? En : n);
-}
-function Cn(e, t, o, n) {
-  let s = "" + t, i = "" + o;
-  if (!e && s > i) {
-    const l = s;
-    s = i, i = l;
-  }
-  const r = { v: s, w: i };
-  return n && (r.name = n), r;
-}
-function Je(e, t) {
-  return Ee(e, t.v, t.w, t.name);
-}
-class _n {
-  constructor() {
-    const t = {};
-    t._next = t._prev = t, this._sentinel = t;
-  }
-  dequeue() {
-    const t = this._sentinel, o = t._prev;
-    if (o !== t)
-      return Zt(o), o;
-  }
-  enqueue(t) {
-    const o = this._sentinel;
-    t._prev && t._next && Zt(t), t._next = o._next, o._next._prev = t, o._next = t, t._prev = o;
-  }
-  toString() {
-    const t = [], o = this._sentinel;
-    let n = o._prev;
-    for (; n !== o; )
-      t.push(JSON.stringify(n, xn)), n = n._prev;
-    return "[" + t.join(", ") + "]";
-  }
-}
-function Zt(e) {
-  e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
-}
-function xn(e, t) {
-  if (e !== "_next" && e !== "_prev")
-    return t;
-}
-const Nn = () => 1;
-function An(e, t) {
-  if (e.nodeCount() <= 1)
-    return [];
-  const o = Ln(e, t || Nn);
-  return Sn(o.graph, o.buckets, o.zeroIndex).flatMap((s) => e.outEdges(s.v, s.w));
-}
-function Sn(e, t, o) {
-  let n = [];
-  const s = t[t.length - 1], i = t[0];
-  let r;
-  for (; e.nodeCount(); ) {
-    for (; r = i.dequeue(); )
-      Qe(e, t, o, r);
-    for (; r = s.dequeue(); )
-      Qe(e, t, o, r);
-    if (e.nodeCount()) {
-      for (let l = t.length - 2; l > 0; --l)
-        if (r = t[l].dequeue(), r) {
-          n = n.concat(Qe(e, t, o, r, !0));
-          break;
-        }
-    }
-  }
-  return n;
-}
-function Qe(e, t, o, n, s) {
-  const i = s ? [] : void 0;
-  return e.inEdges(n.v).forEach((r) => {
-    const l = e.edge(r), a = e.node(r.v);
-    s && i.push({ v: r.v, w: r.w }), a.out -= l, rt(t, o, a);
-  }), e.outEdges(n.v).forEach((r) => {
-    const l = e.edge(r), a = e.node(r.w);
-    a.in -= l, rt(t, o, a);
-  }), e.removeNode(n.v), i;
-}
-function Ln(e, t) {
-  const o = new X();
-  let n = 0, s = 0;
-  e.nodes().forEach((l) => {
-    o.setNode(l, { v: l, in: 0, out: 0 });
-  }), e.edges().forEach((l) => {
-    const a = o.edge(l.v, l.w) || 0, c = t(l), d = a + c;
-    o.setEdge(l.v, l.w, d), s = Math.max(s, o.node(l.v).out += c), n = Math.max(n, o.node(l.w).in += c);
-  });
-  const i = On(s + n + 3).map(() => new _n()), r = n + 1;
-  return o.nodes().forEach((l) => {
-    rt(i, r, o.node(l));
-  }), {
-    graph: o,
-    buckets: i,
-    zeroIndex: r
-  };
-}
-function rt(e, t, o) {
-  o.out ? o.in ? e[o.out - o.in + t].enqueue(o) : e[e.length - 1].enqueue(o) : e[0].enqueue(o);
-}
-function On(e) {
-  const t = [];
-  for (let o = 0; o < e; o++)
-    t.push(o);
-  return t;
-}
-function ce(e, t, o, n) {
-  let s = n;
-  for (; e.hasNode(s); )
-    s = Pe(n);
-  return o.dummy = t, e.setNode(s, o), s;
-}
-function so(e) {
-  const t = new X().setGraph(e.graph());
-  return e.nodes().forEach((o) => {
-    t.setNode(o, e.node(o));
-  }), e.edges().forEach((o) => {
-    const n = t.edge(o.v, o.w) || { weight: 0, minlen: 1 }, s = e.edge(o);
-    t.setEdge(o.v, o.w, {
-      weight: n.weight + s.weight,
-      minlen: Math.max(n.minlen, s.minlen)
-    });
-  }), t;
-}
-function lt(e) {
-  const t = new X({ multigraph: e.isMultigraph() }).setGraph(e.graph());
-  return e.nodes().forEach((o) => {
-    e.children(o).length || t.setNode(o, e.node(o));
-  }), e.edges().forEach((o) => {
-    t.setEdge(o, e.edge(o));
-  }), t;
-}
-function Tn(e) {
-  const t = e.nodes().map((o) => {
-    const n = {};
-    return e.outEdges(o).forEach((s) => {
-      n[s.w] = (n[s.w] || 0) + e.edge(s).weight;
-    }), n;
-  });
-  return Be(e.nodes(), t);
-}
-function Rn(e) {
-  const t = e.nodes().map((o) => {
-    const n = {};
-    return e.inEdges(o).forEach((s) => {
-      n[s.v] = (n[s.v] || 0) + e.edge(s).weight;
-    }), n;
-  });
-  return Be(e.nodes(), t);
-}
-function it(e, t) {
-  let o = e.x, n = e.y;
-  const s = t.x - o, i = t.y - n;
-  let r = e.width / 2, l = e.height / 2;
-  if (!s && !i)
-    throw new Error("Not possible to find intersection inside of the rectangle");
-  let a, c;
-  return Math.abs(i) * r > Math.abs(s) * l ? (i < 0 && (l = -l), a = l * s / i, c = l) : (s < 0 && (r = -r), a = r, c = r * i / s), { x: o + a, y: n + c };
-}
-function _e(e) {
-  const t = ae(at(e) + 1).map(() => []);
-  return e.nodes().forEach((o) => {
-    const n = e.node(o), s = n.rank;
-    s !== void 0 && (t[s][n.order] = o);
-  }), t;
-}
-function ro(e) {
-  const t = e.nodes().map((n) => {
-    const s = e.node(n).rank;
-    return s === void 0 ? Number.MAX_VALUE : s;
-  }), o = G(Math.min, t);
-  e.nodes().forEach((n) => {
-    const s = e.node(n);
-    Object.hasOwn(s, "rank") && (s.rank -= o);
-  });
-}
-function io(e) {
-  const t = e.nodes().map((r) => e.node(r).rank).filter((r) => r !== void 0), o = G(Math.min, t), n = [];
-  e.nodes().forEach((r) => {
-    const l = e.node(r).rank - o;
-    n[l] || (n[l] = []), n[l].push(r);
-  });
-  let s = 0;
-  const i = e.graph().nodeRankFactor;
-  Array.from(n).forEach((r, l) => {
-    r === void 0 && l % i !== 0 ? --s : r !== void 0 && s && r.forEach((a) => {
-      e.node(a).rank += s;
-    });
-  });
-}
-function Mn(e, t, o, n) {
-  const s = {
-    width: 0,
-    height: 0
-  };
-  return arguments.length >= 4 && (s.rank = o, s.order = n), ce(e, "border", s, t);
-}
-const lo = 65535;
-function $n(e, t = lo) {
-  const o = [];
-  for (let n = 0; n < e.length; n += t) {
-    const s = e.slice(n, n + t);
-    o.push(s);
-  }
-  return o;
-}
-function G(e, t) {
-  if (t.length > lo) {
-    const o = $n(t);
-    return e.apply(
-      null,
-      o.map((n) => e.apply(null, n))
-    );
-  } else
-    return e.apply(null, t);
-}
-function at(e) {
-  const o = e.nodes().map((n) => {
-    const s = e.node(n).rank;
-    return s === void 0 ? Number.MIN_VALUE : s;
-  });
-  return G(Math.max, o);
-}
-function ao(e, t) {
-  const o = { lhs: [], rhs: [] };
-  return e.forEach((n) => {
-    t(n) ? o.lhs.push(n) : o.rhs.push(n);
-  }), o;
-}
-function co(e, t) {
-  const o = Date.now();
-  try {
-    return t();
-  } finally {
-    console.log(e + " time: " + (Date.now() - o) + "ms");
-  }
-}
-function uo(e, t) {
-  return t();
-}
-let Dn = 0;
-function Pe(e) {
-  const t = ++Dn;
-  return e + String(t);
-}
-function ae(e, t, o = 1) {
-  t == null && (t = e, e = 0);
-  let n = (i) => i < t;
-  o < 0 && (n = (i) => t < i);
-  const s = [];
-  for (let i = e; n(i); i += o)
-    s.push(i);
-  return s;
-}
-function Ce(e, t) {
-  const o = {};
-  for (const n of t)
-    e[n] !== void 0 && (o[n] = e[n]);
-  return o;
-}
-function xe(e, t) {
-  let o = t;
-  if (typeof t == "string") {
-    const n = t;
-    o = (s) => s[n];
-  }
-  return Object.entries(e).reduce((n, [s, i]) => (n[s] = o(i, s), n), {});
-}
-function Be(e, t) {
-  return e.reduce((o, n, s) => (o[n] = t[s], o), {});
-}
-const Fe = {
-  addBorderNode: Mn,
-  addDummyNode: ce,
-  applyWithChunking: G,
-  asNonCompoundGraph: lt,
-  buildLayerMatrix: _e,
-  intersectRect: it,
-  mapValues: xe,
-  maxRank: at,
-  normalizeRanks: ro,
-  notime: uo,
-  partition: ao,
-  pick: Ce,
-  predecessorWeights: Rn,
-  range: ae,
-  removeEmptyRanks: io,
-  simplify: so,
-  successorWeights: Tn,
-  time: co,
-  uniqueId: Pe,
-  zipObject: Be
-};
-function Fn(e) {
-  (e.graph().acyclicer === "greedy" ? An(e, o(e)) : Bn(e)).forEach((n) => {
-    const s = e.edge(n);
-    e.removeEdge(n), s.forwardName = n.name, s.reversed = !0, e.setEdge(n.w, n.v, s, Pe("rev"));
-  });
-  function o(n) {
-    return (s) => n.edge(s).weight;
-  }
-}
-function Pn(e) {
-  e.edges().forEach((t) => {
-    const o = e.edge(t);
-    if (o.reversed) {
-      e.removeEdge(t);
-      const n = o.forwardName;
-      delete o.reversed, delete o.forwardName, e.setEdge(t.w, t.v, o, n);
-    }
-  });
-}
-function Bn(e) {
-  const t = [], o = {}, n = {};
-  function s(i) {
-    Object.hasOwn(n, i) || (n[i] = !0, o[i] = !0, e.outEdges(i).forEach((r) => {
-      Object.hasOwn(o, r.w) ? t.push(r) : s(r.w);
-    }), delete o[i]);
-  }
-  return e.nodes().forEach(s), t;
-}
-function zn(e) {
-  e.graph().dummyChains = [], e.edges().forEach((t) => Vn(e, t));
-}
-function Vn(e, t) {
-  let o = t.v, n = e.node(o).rank;
-  const s = t.w, i = e.node(s).rank, r = t.name, l = e.edge(t), a = l.labelRank;
-  if (i === n + 1)
-    return;
-  e.removeEdge(t);
-  let c, d, f;
-  for (f = 0, ++n; n < i; ++f, ++n)
-    l.points = [], d = {
-      width: 0,
-      height: 0,
-      edgeLabel: l,
-      edgeObj: t,
-      rank: n
-    }, c = ce(e, "edge", d, "_d"), n === a && (d.width = l.width, d.height = l.height, d.dummy = "edge-label", d.labelpos = l.labelpos), e.setEdge(o, c, { weight: l.weight }, r), f === 0 && e.graph().dummyChains.push(c), o = c;
-  e.setEdge(o, s, { weight: l.weight }, r);
-}
-function In(e) {
-  e.graph().dummyChains.forEach((t) => {
-    let o = e.node(t);
-    const n = o.edgeLabel;
-    e.setEdge(o.edgeObj, n);
-    let s;
-    for (; o.dummy; )
-      s = e.successors(t)[0], e.removeNode(t), n.points.push({ x: o.x, y: o.y }), o.dummy === "edge-label" && (n.x = o.x, n.y = o.y, n.width = o.width, n.height = o.height), t = s, o = e.node(t);
-  });
-}
-function fo(e) {
-  function t(o) {
-    const n = e.node(o);
-    if (n && Object.prototype.hasOwnProperty.call(n, "rank"))
-      return n.rank;
-    const s = e.outEdges(o) || [];
-    if (!s.length)
-      return n && (n.rank = 0), 0;
-    const i = s.map((l) => {
-      if (!e.node(l.w))
-        return Number.POSITIVE_INFINITY;
-      const c = t(l.w), d = e.edge(l).minlen;
-      return c - d;
-    });
-    let r = G(Math.min, i);
-    return r === Number.POSITIVE_INFINITY && (r = 0), n && (n.rank = r), r;
-  }
-  (e.sources() || []).forEach(t);
-}
-function Gn(e, t) {
-  return e.node(t.w).rank - e.node(t.v).rank - e.edge(t).minlen;
-}
-function jn(e) {
-  Wn(e);
-  const t = new X();
-  e.nodes().forEach((i) => {
-    t.setNode(i, {});
-  });
-  const o = e.nodes();
-  if (!o.length)
-    return t;
-  const n = o[0], s = /* @__PURE__ */ new Set([n]);
-  for (; s.size < o.length; ) {
-    const i = Yn(e, s);
-    if (!i) {
-      const d = o.find((f) => !s.has(f));
-      s.add(d), t.setNode(d, {});
-      continue;
-    }
-    const { edgeObject: r, delta: l, attachFrom: a, attachTo: c } = i;
-    Hn(e, s, a, l), t.setEdge(r.v, r.w, {}), s.add(c);
-  }
-  return t;
-}
-function Wn(e) {
-  e.nodes().forEach((t) => {
-    const o = e.node(t) || {};
-    Object.prototype.hasOwnProperty.call(o, "rank") || (o.rank = 0, e.setNode(t, o));
-  });
-}
-function Yn(e, t) {
-  let o = null;
-  return e.edges().forEach((n) => {
-    const s = t.has(n.v), i = t.has(n.w);
-    if (s === i)
-      return;
-    const r = Gn(e, n), l = Math.abs(r);
-    if (!o || l < o.absoluteSlack) {
-      const a = s ? n.v : n.w, c = s ? n.w : n.v, d = s ? r : -r;
-      o = {
-        edgeObject: n,
-        delta: d,
-        attachFrom: a,
-        attachTo: c,
-        absoluteSlack: l
-      };
-    }
-  }), o;
-}
-function Hn(e, t, o, n) {
-  n && e.nodes().forEach((s) => {
-    if (!t.has(s)) {
-      const i = e.node(s);
-      i.rank += n;
-    }
-  });
-}
-function ue(e) {
-  const t = so(e);
-  return fo(t), t.nodes().forEach((o) => {
-    const n = t.node(o), s = e.node(o) || {};
-    s.rank = n.rank, e.setNode(o, s);
-  }), e;
-}
-function Zn(e, t) {
-}
-function Un(e, t) {
-}
-function Xn(e, t, o) {
-  return 0;
-}
-function qn(e) {
-  return null;
-}
-function Kn(e, t) {
-  return null;
-}
-ue.initLowLimValues = Zn;
-ue.initCutValues = Un;
-ue.calcCutValue = Xn;
-ue.leaveEdge = qn;
-ue.enterEdge = Kn;
-const ho = fo;
-function Jn(e) {
-  const t = e.graph().ranker;
-  if (t instanceof Function)
-    return t(e);
-  switch (e.graph().ranker) {
-    case "network-simplex":
-      Ut(e);
-      break;
-    case "tight-tree":
-      es(e);
-      break;
-    case "longest-path":
-      Qn(e);
-      break;
-    case "none":
-      break;
-    default:
-      Ut(e);
-  }
-}
-const Qn = ho;
-function es(e) {
-  ho(e), jn(e);
-}
-function Ut(e) {
-  ue(e);
-}
-function ts(e) {
-  const t = ns(e);
-  e.graph().dummyChains.forEach((o) => {
-    let n = e.node(o);
-    const s = n.edgeObj, i = os(e, t, s.v, s.w), r = i.path, l = i.lca;
-    let a = 0, c = r[a], d = !0, f = o;
-    for (; f !== s.w; ) {
-      if (n = e.node(f), d) {
-        for (; (c = r[a]) !== l && e.node(c).maxRank < n.rank; )
-          a++;
-        c === l && (d = !1);
-      }
-      if (!d) {
-        for (; a < r.length - 1 && e.node(c = r[a + 1]).minRank <= n.rank; )
-          a++;
-        c = r[a];
-      }
-      e.setParent(f, c), f = e.successors(f)[0];
-    }
-  });
-}
-function os(e, t, o, n) {
-  const s = [], i = [], r = Math.min(t[o].low, t[n].low), l = Math.max(t[o].lim, t[n].lim);
-  let a, c;
-  a = o;
-  do
-    a = e.parent(a), s.push(a);
-  while (a && (t[a].low > r || l > t[a].lim));
-  for (c = a, a = n; (a = e.parent(a)) !== c; )
-    i.push(a);
-  return {
-    path: s.concat(i.reverse()),
-    lca: c
-  };
-}
-function ns(e) {
-  const t = {};
-  let o = 0;
-  function n(s) {
-    const i = o;
-    e.children(s).forEach(n), t[s] = { low: i, lim: o++ };
-  }
-  return e.children().forEach(n), t;
-}
-function ss(e) {
-  const t = Fe.addDummyNode(e, "root", {}, "_root"), o = rs(e), n = Object.values(o), s = Fe.applyWithChunking(Math.max, n) - 1, i = 2 * s + 1;
-  e.graph().nestingRoot = t, e.edges().forEach((l) => {
-    e.edge(l).minlen *= i;
-  });
-  const r = is(e) + 1;
-  e.children().forEach((l) => {
-    mo(e, t, i, r, s, o, l);
-  }), e.graph().nodeRankFactor = i;
-}
-function mo(e, t, o, n, s, i, r) {
-  const l = e.children(r);
-  if (!l.length) {
-    r !== t && e.setEdge(t, r, { weight: 0, minlen: o });
-    return;
-  }
-  const a = Fe.addBorderNode(e, "_bt"), c = Fe.addBorderNode(e, "_bb"), d = e.node(r);
-  e.setParent(a, r), d.borderTop = a, e.setParent(c, r), d.borderBottom = c, l.forEach((f) => {
-    mo(e, t, o, n, s, i, f);
-    const g = e.node(f), p = g.borderTop ? g.borderTop : f, x = g.borderBottom ? g.borderBottom : f, _ = g.borderTop ? n : 2 * n, T = p !== x ? 1 : s - i[r] + 1;
-    e.setEdge(a, p, {
-      weight: _,
-      minlen: T,
-      nestingEdge: !0
-    }), e.setEdge(x, c, {
-      weight: _,
-      minlen: T,
-      nestingEdge: !0
-    });
-  }), e.parent(r) || e.setEdge(t, a, {
-    weight: 0,
-    minlen: s + i[r]
-  });
-}
-function rs(e) {
-  const t = {};
-  function o(n, s) {
-    const i = e.children(n);
-    i && i.length && i.forEach((r) => o(r, s + 1)), t[n] = s;
-  }
-  return e.children().forEach((n) => o(n, 1)), t;
-}
-function is(e) {
-  return e.edges().reduce((t, o) => t + e.edge(o).weight, 0);
-}
-function ls(e) {
-  const t = e.graph();
-  e.removeNode(t.nestingRoot), delete t.nestingRoot, e.edges().forEach((o) => {
-    e.edge(o).nestingEdge && e.removeEdge(o);
-  });
-}
-function as(e) {
-  function t(o) {
-    const n = e.children(o), s = e.node(o);
-    if (n.length && n.forEach(t), Object.hasOwn(s, "minRank")) {
-      s.borderLeft = [], s.borderRight = [];
-      for (let i = s.minRank, r = s.maxRank + 1; i < r; ++i)
-        Xt(e, "borderLeft", "_bl", o, s, i), Xt(e, "borderRight", "_br", o, s, i);
-    }
-  }
-  e.children().forEach(t);
-}
-function Xt(e, t, o, n, s, i) {
-  const r = {
-    width: 0,
-    height: 0,
-    rank: i,
-    borderType: t
-  }, l = s[t][i - 1], a = ce(e, "border", r, o);
-  s[t][i] = a, e.setParent(a, n), l && e.setEdge(l, a, { weight: 1 });
-}
-function cs(e) {
-  const t = e.graph().rankdir.toLowerCase();
-  (t === "lr" || t === "rl") && go(e);
-}
-function us(e) {
-  const t = e.graph().rankdir.toLowerCase();
-  (t === "bt" || t === "rl") && ds(e), (t === "lr" || t === "rl") && (fs(e), go(e));
-}
-function go(e) {
-  e.nodes().forEach((t) => {
-    qt(e.node(t));
-  }), e.edges().forEach((t) => {
-    qt(e.edge(t));
-  });
-}
-function qt(e) {
-  const t = e.width;
-  e.width = e.height, e.height = t;
-}
-function ds(e) {
-  e.nodes().forEach((t) => {
-    et(e.node(t));
-  }), e.edges().forEach((t) => {
-    const o = e.edge(t);
-    o.points.forEach(et), Object.hasOwn(o, "y") && et(o);
-  });
-}
-function et(e) {
-  e.y = -e.y;
-}
-function fs(e) {
-  e.nodes().forEach((t) => {
-    tt(e.node(t));
-  }), e.edges().forEach((t) => {
-    const o = e.edge(t);
-    o.points.forEach(tt), Object.hasOwn(o, "x") && tt(o);
-  });
-}
-function tt(e) {
-  const t = e.x;
-  e.x = e.y, e.y = t;
-}
-const Kt = {
-  adjust: cs,
-  undo: us
-};
-function hs(e) {
-  const t = {}, o = e.nodes().filter((a) => e.children(a).length === 0), n = o.map((a) => e.node(a).rank), s = G(Math.max, n), i = ae(s + 1).map(() => []);
-  function r(a) {
-    if (t[a]) return;
-    t[a] = !0;
-    const c = e.node(a);
-    i[c.rank].push(a), e.successors(a).forEach(r);
-  }
-  return o.sort(
-    (a, c) => e.node(a).rank - e.node(c).rank
-  ).forEach(r), i;
-}
-function ms(e, t) {
-  let o = 0;
-  for (let n = 1; n < t.length; ++n)
-    o += gs(e, t[n - 1], t[n]);
-  return o;
-}
-function gs(e, t, o) {
-  const n = Be(
-    o,
-    o.map((c, d) => d)
-  ), s = t.flatMap((c) => e.outEdges(c).map((d) => ({
-    pos: n[d.w],
-    weight: e.edge(d).weight
-  })).sort((d, f) => d.pos - f.pos));
-  let i = 1;
-  for (; i < o.length; ) i <<= 1;
-  const r = 2 * i - 1;
-  i -= 1;
-  const l = new Array(r).fill(0);
-  let a = 0;
-  return s.forEach((c) => {
-    let d = c.pos + i;
-    l[d] += c.weight;
-    let f = 0;
-    for (; d > 0; )
-      d % 2 && (f += l[d + 1]), d = d - 1 >> 1, l[d] += c.weight;
-    a += c.weight * f;
-  }), a;
-}
-function vs(e, t = []) {
-  return t.map((o) => {
-    const n = e.inEdges(o);
-    if (!n.length)
-      return { v: o };
-    const s = n.reduce(
-      (i, r) => {
-        const l = e.edge(r), a = e.node(r.v);
-        return {
-          sum: i.sum + l.weight * a.order,
-          weight: i.weight + l.weight
-        };
-      },
-      { sum: 0, weight: 0 }
-    );
-    return {
-      v: o,
-      barycenter: s.sum / s.weight,
-      weight: s.weight
-    };
-  });
-}
-function ps(e, t) {
-  const o = {};
-  e.forEach((s, i) => {
-    const r = o[s.v] = {
-      indegree: 0,
-      in: [],
-      out: [],
-      vs: [s.v],
-      i
-    };
-    s.barycenter !== void 0 && (r.barycenter = s.barycenter, r.weight = s.weight);
-  }), t.edges().forEach((s) => {
-    const i = o[s.v], r = o[s.w];
-    i !== void 0 && r !== void 0 && (r.indegree++, i.out.push(r));
-  });
-  const n = Object.values(o).filter((s) => !s.indegree);
-  return bs(n);
-}
-function bs(e) {
-  const t = [];
-  function o(s) {
-    return (i) => {
-      i.merged || (i.barycenter === void 0 || s.barycenter === void 0 || i.barycenter >= s.barycenter) && ws(s, i);
-    };
-  }
-  function n(s) {
-    return (i) => {
-      i.in.push(s), --i.indegree === 0 && e.push(i);
-    };
-  }
-  for (; e.length; ) {
-    const s = e.pop();
-    t.push(s), s.in.reverse().forEach(o(s)), s.out.forEach(n(s));
-  }
-  return t.filter((s) => !s.merged).map((s) => Ce(s, ["vs", "i", "barycenter", "weight"]));
-}
-function ws(e, t) {
-  let o = 0, n = 0;
-  e.weight && (o += e.barycenter * e.weight, n += e.weight), t.weight && (o += t.barycenter * t.weight, n += t.weight), e.vs = t.vs.concat(e.vs), e.barycenter = o / n, e.weight = n, e.i = Math.min(t.i, e.i), t.merged = !0;
-}
-function ys(e, t) {
-  const o = ao(e, (d) => Object.hasOwn(d, "barycenter")), n = o.lhs, s = o.rhs.sort((d, f) => f.i - d.i), i = [];
-  let r = 0, l = 0, a = 0;
-  n.sort(ks(!!t)), a = Jt(i, s, a), n.forEach((d) => {
-    a += d.vs.length, i.push(d.vs), r += d.barycenter * d.weight, l += d.weight, a = Jt(i, s, a);
-  });
-  const c = { vs: i.flat(!0) };
-  return l && (c.barycenter = r / l, c.weight = l), c;
-}
-function Jt(e, t, o) {
-  let n;
-  for (; t.length && (n = t[t.length - 1]).i <= o; )
-    t.pop(), e.push(n.vs), o++;
-  return o;
-}
-function ks(e) {
-  return (t, o) => t.barycenter < o.barycenter ? -1 : t.barycenter > o.barycenter ? 1 : e ? o.i - t.i : t.i - o.i;
-}
-function vo(e, t, o, n) {
-  let s = e.children(t);
-  const i = e.node(t), r = i ? i.borderLeft : void 0, l = i ? i.borderRight : void 0, a = {};
-  r && (s = s.filter((g) => g !== r && g !== l));
-  const c = vs(e, s);
-  c.forEach((g) => {
-    if (e.children(g.v).length) {
-      const p = vo(e, g.v, o, n);
-      a[g.v] = p, Object.hasOwn(p, "barycenter") && Cs(g, p);
-    }
-  });
-  let d = ps(c, o);
-  Es(d, a);
-  const f = ys(d, n);
-  if (r && (f.vs = [r, f.vs, l].flat(!0), e.predecessors(r).length)) {
-    const g = e.node(e.predecessors(r)[0]), p = e.node(e.predecessors(l)[0]);
-    Object.hasOwn(f, "barycenter") || (f.barycenter = 0, f.weight = 0), f.barycenter = (f.barycenter * f.weight + g.order + p.order) / (f.weight + 2), f.weight += 2;
-  }
-  return f;
-}
-function Es(e, t) {
-  e.forEach((o) => {
-    o.vs = o.vs.flatMap((n) => t[n] ? t[n].vs : n);
-  });
-}
-function Cs(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);
-}
-function _s(e, t, o, n) {
-  n || (n = e.nodes());
-  const s = xs(e), i = new X({ compound: !0 }).setGraph({ root: s }).setDefaultNodeLabel((r) => e.node(r));
-  return n.forEach((r) => {
-    const l = e.node(r), a = e.parent(r);
-    (l.rank === t || l.minRank <= t && t <= l.maxRank) && (i.setNode(r), i.setParent(r, a || s), e[o](r).forEach((d) => {
-      const f = d.v === r ? d.w : d.v, g = i.edge(f, r), p = g ? g.weight : 0;
-      i.setEdge(f, r, {
-        weight: e.edge(d).weight + p
-      });
-    }), Object.hasOwn(l, "minRank") && i.setNode(r, {
-      borderLeft: l.borderLeft[t],
-      borderRight: l.borderRight[t]
-    }));
-  }), i;
-}
-function xs(e) {
-  let t;
-  for (; e.hasNode(t = Pe("_root")); ) ;
-  return t;
-}
-function Ns(e, t, o) {
-  let n = {}, s;
-  o.forEach((i) => {
-    let r = e.parent(i), l, a;
-    for (; r; ) {
-      if (l = e.parent(r), l ? (a = n[l], n[l] = r) : (a = s, s = r), a && a !== r) {
-        t.setEdge(a, r);
-        return;
-      }
-      r = l;
-    }
-  });
-}
-function po(e, t = {}) {
-  if (typeof t.customOrder == "function") {
-    t.customOrder(e, po);
-    return;
-  }
-  const o = at(e), n = Qt(
-    e,
-    ae(1, o + 1),
-    "inEdges"
-  ), s = Qt(
-    e,
-    ae(o - 1, -1, -1),
-    "outEdges"
-  );
-  let i = hs(e);
-  if (eo(e, i), t.disableOptimalOrderHeuristic)
-    return;
-  let r = Number.POSITIVE_INFINITY, l;
-  const a = t.constraints || [];
-  for (let c = 0, d = 0; d < 4; ++c, ++d) {
-    const f = c % 2 === 0 ? n : s, g = c % 4 >= 2;
-    As(f, g, a), i = _e(e);
-    const p = ms(e, i);
-    p < r ? (r = p, d = 0, l = structuredClone(i)) : p === r && (l = structuredClone(i));
-  }
-  eo(e, l);
-}
-function Qt(e, t, o) {
-  const n = /* @__PURE__ */ new Map();
-  function s(i, r) {
-    n.has(i) || n.set(i, []), n.get(i).push(r);
-  }
-  for (const i of e.nodes()) {
-    const r = e.node(i);
-    if (typeof r.rank == "number" && s(r.rank, i), typeof r.minRank == "number" && typeof r.maxRank == "number")
-      for (let l = r.minRank; l <= r.maxRank; l++)
-        l !== r.rank && s(l, i);
-  }
-  return t.map(
-    (i) => _s(
-      e,
-      i,
-      o,
-      n.get(i) || []
-    )
-  );
-}
-function As(e, t, o) {
-  const n = new X();
-  e.forEach((s) => {
-    o.forEach((l) => n.setEdge(l.left, l.right));
-    const i = s.graph().root, r = vo(s, i, n, t);
-    r.vs.forEach((l, a) => {
-      s.node(l).order = a;
-    }), Ns(s, n, r.vs);
-  });
-}
-function eo(e, t) {
-  Object.values(t).forEach((o) => {
-    o.forEach((n, s) => {
-      e.node(n).order = s;
-    });
-  });
-}
-function Ss(e, t) {
-  const o = {};
-  function n(s, i) {
-    let r = 0, l = 0;
-    const a = s.length, c = i[i.length - 1];
-    return i.forEach((d, f) => {
-      const g = Os(e, d), p = g ? e.node(g).order : a;
-      (g || d === c) && (i.slice(l, f + 1).forEach((x) => {
-        e.predecessors(x).forEach((_) => {
-          const T = e.node(_), W = T.order;
-          (W < r || p < W) && !(T.dummy && e.node(x).dummy) && bo(o, _, x);
-        });
-      }), l = f + 1, r = p);
-    }), i;
-  }
-  return t.length && t.reduce(n), o;
-}
-function Ls(e, t) {
-  const o = {};
-  function n(i, r, l, a, c) {
-    let d;
-    ae(r, l).forEach((f) => {
-      d = i[f], e.node(d).dummy && e.predecessors(d).forEach((g) => {
-        const p = e.node(g);
-        p.dummy && (p.order < a || p.order > c) && bo(o, g, d);
-      });
-    });
-  }
-  function s(i, r) {
-    let l = -1, a, c = 0;
-    return r.forEach((d, f) => {
-      if (e.node(d).dummy === "border") {
-        const g = e.predecessors(d);
-        g.length && (a = e.node(g[0]).order, n(r, c, f, l, a), c = f, l = a);
-      }
-      n(r, c, r.length, a, i.length);
-    }), r;
-  }
-  return t.length && t.reduce(s), o;
-}
-function Os(e, t) {
-  if (e.node(t).dummy)
-    return e.predecessors(t).find((o) => e.node(o).dummy);
-}
-function bo(e, t, o) {
-  if (t > o) {
-    const s = t;
-    t = o, o = s;
-  }
-  let n = e[t];
-  n || (e[t] = n = {}), n[o] = !0;
-}
-function Ts(e, t, o) {
-  if (t > o) {
-    const n = t;
-    t = o, o = n;
-  }
-  return !!e[t] && Object.hasOwn(e[t], o);
-}
-function Rs(e, t, o, n) {
-  const s = {}, i = {}, r = {};
-  return t.forEach((l) => {
-    l.forEach((a, c) => {
-      s[a] = a, i[a] = a, r[a] = c;
-    });
-  }), t.forEach((l) => {
-    let a = -1;
-    l.forEach((c) => {
-      let d = n(c);
-      if (d.length) {
-        d = d.sort((g, p) => r[g] - r[p]);
-        const f = (d.length - 1) / 2;
-        for (let g = Math.floor(f), p = Math.ceil(f); g <= p; ++g) {
-          const x = d[g];
-          i[c] === c && a < r[x] && !Ts(o, c, x) && (i[x] = c, i[c] = s[c] = s[x], a = r[x]);
-        }
-      }
-    });
-  }), { root: s, align: i };
-}
-function Ms(e, t, o, n, s) {
-  const i = {}, r = $s(e, t, o, s), l = s ? "borderLeft" : "borderRight";
-  function a(f, g) {
-    const p = r.nodes().slice(), x = {};
-    let _ = p.pop();
-    for (; _; ) {
-      if (x[_])
-        f(_);
-      else {
-        x[_] = !0, p.push(_);
-        for (const T of g(_))
-          p.push(T);
-      }
-      _ = p.pop();
-    }
-  }
-  function c(f) {
-    i[f] = r.inEdges(f).reduce((g, p) => Math.max(g, i[p.v] + r.edge(p)), 0);
-  }
-  function d(f) {
-    const g = r.outEdges(f).reduce((x, _) => Math.min(x, i[_.w] - r.edge(_)), Number.POSITIVE_INFINITY), p = e.node(f);
-    g !== Number.POSITIVE_INFINITY && p.borderType !== l && (i[f] = Math.max(i[f], g));
-  }
-  return a(c, r.predecessors.bind(r)), a(d, r.successors.bind(r)), Object.keys(n).forEach((f) => {
-    i[f] = i[o[f]];
-  }), i;
-}
-function $s(e, t, o, n) {
-  const s = new e.constructor(), i = e.graph(), r = zs(i.nodesep, i.edgesep, n);
-  return t.forEach((l) => {
-    let a;
-    l.forEach((c) => {
-      const d = o[c];
-      if (s.setNode(d), a) {
-        const f = o[a], g = s.edge(f, d);
-        s.setEdge(
-          f,
-          d,
-          Math.max(r(e, c, a), g || 0)
-        );
-      }
-      a = c;
-    });
-  }), s;
-}
-function Ds(e, t) {
-  return Object.values(t).reduce(
-    (o, n) => {
-      let s = Number.NEGATIVE_INFINITY, i = Number.POSITIVE_INFINITY;
-      Object.entries(n).forEach(([l, a]) => {
-        const c = Vs(e, l) / 2;
-        s = Math.max(a + c, s), i = Math.min(a - c, i);
-      });
-      const r = s - i;
-      return r < o[0] && (o = [r, n]), o;
-    },
-    [Number.POSITIVE_INFINITY, null]
-  )[1];
-}
-function Fs(e, t) {
-  const o = Object.values(t), n = G(Math.min, o), s = G(Math.max, o);
-  ["u", "d"].forEach((i) => {
-    ["l", "r"].forEach((r) => {
-      const l = i + r;
-      let a = e[l];
-      if (a === t) return;
-      const c = Object.values(a);
-      let d = n - G(Math.min, c);
-      r !== "l" && (d = s - G(Math.max, c)), d && (a = xe(a, (f) => f + d), e[l] = a);
-    });
-  });
-}
-function Ps(e, t) {
-  return xe(e.ul, (o, n) => {
-    if (t)
-      return e[t.toLowerCase()][n];
-    const s = Object.values(e).map((i) => i[n]).sort((i, r) => i - r);
-    return (s[1] + s[2]) / 2;
-  });
-}
-function Bs(e) {
-  const t = _e(e), o = Object.assign(
-    Ss(e, t),
-    Ls(e, t)
-  ), n = {};
-  let s;
-  ["u", "d"].forEach((r) => {
-    s = r === "u" ? t : Object.values(t).reverse(), ["l", "r"].forEach((l) => {
-      let a = s;
-      l === "r" && (a = a.map(
-        (g) => Object.values(g).reverse()
-      ));
-      const c = (r === "u" ? e.predecessors : e.successors).bind(e), d = Rs(
-        e,
-        a,
-        o,
-        c
-      );
-      let f = Ms(
-        e,
-        a,
-        d.root,
-        d.align,
-        l === "r"
-      );
-      l === "r" && (f = xe(f, (g) => -g)), n[r + l] = f;
-    });
-  });
-  const i = Ds(e, n);
-  return Fs(n, i), Ps(n, e.graph().align);
-}
-function zs(e, t, o) {
-  return (n, s, i) => {
-    const r = n.node(s), l = n.node(i);
-    let a = 0, c;
-    if (a += r.width / 2, Object.hasOwn(r, "labelpos"))
-      switch (r.labelpos.toLowerCase()) {
-        case "l":
-          c = -r.width / 2;
-          break;
-        case "r":
-          c = r.width / 2;
-          break;
-      }
-    if (c && (a += o ? c : -c), c = 0, a += (r.dummy ? t : e) / 2, a += (l.dummy ? t : e) / 2, a += l.width / 2, Object.hasOwn(l, "labelpos"))
-      switch (l.labelpos.toLowerCase()) {
-        case "l":
-          c = l.width / 2;
-          break;
-        case "r":
-          c = -l.width / 2;
-          break;
-      }
-    return c && (a += o ? c : -c), c = 0, a;
-  };
-}
-function Vs(e, t) {
-  return e.node(t).width;
-}
-function Is(e) {
-  const t = lt(e);
-  Gs(t);
-  const o = Bs(t);
-  Object.entries(o).forEach(([n, s]) => {
-    e.node(n).x = s;
-  });
-}
-function Gs(e) {
-  const t = _e(e), o = e.graph().ranksep;
-  let n = 0;
-  t.forEach((s) => {
-    const i = s.reduce((r, l) => {
-      const a = e.node(l).height;
-      return r > a ? r : a;
-    }, 0);
-    s.forEach((r) => {
-      e.node(r).y = n + i / 2;
-    }), n += i + o;
-  });
-}
-function js(e, t = {}) {
-  const o = t.debugTiming ? co : uo;
-  return o("layout", () => {
-    const n = o("  buildLayoutGraph", () => Qs(e));
-    return o("  runLayout", () => Ws(n, o, t)), o("  updateInputGraph", () => Ys(e, n)), n;
-  });
-}
-function Ws(e, t, o) {
-  t("    makeSpaceForEdgeLabels", () => er(e)), t("    removeSelfEdges", () => cr(e)), t("    acyclic", () => Fn(e)), t("    nestingGraph.run", () => ss(e)), t("    rank", () => Jn(lt(e))), t("    injectEdgeLabelProxies", () => tr(e)), t("    removeEmptyRanks", () => io(e)), t("    nestingGraph.cleanup", () => ls(e)), t("    normalizeRanks", () => ro(e)), t("    assignRankMinMax", () => or(e)), t("    removeEdgeLabelProxies", () => nr(e)), t("    normalize.run", () => zn(e)), t("    parentDummyChains", () => ts(e)), t("    addBorderSegments", () => as(e)), t("    order", () => po(e, o)), t("    insertSelfEdges", () => ur(e)), t("    adjustCoordinateSystem", () => Kt.adjust(e)), t("    position", () => Is(e)), t("    positionSelfEdges", () => dr(e)), t("    removeBorderNodes", () => ar(e)), t("    normalize.undo", () => In(e)), t("    fixupEdgeLabelCoords", () => ir(e)), t("    undoCoordinateSystem", () => Kt.undo(e)), t("    translateGraph", () => sr(e)), t("    assignNodeIntersects", () => rr(e)), t("    reversePoints", () => lr(e)), t("    acyclic.undo", () => Pn(e));
-}
-function Ys(e, t) {
-  e.nodes().forEach((s) => {
-    const i = e.node(s), r = t.node(s);
-    i && (i.x = r.x, i.y = r.y, i.order = r.order, i.rank = r.rank, t.children(s).length && (i.width = r.width, i.height = r.height));
-  }), e.edges().forEach((s) => {
-    const i = e.edge(s), r = t.edge(s);
-    i.points = r.points, Object.hasOwn(r, "x") && (i.x = r.x, i.y = r.y);
-  });
-  const o = t.graph(), n = e.graph();
-  n.width = o.width, n.height = o.height;
-}
-const Hs = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], Zs = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, Us = ["acyclicer", "ranker", "rankdir", "align"], Xs = ["width", "height", "rank"], to = { width: 0, height: 0 }, qs = ["minlen", "weight", "width", "height", "labeloffset"], Ks = {
-  minlen: 1,
-  weight: 1,
-  width: 0,
-  height: 0,
-  labeloffset: 10,
-  labelpos: "r"
-}, Js = ["labelpos", "arrowshape"];
-function Qs(e) {
-  const t = nt(e.graph()), o = {
-    ...Zs,
-    ...ot(t, Hs),
-    ...Ce(t, Us)
-  }, n = new X({ multigraph: !0, compound: !0 });
-  return n.setGraph(o), e.nodes().forEach((s) => {
-    const i = nt(e.node(s)), r = ot(i, Xs);
-    Object.keys(to).forEach((l) => {
-      r[l] === void 0 && (r[l] = to[l]);
-    }), n.setNode(s, r), n.setParent(s, e.parent(s));
-  }), e.edges().forEach((s) => {
-    const i = nt(e.edge(s));
-    n.setEdge(
-      s,
-      {
-        ...Ks,
-        ...ot(i, qs),
-        ...Ce(i, Js)
-      }
-    );
-  }), n;
-}
-function er(e) {
-  const t = e.graph();
-  t.ranksep /= 2, e.edges().forEach((o) => {
-    const n = e.edge(o);
-    n.minlen *= 2, n.labelpos.toLowerCase() !== "c" && (t.rankdir === "TB" || t.rankdir === "BT" ? n.width += n.labeloffset : n.height += n.labeloffset);
-  });
-}
-function tr(e) {
-  e.edges().forEach((t) => {
-    const o = e.edge(t);
-    if (o.width && o.height) {
-      const n = e.node(t.v), i = { rank: (e.node(t.w).rank - n.rank) / 2 + n.rank, e: t };
-      ce(e, "edge-proxy", i, "_ep");
-    }
-  });
-}
-function or(e) {
-  let t = 0;
-  e.nodes().forEach((o) => {
-    const n = e.node(o);
-    n.borderTop && (n.minRank = e.node(n.borderTop).rank, n.maxRank = e.node(n.borderBottom).rank, t = Math.max(t, n.maxRank));
-  }), e.graph().maxRank = t;
-}
-function nr(e) {
-  e.nodes().forEach((t) => {
-    const o = e.node(t);
-    o.dummy === "edge-proxy" && (e.edge(o.e).labelRank = o.rank, e.removeNode(t));
-  });
-}
-function sr(e) {
-  let t = Number.POSITIVE_INFINITY, o = 0, n = Number.POSITIVE_INFINITY, s = 0;
-  const i = e.graph(), r = i.marginx || 0, l = i.marginy || 0;
-  function a(c) {
-    const d = c.x, f = c.y, g = c.width, p = c.height;
-    t = Math.min(t, d - g / 2), o = Math.max(o, d + g / 2), n = Math.min(n, f - p / 2), s = Math.max(s, f + p / 2);
-  }
-  e.nodes().forEach((c) => a(e.node(c))), e.edges().forEach((c) => {
-    const d = e.edge(c);
-    Object.hasOwn(d, "x") && a(d);
-  }), t -= r, n -= l, e.nodes().forEach((c) => {
-    const d = e.node(c);
-    d.x -= t, d.y -= n;
-  }), e.edges().forEach((c) => {
-    const d = e.edge(c);
-    d.points.forEach((f) => {
-      f.x -= t, f.y -= n;
-    }), Object.hasOwn(d, "x") && (d.x -= t), Object.hasOwn(d, "y") && (d.y -= n);
-  }), i.width = o - t + r, i.height = s - n + l;
-}
-function oo(e, t, o) {
-  if (!t)
-    return e;
-  const n = t.x - e.x, s = t.y - e.y, i = Math.sqrt(n * n + s * s);
-  if (!i || i <= o)
-    return e;
-  const r = o / i;
-  return {
-    x: e.x + n * r,
-    y: e.y + s * r
-  };
-}
-function rr(e) {
-  e.edges().forEach((o) => {
-    const n = e.edge(o), s = e.node(o.v), i = e.node(o.w);
-    let r, l;
-    !n.points || !n.points.length ? (n.points = [], r = i, l = s) : (r = n.points[0], l = n.points[n.points.length - 1]);
-    const a = it(s, r), c = it(i, l), d = n.points.length ? n.points[0] : r, f = n.points.length ? n.points[n.points.length - 1] : l, g = n.arrowshape, p = g === "normal" || g === "vee", x = !!n.reversed;
-    let _ = a, T = c;
-    p && (x ? _ = oo(a, d, 4) : T = oo(c, f, 4)), n.points.unshift(_), n.points.push(T);
-  });
-}
-function ir(e) {
-  e.edges().forEach((t) => {
-    const o = e.edge(t);
-    if (Object.hasOwn(o, "x"))
-      switch ((o.labelpos === "l" || o.labelpos === "r") && (o.width -= o.labeloffset), o.labelpos) {
-        case "l":
-          o.x -= o.width / 2 + o.labeloffset;
-          break;
-        case "r":
-          o.x += o.width / 2 + o.labeloffset;
-          break;
-      }
-  });
-}
-function lr(e) {
-  e.edges().forEach((t) => {
-    const o = e.edge(t);
-    o.reversed && o.points.reverse();
-  });
-}
-function ar(e) {
-  e.nodes().forEach((t) => {
-    if (e.children(t).length) {
-      const o = e.node(t), n = e.node(o.borderTop), s = e.node(o.borderBottom), i = e.node(o.borderLeft[o.borderLeft.length - 1]), r = e.node(o.borderRight[o.borderRight.length - 1]);
-      o.width = Math.abs(r.x - i.x), o.height = Math.abs(s.y - n.y), o.x = i.x + o.width / 2, o.y = n.y + o.height / 2;
-    }
-  }), e.nodes().forEach((t) => {
-    e.node(t).dummy === "border" && e.removeNode(t);
-  });
-}
-function cr(e) {
-  e.edges().forEach((t) => {
-    if (t.v === t.w) {
-      const o = e.node(t.v);
-      o.selfEdges || (o.selfEdges = []), o.selfEdges.push({ e: t, label: e.edge(t) }), e.removeEdge(t);
-    }
-  });
-}
-function ur(e) {
-  _e(e).forEach((o) => {
-    let n = 0;
-    o.forEach((s, i) => {
-      const r = e.node(s);
-      r.order = i + n, (r.selfEdges || []).forEach((l) => {
-        ce(e, "selfedge", {
-          width: l.label.width,
-          height: l.label.height,
-          rank: r.rank,
-          order: i + ++n,
-          e: l.e,
-          label: l.label
-        }, "_se");
-      }), delete r.selfEdges;
-    });
-  });
-}
-function dr(e) {
-  e.nodes().forEach((t) => {
-    const o = e.node(t);
-    if (o.dummy === "selfedge") {
-      const n = e.node(o.e.v), s = n.x + n.width / 2, i = n.y, r = o.x - s, l = n.height / 2;
-      e.setEdge(o.e, o.label), e.removeNode(t), o.label.points = [
-        { x: s + 2 * r / 3, y: i - l },
-        { x: s + 5 * r / 6, y: i - l },
-        { x: s + r, y: i },
-        { x: s + 5 * r / 6, y: i + l },
-        { x: s + 2 * r / 3, y: i + l }
-      ], o.label.x = o.x, o.label.y = o.y;
-    }
-  });
-}
-function ot(e, t) {
-  return xe(Ce(e, t), Number);
-}
-function nt(e) {
-  const t = {};
-  return e && Object.entries(e).forEach(([o, n]) => {
-    let s = o;
-    typeof s == "string" && (s = s.toLowerCase()), t[s] = n;
-  }), t;
-}
-const fr = {
-  rankDirection: "TB",
-  // "TB", "BT", "LR", "RL"
-  nodeSeparation: 50,
-  rankSeparation: 50,
-  edgeSeparation: 10,
-  // "UL", "UR", "DL", "DR" or undefined force one of four extreme alignment strategies (Up/Down × Left/Right).
-  align: void 0,
-  nodeWidth: 100,
-  nodeHeight: 40,
-  curvedEdges: !1,
-  padding: 20,
-  // "undirected" | "normal" | "vee"
-  arrowShape: "normal",
-  arrowSize: 10
-};
-function hr(e) {
-  return e.length ? e.map(
-    (t, o) => `${o === 0 ? "M" : "L"} ${t.x} ${t.y}`
-  ).join(" ") : "";
-}
-function mr(e) {
-  if (!e.length) return "";
-  if (e.length === 1) {
-    const s = e[0];
-    return `M ${s.x} ${s.y}`;
-  }
-  if (e.length === 2)
-    return `M ${e[0].x} ${e[0].y} L ${e[1].x} ${e[1].y}`;
-  const [t] = e;
-  let o = `M ${t.x} ${t.y}`;
-  for (let s = 1; s < e.length - 1; s += 1) {
-    e[s - 1];
-    const i = e[s], r = e[s + 1], l = i.x, a = i.y, c = (i.x + r.x) / 2, d = (i.y + r.y) / 2;
-    o += ` Q ${l} ${a} ${c} ${d}`;
-  }
-  const n = e[e.length - 1];
-  return o += ` L ${n.x} ${n.y}`, o;
-}
-function gr(e) {
-  const { nodes: t, edges: o, configuration: n } = e, s = y(null), i = y(null), r = `dag-arrow-${st()}`;
-  function l(a, c, d) {
-    i.value = null, s.value = null;
-    const f = {
-      ...fr,
-      ...d
-    }, g = new X({ multigraph: !0, compound: !0 });
-    g.setGraph({
-      rankdir: f.rankDirection,
-      nodesep: f.nodeSeparation,
-      ranksep: f.rankSeparation,
-      edgesep: f.edgeSeparation,
-      align: f.align
-    }), a.forEach((u) => {
-      g.setNode(u.id, {
-        label: u.label,
-        width: u.width ?? f.nodeWidth,
-        height: u.height ?? f.nodeHeight
-      });
-    }), c.forEach((u) => {
-      g.setEdge(u.from, u.to, {
-        weight: u.weight ?? 1,
-        minlen: u.minLength ?? 1,
-        arrowShape: f.arrowShape ?? "normal"
-      });
-    }), js(g);
-    const p = a.map((u) => {
-      const I = g.node(u.id);
-      return {
-        id: u.id,
-        label: u.label,
-        x: I.x,
-        y: I.y,
-        width: I.width,
-        height: I.height,
-        original: u
-      };
-    }), x = g.edges().map((u) => {
-      const I = g.edge(u), Y = I.points || [];
-      if (!Y.length)
-        return null;
-      const Ne = f.curvedEdges ? mr(Y) : hr(Y), Ae = f.arrowShape !== "undirected" ? `url(#${r})` : null, Se = c.find((fe) => fe?.from === u.v && fe?.to === u.w);
-      return {
-        id: `${u.v}->${u.w}->${st()}`,
-        from: u.v,
-        to: u.w,
-        points: Y,
-        pathData: Ne,
-        markerEnd: Ae,
-        original: {
-          ...Se,
-          ...I
-        }
-      };
-    }).filter(Boolean), _ = f.padding;
-    if (!p.length) {
-      s.value = {
-        nodes: [],
-        edges: x,
-        viewBox: "0 0 0 0",
-        arrowShape: f.arrowShape,
-        arrowSize: f.arrowSize
-      };
-      return;
-    }
-    const T = p.flatMap((u) => [
-      u.x - u.width / 2,
-      u.x + u.width / 2
-    ]), W = p.flatMap((u) => [
-      u.y - u.height / 2,
-      u.y + u.height / 2
-    ]), de = Math.min(...T) - _, oe = Math.max(...T) + _, R = Math.min(...W) - _, P = Math.max(...W) + _;
-    s.value = {
-      nodes: p,
-      edges: x.map((u) => ({
-        ...u,
-        midpoint: u.pathData ? on(u.pathData) : { x: 0, y: 0 }
-      })),
-      viewBox: `${de} ${R} ${oe - de} ${P - R}`,
-      arrowShape: f.arrowShape,
-      arrowSize: f.arrowSize
-    };
-  }
-  return qo(() => {
-    try {
-      const a = v(t) || [], c = v(o) || [], d = v(n) || {};
-      l(a, c, d);
-    } catch (a) {
-      console.error("[useDag] layout error:", a), i.value = a, s.value = null;
-    }
-  }), {
-    layoutData: s,
-    lastError: i,
-    arrowMarkerIdentifier: r,
-    recomputeLayout: () => {
-      const a = v(t) || [], c = v(o) || [], d = v(n) || {};
-      l(a, c, d);
-    }
-  };
-}
-const wo = { style: { chart: { backgroundColor: "#1A1A1A", color: "#CCCCCC", nodes: { stroke: "#6A6A6A", backgroundColor: "#2A2A2A", labels: { color: "#CCCCCC" }, tooltip: { backgroundColor: "#3A3A3A", color: "#CCCCCC" } }, edges: { stroke: "#6A6A6A" }, midpoints: { stroke: "#6A6A6A", fill: "#1A1A1A", tooltip: { backgroundColor: "#3A3A3A", color: "#CCCCCC" } }, controls: { backgroundColor: "#2A2A2A", buttonColor: "#2A2A2A", color: "#CCCCCC", border: "1px solid #4A4A4A" }, title: { color: "#CCCCCC", subtitle: { color: "#757575" } } } } }, yo = { style: { chart: { backgroundColor: "#FFF8E1", color: "#424242", nodes: { stroke: "#5D4037", backgroundColor: "#fcf9f0", labels: { color: "#424242" }, tooltip: { backgroundColor: "#5D4037", color: "#FFF8E1" } }, edges: { stroke: "#5D4037" }, midpoints: { stroke: "#5D4037", fill: "#FFF8E1", tooltip: { backgroundColor: "#5D4037", color: "#FFF8E1" } }, controls: { backgroundColor: "#FFF8E1", buttonColor: "#FFF8E1", color: "#424242", border: "1px solid #d9bbb2" }, title: { color: "#424242", subtitle: { color: "#757575" } } } } }, ko = { style: { chart: { backgroundColor: "#1E1E1E", color: "#BDBDBD", nodes: { stroke: "#965039", backgroundColor: "#2A2A2A", labels: { color: "#BDBDBD" }, tooltip: { backgroundColor: "#3A3A3A", color: "#FFF8E1" } }, edges: { stroke: "#965039" }, midpoints: { stroke: "#965039", fill: "#1E1E1E", tooltip: { backgroundColor: "#3A3A3A", color: "#FFF8E1" } }, controls: { backgroundColor: "#1E1E1E", buttonColor: "#1E1E1E", color: "#BDBDBD", border: "1px solid #3A3A3A" }, title: { color: "#FFF8E1", subtitle: { color: "#BDBDBD" } } } } }, Eo = { style: { chart: { backgroundColor: "#1A1A1A", color: "#99AA99", nodes: { stroke: "#66CC66", backgroundColor: "#2A2A2A", labels: { color: "#99AA99" }, tooltip: { backgroundColor: "#3A3A3A", color: "#99AA99" } }, edges: { stroke: "#66CC66" }, midpoints: { stroke: "#66CC66", fill: "#1A1A1A", tooltip: { backgroundColor: "#3A3A3A", color: "#99AA99" } }, controls: { backgroundColor: "#1A1A1A", buttonColor: "#1A1A1A", color: "#99AA99", border: "1px solid #1e361e" }, title: { color: "#66CC66", subtitle: { color: "#99AA99" } } } } }, Co = { style: { chart: { backgroundColor: "#fbfafa", color: "#8A9892", nodes: { stroke: "#8F837A", backgroundColor: "#ffffff", labels: { color: "#8A9892" }, tooltip: { backgroundColor: "#8F837A", color: "#fbfafa" } }, edges: { stroke: "#8F837A" }, midpoints: { stroke: "#8F837A", fill: "#fbfafa", tooltip: { backgroundColor: "#8F837A", color: "#fbfafa" } }, controls: { backgroundColor: "#fbfafa", buttonColor: "#fbfafa", color: "#99AA99", border: "1px solid #ebded3" }, title: { color: "#8A9892", subtitle: { color: "#99AA99" } } } } }, _o = { style: { chart: { backgroundColor: "#f6f6fb", color: "#50606C", layout: { arrowShape: "normal", curvedEdges: !1 }, nodes: { stroke: "#50606C", backgroundColor: "#ffffff", borderRadius: 0, labels: { color: "#50606C" }, tooltip: { backgroundColor: "#50606C", color: "#f6f6fb" } }, edges: { stroke: "#50606C" }, midpoints: { stroke: "#50606C", fill: "#fbfafa", tooltip: { backgroundColor: "#50606C", color: "#f6f6fb" } }, controls: { backgroundColor: "#f6f6fb", buttonColor: "#f6f6fb", color: "#50606C", border: "1px solid #98aab8", borderRadius: "0" }, title: { color: "#50606C", subtitle: { color: "#718890" } } } } }, xo = {
-  default: {},
-  dark: wo,
-  celebration: yo,
-  celebrationNight: ko,
-  hack: Eo,
-  zen: Co,
-  concrete: _o
-}, si = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
-  __proto__: null,
-  celebration: yo,
-  celebrationNight: ko,
-  concrete: _o,
-  dark: wo,
-  default: xo,
-  hack: Eo,
-  zen: Co
-}, Symbol.toStringTag, { value: "Module" })), vr = ["id"], pr = {
-  key: 0,
-  class: "dag-chart-error"
-}, br = ["viewBox", "xmlns"], wr = { key: 0 }, yr = ["id", "markerWidth", "markerHeight", "refX", "refY"], kr = ["d", "fill", "stroke"], Er = ["d", "fill", "stroke"], Cr = { class: "vue-ui-dag-edges" }, _r = ["d", "stroke", "stroke-width"], xr = ["cx", "cy", "r", "fill", "stroke", "stroke-width", "onMouseenter"], Nr = { class: "vue-ui-dag-nodes" }, Ar = ["onClick", "onMouseenter"], Sr = ["x", "y", "width", "height", "rx", "fill", "stroke", "stroke-width"], Lr = ["x", "y", "font-size", "fill", "font-weight"], Or = ["x", "y", "font-size", "fill", "font-weight", "innerHTML"], Tr = { key: 1 }, Rr = ["x", "y", "width", "height"], Mr = { class: "vue-ui-dag-edges" }, $r = ["d", "stroke-width", "marker-end"], Dr = {
-  key: 6,
-  class: "vue-data-ui-watermark"
-}, Fr = ["data-position"], Pr = { key: 0 }, Br = ["data-position"], zr = { key: 0 }, no = 1.5, Vr = {
-  __name: "vue-ui-dag",
-  props: {
-    dataset: {
-      type: Object,
-      default() {
-        return {
-          nodes: [],
-          edges: []
-        };
-      }
-    },
-    config: {
-      type: Object,
-      default() {
-        return {};
-      }
-    }
-  },
-  emits: ["onNodeClick", "onMidpointEnter", "onMidpointLeave"],
-  setup(e, { expose: t, emit: o }) {
-    const n = Ue(() => import("./PenAndPaper-Cjiyv0O9.js")), s = Ue(() => import("./UserOptions-DKK-Opvk.js")), i = Ue(() => import("./PackageVersion-Cx3U3jgV.js")), { vue_ui_dag: r } = dn(), { isThemeValid: l, warnInvalidTheme: a } = vn(), c = e, d = o, f = y(null), g = y(st()), p = y(null), x = y(null), _ = y(null), T = y(0), W = y(0), de = y(!1), oe = y(!1), R = y(null), P = y(null), u = y(Ge()), I = y(u.value.style.chart.width), Y = y(u.value.style.chart.height), Ne = y({ x: 0, y: 0 }), B = y(null), Ae = y(null), Se = y({ left: "0px", top: "0px" }), fe = y("top"), q = y(!1), ct = y({ x: 0, y: 0 }), ut = y({ x: 0, y: 0 }), he = y(null), ze = y(null), Ve = y({ left: "0px", top: "0px" }), dt = y("top"), Le = y(!1), me = y(!1), { svgRef: K } = bn({ config: u.value.style.chart.title }), { userOptionsVisible: Ie, setUserOptionsVisibility: ft, keepUserOptionState: ht } = pn({ config: u.value }), H = y(u.value.style.chart.layout.rankDirection), { loading: ge, FINAL_DATASET: mt, manualLoading: gt } = fn({
-      ...Ko(c),
-      FINAL_CONFIG: u,
-      prepareConfig: Ge,
-      skeletonDataset: {
-        nodes: [
-          { id: "A", label: "" },
-          { id: "B", label: "" },
-          { id: "C", label: "" }
-        ],
-        edges: [
-          { from: "A", to: "B" },
-          { from: "A", to: "C" }
-        ]
-      },
-      skeletonConfig: nn({
-        defaultConfig: u.value,
-        userConfig: {
-          userOptions: { show: !1 },
-          style: {
-            chart: {
-              backgroundColor: "#99999930",
-              nodes: {
-                stroke: "#CCCCCC",
-                backgroundColor: "#DDDDDD50"
-              },
-              edges: {
-                stroke: "#CCCCCC"
-              },
-              midpoints: {
-                stroke: "#CCCCCC",
-                fill: "#CCCCCC"
-              }
-            }
-          }
-        }
-      })
-    });
-    function Ge() {
-      const m = Ke({
-        userConfig: c.config,
-        defaultConfig: r
-      }), b = m.theme;
-      if (!b) return m;
-      if (!l.value(m))
-        return a(m), m;
-      const h = Ke({
-        userConfig: xo[b] || c.config,
-        defaultConfig: m
-      });
-      return Ke({
-        userConfig: c.config,
-        defaultConfig: h
-      });
-    }
-    const vt = j(() => !!u.value.debug);
-    Pt(async () => {
-      sn(c.dataset) && (It({
-        componentName: "VueUiDag",
-        type: "dataset",
-        debug: vt.value
-      }), oe.value = !1, gt.value = !0), c.dataset.nodes || (It({
-        componentName: "VueUiDag",
-        type: "datasetAttributeEmpty",
-        property: "nodes",
-        index: 0,
-        debug: vt.value
-      }), oe.value = !1, gt.value = !0), oe.value = !0, await Me(), Dt();
-    }), $e(() => c.config, async (m) => {
-      ge.value || (u.value = Ge()), Ie.value = !u.value.userOptions.showOnChartHover, T.value += 1, H.value = u.value.style.chart.layout.rankDirection, I.value = u.value.style.chart.width, Y.value = u.value.style.chart.height, ne.value = u.value.style.chart.zoom.active, await Me(), Dt();
-    }, { deep: !0 });
-    const { isPrinting: pt, isImaging: bt, generatePdf: wt, generateImage: yt } = mn({
-      elementId: `dag_${g.value}`,
-      fileName: u.value.style.chart.title.text || "vue-ui-dag",
-      options: u.value.userOptions.print
-    }), No = j(() => u.value.style.chart.backgroundColor), Ao = j(() => u.value.style.chart.title), { exportSvg: So, getSvg: Lo } = gn({
-      svg: K,
-      title: Ao,
-      legend: void 0,
-      legendItems: void 0,
-      backgroundColor: No
-    });
-    async function kt({ isCb: m }) {
-      if (m) {
-        const { blob: b, url: h, text: w, dataUrl: O } = await Lo();
-        u.value.userOptions.callbacks.svg({ blob: b, url: h, text: w, dataUrl: O });
-      } else
-        So();
-    }
-    function Oo() {
-      de.value = !0, ft(!0);
-    }
-    function To() {
-      ft(!1), de.value = !1;
-    }
-    function Et({
-      tooltipRef: m,
-      isVisibleRef: b,
-      anchorRef: h,
-      styleRef: w,
-      placementRef: O,
-      offsetRef: $,
-      margin: C = 24
-    }) {
-      return function() {
-        const Q = m.value;
-        if (!Q || !b.value) return;
-        const L = Q.getBoundingClientRect(), D = window.innerWidth, pe = window.innerHeight, be = h.value.x, Te = h.value.y, Re = $?.value?.x ?? 0, Ft = $?.value?.y ?? 0;
-        let F = Te - Ft - L.height - C, Z = be - L.width / 2, we = "top";
-        if (F < C) {
-          const re = Te + Ft + C;
-          re + L.height <= pe - C ? (F = re, we = "bottom") : (F = Te - L.height / 2, F < C && (F = C), F + L.height > pe - C && (F = pe - L.height - C), we = "center");
-        }
-        Z < C && (Z = C), Z + L.width > D - C && (Z = D - L.width - C);
-        const Zo = Z <= C, Uo = Z + L.width >= D - C;
-        if ((Zo || Uo) && we !== "center") {
-          let re, ye;
-          const Xo = be - Re - C;
-          D - (be + Re) - C >= Xo ? (re = "right", ye = be + Re + C) : (re = "left", ye = be - Re - C - L.width), ye >= C && ye + L.width <= D - C && (Z = ye, F = Te - L.height / 2, F < C && (F = C), F + L.height > pe - C && (F = pe - L.height - C), we = re);
-        }
-        O.value = we, w.value = {
-          left: `${Z}px`,
-          top: `${F}px`
-        };
-      };
-    }
-    const Ro = j(() => mt.value.nodes.map((m) => ({
-      ...m,
-      backgroundColor: m.backgroundColor ? Gt(m.backgroundColor) : u.value.style.chart.nodes.backgroundColor,
-      color: m.color ? Gt(m.color) : u.value.style.chart.nodes.labels.color
-    }))), Mo = j(() => mt.value.edges), $o = j(() => ({
-      ...u.value.style.chart.layout,
-      rankDirection: H.value
-    })), { layoutData: E, lastError: Ct, arrowMarkerIdentifier: Do } = gr({
-      nodes: Ro,
-      edges: Mo,
-      configuration: $o
-    });
-    function _t(m) {
-      return E.value ? E.value.nodes.find((b) => b.id === m) : null;
-    }
-    const Fo = j(() => {
-      if (!E.value) return [];
-      const m = u.value.style.chart.edges.stroke, b = /* @__PURE__ */ new Set();
-      return E.value.edges.forEach((h) => {
-        b.add(h.original?.color || m);
-      }), Array.from(b);
-    });
-    function xt(m) {
-      return `${Do}-${String(m).replace(/[^a-zA-Z0-9_-]/g, "_")}`;
-    }
-    const Nt = j(() => {
-      const m = I.value, b = Y.value, h = Number(m), w = Number(b), O = Number.isFinite(h) && h > 0, $ = Number.isFinite(w) && w > 0;
-      return !O && !$ ? null : {
-        width: O ? h : null,
-        height: $ ? w : null
-      };
-    }), ve = y(null), ne = y(u.value.style.chart.zoom.active), {
-      viewBox: At,
-      resetZoom: Oe,
-      setInitialViewBox: Po,
-      scale: St,
-      zoomByFactor: Lt
-    } = un(
-      K,
-      { x: 0, y: 0, width: 100, height: 100 },
-      1,
-      ne,
-      () => {
-        q.value = !1;
-      }
-    );
-    function Bo() {
-      ne.value = !ne.value;
-    }
-    function Ot() {
-      const m = E.value && E.value.viewBox;
-      if (!m) return;
-      const b = String(m).split(" ").map(Number);
-      if (b.length !== 4) return;
-      const [h, w, O, $] = b;
-      if (!Number.isFinite(h) || !Number.isFinite(w) || !Number.isFinite(O) || !Number.isFinite($))
-        return;
-      let C = O, se = $, Q = h, L = w;
-      const D = Nt.value;
-      D && (D.width !== null && (C = D.width), D.height !== null && (se = D.height), Q = h - (C - O) / 2, L = w - (se - $) / 2), Po(
-        { x: Q, y: L, width: C, height: se },
-        { overwriteCurrentIfNotZoomed: !0 }
-      );
-    }
-    $e(
-      () => E.value && E.value.viewBox,
-      () => {
-        Ot();
-      },
-      { immediate: !0 }
-    ), $e(
-      () => Nt.value,
-      () => {
-        Ot();
-      }
-    ), $e(() => me.value, (m) => {
-      ne.value = !m;
-    });
-    const zo = j(() => {
-      const m = At.value;
-      return m ? `${m.x} ${m.y} ${m.width} ${m.height}` : "0 0 0 0";
-    }), J = y(!1);
-    function Tt(m) {
-      J.value = m, W.value += 1;
-    }
-    function je() {
-      me.value = !me.value;
-    }
-    function We() {
-      Lt(no, !0);
-    }
-    function Ye() {
-      Lt(1 / no, !0);
-    }
-    const He = ["TB", "RL", "BT", "LR"];
-    function Ze() {
-      H.value = He[(He.indexOf(H.value) + 1) % He.length], Oe();
-    }
-    const Vo = Et({
-      tooltipRef: Ae,
-      isVisibleRef: Le,
-      anchorRef: Ne,
-      styleRef: Se,
-      placementRef: fe
-    }), Io = Et({
-      tooltipRef: ze,
-      isVisibleRef: q,
-      anchorRef: ct,
-      styleRef: Ve,
-      placementRef: dt,
-      offsetRef: ut
-    });
-    async function Go(m) {
-      d("onMidpointEnter", m);
-      const b = K.value;
-      if (!b || !m?.midpoint) return;
-      const h = b.createSVGPoint();
-      h.x = m.midpoint.x, h.y = m.midpoint.y;
-      const w = b.getScreenCTM();
-      if (!w) return;
-      const O = h.matrixTransform(w);
-      Ne.value = {
-        x: O.x,
-        y: O.y
-      }, B.value = m, Le.value = !0, await Me(), Vo();
-    }
-    function jo() {
-      Le.value = !1, B.value = null, d("onMidpointLeave");
-    }
-    async function Wo(m) {
-      if (d("onNodeClick", m), !u.value.style.chart.nodes.tooltip.showOnClick) return;
-      const b = K.value;
-      if (!b) return;
-      const h = b.createSVGPoint();
-      h.x = m.x, h.y = m.y;
-      const w = b.getScreenCTM();
-      if (!w) return;
-      const O = h.matrixTransform(w), $ = u.value.style.chart.layout.nodeWidth, C = u.value.style.chart.layout.nodeHeight, se = w.a, Q = w.d, L = $ * se, D = C * Q;
-      ut.value = {
-        x: L / 2,
-        y: D / 2
-      }, ct.value = {
-        x: O.x,
-        y: O.y
-      }, he.value = m, q.value = !0, await Me(), Io();
-    }
-    function Rt() {
-      q.value = !1, he.value = null;
-    }
-    function Mt(m) {
-      if (!q.value) return;
-      const b = ze.value;
-      if (b && b.contains(m.target))
-        return;
-      const h = K.value;
-      h && h.contains(m.target) && m.target.closest(".vue-ui-dag-node") || Rt();
-    }
-    function $t(m) {
-      m.key === "Escape" && q.value && Rt();
-    }
-    Pt(() => {
-      document.addEventListener("mousedown", Mt), document.addEventListener("keydown", $t);
-    }), Jo(() => {
-      document.removeEventListener("mousedown", Mt), document.removeEventListener("keydown", $t), R.value && (P.value && R.value.unobserve(P.value), R.value.disconnect());
-    });
-    function Dt() {
-      if (!u.value.responsive) {
-        R.value && (P.value && R.value.unobserve(P.value), R.value.disconnect(), R.value = null, P.value = null);
-        return;
-      }
-      const m = an(() => {
-        if (!f.value) return;
-        const { width: b, height: h } = cn({
-          chart: f.value,
-          title: u.value.style.chart.title.text ? p.value : null,
-          legend: u.value.style.chart.controls.show ? _.value?.$el : null,
-          source: x.value
-        });
-        requestAnimationFrame(() => {
-          I.value = Math.max(0.1, b), Y.value = Math.max(0.1, h - 12);
-        });
-      });
-      R.value && (P.value && R.value.unobserve(P.value), R.value.disconnect()), R.value = new ResizeObserver(m), P.value = f.value ? f.value.parentNode : null, P.value && R.value.observe(P.value), m();
-    }
-    async function Yo({ scale: m = 2 } = {}) {
-      if (!f.value) return;
-      const { width: b, height: h } = f.value.getBoundingClientRect(), w = b / h, { imageUri: O, base64: $ } = await yn({ domElement: f.value, base64: !0, img: !0, scale: m });
-      return {
-        imageUri: O,
-        base64: $,
-        title: u.value.style.chart.title.text ?? "vue-ui-dag",
-        width: b,
-        height: h,
-        aspectRatio: w
-      };
-    }
-    function Ho() {
-      return E.value;
-    }
-    return t({
-      getData: Ho,
-      getImage: Yo,
-      generatePdf: wt,
-      generateSvg: kt,
-      generateImage: yt,
-      toggleAnnotator: je,
-      toggleFullscreen: Tt,
-      zoomIn: We,
-      zoomOut: Ye,
-      resetZoom: Oe,
-      switchDirection: Ze
-    }), (m, b) => (k(), N("div", {
-      class: Bt(`vue-data-ui-component vue-ui-dag ${J.value ? "vue-data-ui-wrapper-fullscreen" : ""} ${u.value.responsive ? "vue-ui-dag-responsive" : ""}`),
-      id: `dag_${g.value}`,
-      ref_key: "dagChart",
-      ref: f,
-      style: ie({
-        fontFamily: u.value.style.fontFamily,
-        backgroundColor: u.value.style.chart.backgroundColor,
-        padding: "0.5rem"
-      }),
-      onMouseenter: Oo,
-      onMouseleave: To
-    }, [
-      v(Ct) ? (k(), N("div", pr, ke(String(v(Ct))), 1)) : S("", !0),
-      u.value.userOptions.buttons.annotator ? (k(), U(v(n), {
-        key: 1,
-        svgRef: v(K),
-        backgroundColor: u.value.style.chart.backgroundColor,
-        color: u.value.style.chart.color,
-        active: me.value,
-        onClose: je
-      }, {
-        "annotator-action-close": M(() => [
-          A(m.$slots, "annotator-action-close", {}, void 0, !0)
-        ]),
-        "annotator-action-color": M(({ color: h }) => [
-          A(m.$slots, "annotator-action-color", z(V({ color: h })), void 0, !0)
-        ]),
-        "annotator-action-draw": M(({ mode: h }) => [
-          A(m.$slots, "annotator-action-draw", z(V({ mode: h })), void 0, !0)
-        ]),
-        "annotator-action-undo": M(({ disabled: h }) => [
-          A(m.$slots, "annotator-action-undo", z(V({ disabled: h })), void 0, !0)
-        ]),
-        "annotator-action-redo": M(({ disabled: h }) => [
-          A(m.$slots, "annotator-action-redo", z(V({ disabled: h })), void 0, !0)
-        ]),
-        "annotator-action-delete": M(({ disabled: h }) => [
-          A(m.$slots, "annotator-action-delete", z(V({ disabled: h })), void 0, !0)
-        ]),
-        _: 3
-      }, 8, ["svgRef", "backgroundColor", "color", "active"])) : S("", !0),
-      u.value.userOptions.show && oe.value && (v(ht) || v(Ie)) ? (k(), U(v(s), {
-        ref: "userOptionsRef",
-        key: `user_option_${W.value}`,
-        backgroundColor: u.value.style.chart.backgroundColor,
-        color: u.value.style.chart.color,
-        isPrinting: v(pt),
-        isImaging: v(bt),
-        uid: g.value,
-        hasTooltip: !1,
-        hasTable: !1,
-        hasXls: !1,
-        hasLabel: !1,
-        hasPdf: u.value.userOptions.buttons.pdf,
-        hasImg: u.value.userOptions.buttons.img,
-        hasSvg: u.value.userOptions.buttons.svg,
-        hasFullscreen: u.value.userOptions.buttons.fullscreen,
-        isFullscreen: J.value,
-        chartElement: f.value,
-        position: u.value.userOptions.position,
-        titles: { ...u.value.userOptions.buttonTitles },
-        hasAnnotator: u.value.userOptions.buttons.annotator,
-        isAnnotation: me.value,
-        callbacks: u.value.userOptions.callbacks,
-        printScale: u.value.userOptions.print.scale,
-        hasZoom: u.value.userOptions.buttons.zoom,
-        isZoom: ne.value,
-        onToggleFullscreen: Tt,
-        onGeneratePdf: v(wt),
-        onGenerateImage: v(yt),
-        onGenerateSvg: kt,
-        onToggleAnnotator: je,
-        onToggleZoom: Bo,
-        style: ie({
-          visibility: v(ht) ? v(Ie) ? "visible" : "hidden" : "visible"
-        })
-      }, Qo({ _: 2 }, [
-        m.$slots.menuIcon ? {
-          name: "menuIcon",
-          fn: M(({ isOpen: h, color: w }) => [
-            A(m.$slots, "menuIcon", z(V({ isOpen: h, color: w })), void 0, !0)
-          ]),
-          key: "0"
-        } : void 0,
-        m.$slots.optionPdf ? {
-          name: "optionPdf",
-          fn: M(() => [
-            A(m.$slots, "optionPdf", {}, void 0, !0)
-          ]),
-          key: "1"
-        } : void 0,
-        m.$slots.optionImg ? {
-          name: "optionImg",
-          fn: M(() => [
-            A(m.$slots, "optionImg", {}, void 0, !0)
-          ]),
-          key: "2"
-        } : void 0,
-        m.$slots.optionSvg ? {
-          name: "optionSvg",
-          fn: M(() => [
-            A(m.$slots, "optionSvg", {}, void 0, !0)
-          ]),
-          key: "3"
-        } : void 0,
-        m.$slots.optionFullscreen ? {
-          name: "optionFullscreen",
-          fn: M(({ toggleFullscreen: h, isFullscreen: w }) => [
-            A(m.$slots, "optionFullscreen", z(V({ toggleFullscreen: h, isFullscreen: w })), void 0, !0)
-          ]),
-          key: "4"
-        } : void 0,
-        m.$slots.optionAnnotator ? {
-          name: "optionAnnotator",
-          fn: M(({ toggleAnnotator: h, isAnnotator: w }) => [
-            A(m.$slots, "optionAnnotator", z(V({ toggleAnnotator: h, isAnnotator: w })), void 0, !0)
-          ]),
-          key: "5"
-        } : void 0,
-        m.$slots.optionZoom ? {
-          name: "optionZoom",
-          fn: M(({ toggleZoom: h, isZoomLocked: w }) => [
-            A(m.$slots, "optionZoom", z(V({ toggleZoom: h, isZoomLocked: w })), void 0, !0)
-          ]),
-          key: "6"
-        } : void 0
-      ]), 1032, ["backgroundColor", "color", "isPrinting", "isImaging", "uid", "hasPdf", "hasImg", "hasSvg", "hasFullscreen", "isFullscreen", "chartElement", "position", "titles", "hasAnnotator", "isAnnotation", "callbacks", "printScale", "hasZoom", "isZoom", "onGeneratePdf", "onGenerateImage", "style"])) : S("", !0),
-      u.value.style.chart.title.text ? (k(), N("div", {
-        key: 3,
-        ref_key: "chartTitle",
-        ref: p,
-        style: "width:100%;background:transparent;"
-      }, [
-        (k(), U(wn, {
-          key: `title_${T.value}`,
-          config: {
-            title: {
-              cy: "dag-title",
-              ...u.value.style.chart.title
-            },
-            subtitle: {
-              cy: "dag-subtitle",
-              ...u.value.style.chart.title.subtitle
-            }
-          }
-        }, null, 8, ["config"]))
-      ], 512)) : S("", !0),
-      u.value.style.chart.controls.position === "top" && !v(ge) && u.value.style.chart.controls.show ? (k(), U(jt, {
-        key: 4,
-        ref_key: "zoomControls",
-        ref: _,
-        config: u.value,
-        scale: v(St),
-        isFullscreen: J.value,
-        withDirection: "",
-        onZoomIn: We,
-        onZoomOut: Ye,
-        onResetZoom: b[0] || (b[0] = () => v(Oe)(!0)),
-        onSwitchDirection: Ze
-      }, null, 8, ["config", "scale", "isFullscreen"])) : S("", !0),
-      v(E) ? (k(), N("svg", {
-        key: 5,
-        ref_key: "svgRef",
-        ref: K,
-        class: Bt({ "vue-ui-dag-svg": !0, "vue-data-ui-loading": v(ge) }),
-        viewBox: zo.value,
-        xmlns: v(rn),
-        style: ie({
-          backgroundColor: u.value.style.chart.backgroundColor,
-          height: "100%",
-          width: "100%"
-        })
-      }, [
-        Xe(v(i)),
-        v(E).arrowShape !== "undirected" ? (k(), N("defs", wr, [
-          (k(!0), N(le, null, De(Fo.value, (h) => (k(), N("marker", {
-            key: h,
-            id: xt(h),
-            markerWidth: v(E).arrowSize,
-            markerHeight: v(E).arrowSize,
-            refX: v(E).arrowSize - 3,
-            refY: v(E).arrowSize / 2,
-            orient: "auto",
-            markerUnits: "strokeWidth"
-          }, [
-            v(E).arrowShape === "normal" ? (k(), N("path", {
-              key: 0,
-              d: `M 0 0 L ${v(E).arrowSize} ${v(E).arrowSize / 2} L 0 ${v(E).arrowSize} Z`,
-              fill: h,
-              stroke: h,
-              "stroke-width": "0"
-            }, null, 8, kr)) : (k(), N("path", {
-              key: 1,
-              d: `M 0 0 L ${v(E).arrowSize} ${v(E).arrowSize / 2} L 0 ${v(E).arrowSize} L ${v(E).arrowSize / 3} ${v(E).arrowSize / 2} Z`,
-              fill: h,
-              stroke: h,
-              "stroke-width": "0"
-            }, null, 8, Er))
-          ], 8, yr))), 128))
-        ])) : S("", !0),
-        ee("g", Cr, [
-          (k(!0), N(le, null, De(v(E).edges, (h) => (k(), N(le, {
-            key: h.id
-          }, [
-            ee("path", {
-              "data-cy-edge": "",
-              d: h.pathData,
-              fill: "none",
-              stroke: h.original.color ?? u.value.style.chart.edges.stroke,
-              "stroke-width": u.value.style.chart.edges.strokeWidth * (h.from === ve.value || h.id === B.value?.id ? 2 : 1),
-              "stroke-linecap": "round",
-              "stroke-linejoin": "round",
-              style: { "pointer-events": "none", transition: "stroke-width 0.2s ease-in-out" }
-            }, null, 8, _r),
-            u.value.style.chart.midpoints.show ? (k(), N("circle", {
-              key: 0,
-              "data-cy-midpoint": "",
-              class: "vue-ui-dag-edge-midpoint",
-              cx: h.midpoint.x,
-              cy: h.midpoint.y,
-              r: u.value.style.chart.midpoints.radius,
-              fill: u.value.style.chart.midpoints.fill,
-              stroke: h.original.color ?? u.value.style.chart.midpoints.stroke,
-              "stroke-width": u.value.style.chart.midpoints.strokeWidth * (h.from === ve.value || h.id === B.value?.id ? 2 : 1),
-              style: { transition: "stroke-width 0.2s ease-in-out" },
-              onMouseenter: (w) => Go(h),
-              onMouseleave: jo
-            }, null, 40, xr)) : S("", !0)
-          ], 64))), 128))
-        ]),
-        ee("g", Nr, [
-          (k(!0), N(le, null, De(v(E).nodes, (h) => (k(), N("g", {
-            key: h.id,
-            class: "vue-ui-dag-node",
-            onClick: en((w) => u.value.style.chart.nodes.tooltip.showOnClick && Wo(h), ["stop"]),
-            onMouseenter: (w) => ve.value = h.id,
-            onMouseleave: b[1] || (b[1] = (w) => ve.value = null)
-          }, [
-            m.$slots.node ? S("", !0) : (k(), N(le, { key: 0 }, [
-              ee("rect", {
-                "data-cy-node": "",
-                x: h.x - h.width / 2,
-                y: h.y - h.height / 2,
-                width: h.width,
-                height: h.height,
-                rx: u.value.style.chart.nodes.borderRadius,
-                fill: h.original.backgroundColor,
-                stroke: u.value.style.chart.nodes.stroke,
-                "stroke-width": u.value.style.chart.nodes.strokeWidth,
-                style: ie({
-                  cursor: u.value.style.chart.nodes.tooltip.showOnClick ? "pointer" : "default"
-                })
-              }, null, 12, Sr),
-              m.$slots["node-label"] ? (k(), N("text", {
-                key: 0,
-                x: h.x,
-                y: h.y + u.value.style.chart.nodes.labels.fontSize / 3,
-                "text-anchor": "middle",
-                "font-size": u.value.style.chart.nodes.labels.fontSize,
-                fill: h.original.color,
-                "font-weight": u.value.style.chart.nodes.labels.bold ? "bold" : "normal"
-              }, [
-                A(m.$slots, "node-label", qe({ ref_for: !0 }, { node: h, orientation: H.value }), () => [
-                  tn(ke(h.label), 1)
-                ], !0)
-              ], 8, Lr)) : m.$slots["free-node-label"] ? S("", !0) : (k(), N("text", {
-                key: 1,
-                "data-cy-node-label": "",
-                x: h.x,
-                y: h.y + u.value.style.chart.nodes.labels.fontSize / 3,
-                "text-anchor": "middle",
-                "font-size": u.value.style.chart.nodes.labels.fontSize,
-                fill: h.original.color,
-                "font-weight": u.value.style.chart.nodes.labels.bold ? "bold" : "normal",
-                innerHTML: v(ln)({
-                  content: h.label,
-                  fontSize: u.value.style.chart.nodes.labels.fontSize,
-                  fontWeight: u.value.style.chart.nodes.labels.bold ? "bold" : "normal",
-                  fill: h.original.color,
-                  x: h.x,
-                  y: h.y,
-                  autoOffset: !0
-                })
-              }, null, 8, Or))
-            ], 64)),
-            m.$slots["free-node-label"] ? (k(), N("g", Tr, [
-              A(m.$slots, "free-node-label", qe({ ref_for: !0 }, { node: h, layoutData: v(E), orientation: H.value }), void 0, !0)
-            ])) : S("", !0),
-            m.$slots.node ? (k(), N("foreignObject", {
-              key: 2,
-              x: h.x - h.width / 2,
-              y: h.y - h.height / 2,
-              width: h.width,
-              height: h.height
-            }, [
-              A(m.$slots, "node", qe({ ref_for: !0 }, { node: h, orientation: H.value }), void 0, !0)
-            ], 8, Rr)) : S("", !0)
-          ], 40, Ar))), 128))
-        ]),
-        ee("g", Mr, [
-          (k(!0), N(le, null, De(v(E).edges, (h) => (k(), N("path", {
-            key: h.id,
-            d: h.pathData,
-            fill: "none",
-            stroke: "transparent",
-            "stroke-width": u.value.style.chart.edges.strokeWidth * (h.from === ve.value || h.id === B.value?.id ? 1.3 : 1),
-            "stroke-linecap": "round",
-            "stroke-linejoin": "round",
-            "marker-end": v(E).arrowShape === "undirected" ? null : `url(#${xt(h.original?.color || u.value.style.chart.edges.stroke)})`,
-            style: { "pointer-events": "none", transition: "stroke-width 0.2s ease-in-out" }
-          }, null, 8, $r))), 128))
-        ]),
-        A(m.$slots, "svg", {
-          svg: {
-            drawingArea: v(At),
-            data: v(E),
-            orientation: H.value
-          }
-        }, void 0, !0)
-      ], 14, br)) : S("", !0),
-      m.$slots.watermark ? (k(), N("div", Dr, [
-        A(m.$slots, "watermark", z(V({ isPrinting: v(pt) || v(bt) })), void 0, !0)
-      ])) : S("", !0),
-      Xe(zt, { name: "fade" }, {
-        default: M(() => [
-          Le.value ? (k(), U(Vt, {
-            key: 0,
-            to: J.value ? f.value : "body"
-          }, [
-            ee("div", {
-              "data-cy-tooltip-midpoint": "",
-              ref_key: "tooltipRef",
-              ref: Ae,
-              class: "vue-ui-dag-tooltip",
-              style: ie({
-                ...Se.value,
-                maxWidth: u.value.style.chart.midpoints.tooltip.maxWidth,
-                "--vue-data-ui-dag-tooltip-background": u.value.style.chart.midpoints.tooltip.backgroundColor,
-                "--vue-data-ui-dag-tooltip-color": u.value.style.chart.midpoints.tooltip.color
-              }),
-              "data-position": fe.value
-            }, [
-              A(m.$slots, "tooltip-midpoint", z(V({ edge: B.value, layoutData: v(E) })), () => [
-                B.value ? (k(), N("div", Pr, ke(_t(B.value.from)?.label ?? B.value.from) + " → " + ke(_t(B.value.to)?.label ?? B.value.to), 1)) : S("", !0)
-              ], !0)
-            ], 12, Fr)
-          ], 8, ["to"])) : S("", !0)
-        ]),
-        _: 3
-      }),
-      Xe(zt, { name: "fade" }, {
-        default: M(() => [
-          q.value ? (k(), U(Vt, {
-            key: 0,
-            to: J.value ? f.value : "body"
-          }, [
-            ee("div", {
-              "data-cy-tooltip-node": "",
-              ref_key: "nodeTooltipRef",
-              ref: ze,
-              class: "vue-ui-dag-node-tooltip",
-              style: ie({
-                maxWidth: u.value.style.chart.nodes.tooltip.maxWidth,
-                left: Ve.value.left,
-                top: Ve.value.top,
-                "--vue-data-ui-dag-node-tooltip-background": u.value.style.chart.nodes.tooltip.backgroundColor,
-                "--vue-data-ui-dag-node-tooltip-color": u.value.style.chart.nodes.tooltip.color
-              }),
-              "data-position": dt.value
-            }, [
-              A(m.$slots, "tooltip-node", z(V({ node: he.value, layoutData: v(E) })), () => [
-                he.value ? (k(), N("div", zr, ke(he.value.label), 1)) : S("", !0)
-              ], !0)
-            ], 12, Br)
-          ], 8, ["to"])) : S("", !0)
-        ]),
-        _: 3
-      }),
-      u.value.style.chart.controls.position === "bottom" && !v(ge) && u.value.style.chart.controls.show ? (k(), U(jt, {
-        key: 7,
-        ref_key: "zoomControls",
-        ref: _,
-        config: u.value,
-        scale: v(St),
-        isFullscreen: J.value,
-        withDirection: "",
-        onZoomIn: We,
-        onZoomOut: Ye,
-        onResetZoom: b[2] || (b[2] = () => v(Oe)(!0)),
-        onSwitchDirection: Ze
-      }, null, 8, ["config", "scale", "isFullscreen"])) : S("", !0),
-      m.$slots.source ? (k(), N("div", {
-        key: 8,
-        ref_key: "source",
-        ref: x,
-        dir: "auto"
-      }, [
-        A(m.$slots, "source", {}, void 0, !0)
-      ], 512)) : S("", !0),
-      v(ge) ? (k(), U(hn, { key: 9 })) : S("", !0)
-    ], 46, vr));
-  }
-}, Ir = /* @__PURE__ */ kn(Vr, [["__scopeId", "data-v-93884fd9"]]), ri = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
-  __proto__: null,
-  default: Ir
-}, Symbol.toStringTag, { value: "Module" }));
-export {
-  si as a,
-  ri as b,
-  Ir as v
-};