vue-data-ui 3.9.4 → 3.9.5

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

@@ -0,0 +1,2796 @@
+import { ref as y, watchEffect as rn, unref as v, defineAsyncComponent as et, toRefs as an, computed as H, onMounted as It, nextTick as Ne, watch as Ae, onBeforeUnmount as Gt, createElementBlock as x, openBlock as C, normalizeStyle as le, normalizeClass as jt, createCommentVNode as L, createBlock as te, createVNode as tt, toDisplayString as Se, withCtx as $, renderSlot as M, normalizeProps as z, guardReactiveProps as V, createSlots as ln, createElementVNode as K, Fragment as me, renderList as Be, withModifiers as cn, mergeProps as ot, createTextVNode as un, Transition as Wt, Teleport as Yt } from "vue";
+import { c as ut, az as dn, t as fn, o as hn, g as Ht, l as Ut, X as mn, a9 as gn } from "./lib-_nVZfi2t.js";
+import { t as vn, u as pn } from "./useResponsive-DfdjqQps.js";
+import { u as bn } from "./usePanZoom-CDF7rb3o.js";
+import { u as wn, a as nt } from "./useNestedProp-QQOzuoZs.js";
+import { u as yn, B as kn } from "./BaseScanner-BMpwQAfz.js";
+import { u as En } from "./usePrinter-DXIMGR61.js";
+import { u as Cn } from "./useSvgExport-DrjCWun4.js";
+import { u as _n } from "./useThemeCheck-DGJ31Vi5.js";
+import { u as xn } from "./useUserOptionState-BIvW1Kz7.js";
+import { u as Nn } from "./useChartAccessibility-9icAAmYg.js";
+import An from "./Title-BMp0dt6A.js";
+import { B as Zt } from "./BaseZoomControls-gNf811C7.js";
+import Sn from "./img-C5q4A7ke.js";
+import { _ as Ln } from "./_plugin-vue_export-helper-CHgC5LLL.js";
+const Mn = "\0", ce = "\0", Xt = "
";
+class oe {
+  _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[ce] = {});
+  }
+  /* === 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] = ce, this._children[t] = {}, this._children[ce][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 = ce;
+    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 !== ce)
+        return o;
+    }
+  }
+  /**
+   * Gets list of direct children of node nodeId.
+   * Complexity: O(1).
+   */
+  children(t = ce) {
+    if (this._isCompound) {
+      const o = this._children[t];
+      if (o)
+        return Object.keys(o);
+    } else {
+      if (t === ce)
+        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, a]) => {
+      t(r) && o.setNode(r, a);
+    }), 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 a = n.parent(r);
+      return a === void 0 || o.hasNode(a) ? (s[r] = a, a) : a in s ? s[a] : i(a);
+    }
+    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 a = Le(this._isDirected, t, o, n);
+    if (Object.hasOwn(this._edgeLabels, a))
+      return i && (this._edgeLabels[a] = 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[a] = i ? s : this._defaultEdgeLabelFn(t, o, n);
+    const l = On(this._isDirected, t, o, n);
+    return t = l.v, o = l.w, Object.freeze(l), this._edgeObjs[a] = l, qt(this._preds[o], t), qt(this._sucs[t], o), this._in[o][a] = l, this._out[t][a] = l, this._edgeCount++, this;
+  }
+  /**
+   * Gets the label for the specified edge.
+   * Complexity: O(1).
+   */
+  edge(t, o, n) {
+    const s = arguments.length === 1 ? st(this._isDirected, arguments[0]) : Le(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 ? st(this._isDirected, arguments[0]) : Le(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 ? st(this._isDirected, arguments[0]) : Le(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], Kt(this._preds[o], t), Kt(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 qt(e, t) {
+  e[t] ? e[t]++ : e[t] = 1;
+}
+function Kt(e, t) {
+  --e[t] || delete e[t];
+}
+function Le(e, t, o, n) {
+  let s = "" + t, i = "" + o;
+  if (!e && s > i) {
+    const r = s;
+    s = i, i = r;
+  }
+  return s + Xt + i + Xt + (n === void 0 ? Mn : n);
+}
+function On(e, t, o, n) {
+  let s = "" + t, i = "" + o;
+  if (!e && s > i) {
+    const a = s;
+    s = i, i = a;
+  }
+  const r = { v: s, w: i };
+  return n && (r.name = n), r;
+}
+function st(e, t) {
+  return Le(e, t.v, t.w, t.name);
+}
+class Dn {
+  constructor() {
+    const t = {};
+    t._next = t._prev = t, this._sentinel = t;
+  }
+  dequeue() {
+    const t = this._sentinel, o = t._prev;
+    if (o !== t)
+      return Jt(o), o;
+  }
+  enqueue(t) {
+    const o = this._sentinel;
+    t._prev && t._next && Jt(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, Rn)), n = n._prev;
+    return "[" + t.join(", ") + "]";
+  }
+}
+function Jt(e) {
+  e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
+}
+function Rn(e, t) {
+  if (e !== "_next" && e !== "_prev")
+    return t;
+}
+const Tn = () => 1;
+function Pn(e, t) {
+  if (e.nodeCount() <= 1)
+    return [];
+  const o = $n(e, t || Tn);
+  return Fn(o.graph, o.buckets, o.zeroIndex).flatMap((s) => e.outEdges(s.v, s.w));
+}
+function Fn(e, t, o) {
+  let n = [];
+  const s = t[t.length - 1], i = t[0];
+  let r;
+  for (; e.nodeCount(); ) {
+    for (; r = i.dequeue(); )
+      rt(e, t, o, r);
+    for (; r = s.dequeue(); )
+      rt(e, t, o, r);
+    if (e.nodeCount()) {
+      for (let a = t.length - 2; a > 0; --a)
+        if (r = t[a].dequeue(), r) {
+          n = n.concat(rt(e, t, o, r, !0));
+          break;
+        }
+    }
+  }
+  return n;
+}
+function rt(e, t, o, n, s) {
+  const i = s ? [] : void 0;
+  return e.inEdges(n.v).forEach((r) => {
+    const a = e.edge(r), l = e.node(r.v);
+    s && i.push({ v: r.v, w: r.w }), l.out -= a, dt(t, o, l);
+  }), e.outEdges(n.v).forEach((r) => {
+    const a = e.edge(r), l = e.node(r.w);
+    l.in -= a, dt(t, o, l);
+  }), e.removeNode(n.v), i;
+}
+function $n(e, t) {
+  const o = new oe();
+  let n = 0, s = 0;
+  e.nodes().forEach((a) => {
+    o.setNode(a, { v: a, in: 0, out: 0 });
+  }), e.edges().forEach((a) => {
+    const l = o.edge(a.v, a.w) || 0, c = t(a), d = l + c;
+    o.setEdge(a.v, a.w, d), s = Math.max(s, o.node(a.v).out += c), n = Math.max(n, o.node(a.w).in += c);
+  });
+  const i = Bn(s + n + 3).map(() => new Dn()), r = n + 1;
+  return o.nodes().forEach((a) => {
+    dt(i, r, o.node(a));
+  }), {
+    graph: o,
+    buckets: i,
+    zeroIndex: r
+  };
+}
+function dt(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 Bn(e) {
+  const t = [];
+  for (let o = 0; o < e; o++)
+    t.push(o);
+  return t;
+}
+function ve(e, t, o, n) {
+  let s = n;
+  for (; e.hasNode(s); )
+    s = Ve(n);
+  return o.dummy = t, e.setNode(s, o), s;
+}
+function co(e) {
+  const t = new oe().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 ht(e) {
+  const t = new oe({ 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 zn(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 Ie(e.nodes(), t);
+}
+function Vn(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 Ie(e.nodes(), t);
+}
+function ft(e, t) {
+  let o = e.x, n = e.y;
+  const s = t.x - o, i = t.y - n;
+  let r = e.width / 2, a = e.height / 2;
+  if (!s && !i)
+    throw new Error("Not possible to find intersection inside of the rectangle");
+  let l, c;
+  return Math.abs(i) * r > Math.abs(s) * a ? (i < 0 && (a = -a), l = a * s / i, c = a) : (s < 0 && (r = -r), l = r, c = r * i / s), { x: o + l, y: n + c };
+}
+function Oe(e) {
+  const t = ge(mt(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 uo(e) {
+  const t = e.nodes().map((n) => {
+    const s = e.node(n).rank;
+    return s === void 0 ? Number.MAX_VALUE : s;
+  }), o = X(Math.min, t);
+  e.nodes().forEach((n) => {
+    const s = e.node(n);
+    Object.hasOwn(s, "rank") && (s.rank -= o);
+  });
+}
+function fo(e) {
+  const t = e.nodes().map((r) => e.node(r).rank).filter((r) => r !== void 0), o = X(Math.min, t), n = [];
+  e.nodes().forEach((r) => {
+    const a = e.node(r).rank - o;
+    n[a] || (n[a] = []), n[a].push(r);
+  });
+  let s = 0;
+  const i = e.graph().nodeRankFactor;
+  Array.from(n).forEach((r, a) => {
+    r === void 0 && a % i !== 0 ? --s : r !== void 0 && s && r.forEach((l) => {
+      e.node(l).rank += s;
+    });
+  });
+}
+function In(e, t, o, n) {
+  const s = {
+    width: 0,
+    height: 0
+  };
+  return arguments.length >= 4 && (s.rank = o, s.order = n), ve(e, "border", s, t);
+}
+const ho = 65535;
+function Gn(e, t = ho) {
+  const o = [];
+  for (let n = 0; n < e.length; n += t) {
+    const s = e.slice(n, n + t);
+    o.push(s);
+  }
+  return o;
+}
+function X(e, t) {
+  if (t.length > ho) {
+    const o = Gn(t);
+    return e.apply(
+      null,
+      o.map((n) => e.apply(null, n))
+    );
+  } else
+    return e.apply(null, t);
+}
+function mt(e) {
+  const o = e.nodes().map((n) => {
+    const s = e.node(n).rank;
+    return s === void 0 ? Number.MIN_VALUE : s;
+  });
+  return X(Math.max, o);
+}
+function mo(e, t) {
+  const o = { lhs: [], rhs: [] };
+  return e.forEach((n) => {
+    t(n) ? o.lhs.push(n) : o.rhs.push(n);
+  }), o;
+}
+function go(e, t) {
+  const o = Date.now();
+  try {
+    return t();
+  } finally {
+    console.log(e + " time: " + (Date.now() - o) + "ms");
+  }
+}
+function vo(e, t) {
+  return t();
+}
+let jn = 0;
+function Ve(e) {
+  const t = ++jn;
+  return e + String(t);
+}
+function ge(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 Me(e, t) {
+  const o = {};
+  for (const n of t)
+    e[n] !== void 0 && (o[n] = e[n]);
+  return o;
+}
+function De(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 Ie(e, t) {
+  return e.reduce((o, n, s) => (o[n] = t[s], o), {});
+}
+const ze = {
+  addBorderNode: In,
+  addDummyNode: ve,
+  applyWithChunking: X,
+  asNonCompoundGraph: ht,
+  buildLayerMatrix: Oe,
+  intersectRect: ft,
+  mapValues: De,
+  maxRank: mt,
+  normalizeRanks: uo,
+  notime: vo,
+  partition: mo,
+  pick: Me,
+  predecessorWeights: Vn,
+  range: ge,
+  removeEmptyRanks: fo,
+  simplify: co,
+  successorWeights: zn,
+  time: go,
+  uniqueId: Ve,
+  zipObject: Ie
+};
+function Wn(e) {
+  (e.graph().acyclicer === "greedy" ? Pn(e, o(e)) : Hn(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, Ve("rev"));
+  });
+  function o(n) {
+    return (s) => n.edge(s).weight;
+  }
+}
+function Yn(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 Hn(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 Un(e) {
+  e.graph().dummyChains = [], e.edges().forEach((t) => Zn(e, t));
+}
+function Zn(e, t) {
+  let o = t.v, n = e.node(o).rank;
+  const s = t.w, i = e.node(s).rank, r = t.name, a = e.edge(t), l = a.labelRank;
+  if (i === n + 1)
+    return;
+  e.removeEdge(t);
+  let c, d, m;
+  for (m = 0, ++n; n < i; ++m, ++n)
+    a.points = [], d = {
+      width: 0,
+      height: 0,
+      edgeLabel: a,
+      edgeObj: t,
+      rank: n
+    }, c = ve(e, "edge", d, "_d"), n === l && (d.width = a.width, d.height = a.height, d.dummy = "edge-label", d.labelpos = a.labelpos), e.setEdge(o, c, { weight: a.weight }, r), m === 0 && e.graph().dummyChains.push(c), o = c;
+  e.setEdge(o, s, { weight: a.weight }, r);
+}
+function Xn(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 po(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((a) => {
+      if (!e.node(a.w))
+        return Number.POSITIVE_INFINITY;
+      const c = t(a.w), d = e.edge(a).minlen;
+      return c - d;
+    });
+    let r = X(Math.min, i);
+    return r === Number.POSITIVE_INFINITY && (r = 0), n && (n.rank = r), r;
+  }
+  (e.sources() || []).forEach(t);
+}
+function qn(e, t) {
+  return e.node(t.w).rank - e.node(t.v).rank - e.edge(t).minlen;
+}
+function Kn(e) {
+  Jn(e);
+  const t = new oe();
+  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 = Qn(e, s);
+    if (!i) {
+      const d = o.find((m) => !s.has(m));
+      s.add(d), t.setNode(d, {});
+      continue;
+    }
+    const { edgeObject: r, delta: a, attachFrom: l, attachTo: c } = i;
+    es(e, s, l, a), t.setEdge(r.v, r.w, {}), s.add(c);
+  }
+  return t;
+}
+function Jn(e) {
+  e.nodes().forEach((t) => {
+    const o = e.node(t) || {};
+    Object.prototype.hasOwnProperty.call(o, "rank") || (o.rank = 0, e.setNode(t, o));
+  });
+}
+function Qn(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 = qn(e, n), a = Math.abs(r);
+    if (!o || a < o.absoluteSlack) {
+      const l = s ? n.v : n.w, c = s ? n.w : n.v, d = s ? r : -r;
+      o = {
+        edgeObject: n,
+        delta: d,
+        attachFrom: l,
+        attachTo: c,
+        absoluteSlack: a
+      };
+    }
+  }), o;
+}
+function es(e, t, o, n) {
+  n && e.nodes().forEach((s) => {
+    if (!t.has(s)) {
+      const i = e.node(s);
+      i.rank += n;
+    }
+  });
+}
+function pe(e) {
+  const t = co(e);
+  return po(t), t.nodes().forEach((o) => {
+    const n = t.node(o), s = e.node(o) || {};
+    s.rank = n.rank, e.setNode(o, s);
+  }), e;
+}
+function ts(e, t) {
+}
+function os(e, t) {
+}
+function ns(e, t, o) {
+  return 0;
+}
+function ss(e) {
+  return null;
+}
+function rs(e, t) {
+  return null;
+}
+pe.initLowLimValues = ts;
+pe.initCutValues = os;
+pe.calcCutValue = ns;
+pe.leaveEdge = ss;
+pe.enterEdge = rs;
+const bo = po;
+function is(e) {
+  const t = e.graph().ranker;
+  if (t instanceof Function)
+    return t(e);
+  switch (e.graph().ranker) {
+    case "network-simplex":
+      Qt(e);
+      break;
+    case "tight-tree":
+      ls(e);
+      break;
+    case "longest-path":
+      as(e);
+      break;
+    case "none":
+      break;
+    default:
+      Qt(e);
+  }
+}
+const as = bo;
+function ls(e) {
+  bo(e), Kn(e);
+}
+function Qt(e) {
+  pe(e);
+}
+function cs(e) {
+  const t = ds(e);
+  e.graph().dummyChains.forEach((o) => {
+    let n = e.node(o);
+    const s = n.edgeObj, i = us(e, t, s.v, s.w), r = i.path, a = i.lca;
+    let l = 0, c = r[l], d = !0, m = o;
+    for (; m !== s.w; ) {
+      if (n = e.node(m), d) {
+        for (; (c = r[l]) !== a && e.node(c).maxRank < n.rank; )
+          l++;
+        c === a && (d = !1);
+      }
+      if (!d) {
+        for (; l < r.length - 1 && e.node(c = r[l + 1]).minRank <= n.rank; )
+          l++;
+        c = r[l];
+      }
+      e.setParent(m, c), m = e.successors(m)[0];
+    }
+  });
+}
+function us(e, t, o, n) {
+  const s = [], i = [], r = Math.min(t[o].low, t[n].low), a = Math.max(t[o].lim, t[n].lim);
+  let l, c;
+  l = o;
+  do
+    l = e.parent(l), s.push(l);
+  while (l && (t[l].low > r || a > t[l].lim));
+  for (c = l, l = n; (l = e.parent(l)) !== c; )
+    i.push(l);
+  return {
+    path: s.concat(i.reverse()),
+    lca: c
+  };
+}
+function ds(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 fs(e) {
+  const t = ze.addDummyNode(e, "root", {}, "_root"), o = hs(e), n = Object.values(o), s = ze.applyWithChunking(Math.max, n) - 1, i = 2 * s + 1;
+  e.graph().nestingRoot = t, e.edges().forEach((a) => {
+    e.edge(a).minlen *= i;
+  });
+  const r = ms(e) + 1;
+  e.children().forEach((a) => {
+    wo(e, t, i, r, s, o, a);
+  }), e.graph().nodeRankFactor = i;
+}
+function wo(e, t, o, n, s, i, r) {
+  const a = e.children(r);
+  if (!a.length) {
+    r !== t && e.setEdge(t, r, { weight: 0, minlen: o });
+    return;
+  }
+  const l = ze.addBorderNode(e, "_bt"), c = ze.addBorderNode(e, "_bb"), d = e.node(r);
+  e.setParent(l, r), d.borderTop = l, e.setParent(c, r), d.borderBottom = c, a.forEach((m) => {
+    wo(e, t, o, n, s, i, m);
+    const g = e.node(m), b = g.borderTop ? g.borderTop : m, N = g.borderBottom ? g.borderBottom : m, _ = g.borderTop ? n : 2 * n, P = b !== N ? 1 : s - i[r] + 1;
+    e.setEdge(l, b, {
+      weight: _,
+      minlen: P,
+      nestingEdge: !0
+    }), e.setEdge(N, c, {
+      weight: _,
+      minlen: P,
+      nestingEdge: !0
+    });
+  }), e.parent(r) || e.setEdge(t, l, {
+    weight: 0,
+    minlen: s + i[r]
+  });
+}
+function hs(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 ms(e) {
+  return e.edges().reduce((t, o) => t + e.edge(o).weight, 0);
+}
+function gs(e) {
+  const t = e.graph();
+  e.removeNode(t.nestingRoot), delete t.nestingRoot, e.edges().forEach((o) => {
+    e.edge(o).nestingEdge && e.removeEdge(o);
+  });
+}
+function vs(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)
+        eo(e, "borderLeft", "_bl", o, s, i), eo(e, "borderRight", "_br", o, s, i);
+    }
+  }
+  e.children().forEach(t);
+}
+function eo(e, t, o, n, s, i) {
+  const r = {
+    width: 0,
+    height: 0,
+    rank: i,
+    borderType: t
+  }, a = s[t][i - 1], l = ve(e, "border", r, o);
+  s[t][i] = l, e.setParent(l, n), a && e.setEdge(a, l, { weight: 1 });
+}
+function ps(e) {
+  const t = e.graph().rankdir.toLowerCase();
+  (t === "lr" || t === "rl") && yo(e);
+}
+function bs(e) {
+  const t = e.graph().rankdir.toLowerCase();
+  (t === "bt" || t === "rl") && ws(e), (t === "lr" || t === "rl") && (ys(e), yo(e));
+}
+function yo(e) {
+  e.nodes().forEach((t) => {
+    to(e.node(t));
+  }), e.edges().forEach((t) => {
+    to(e.edge(t));
+  });
+}
+function to(e) {
+  const t = e.width;
+  e.width = e.height, e.height = t;
+}
+function ws(e) {
+  e.nodes().forEach((t) => {
+    it(e.node(t));
+  }), e.edges().forEach((t) => {
+    const o = e.edge(t);
+    o.points.forEach(it), Object.hasOwn(o, "y") && it(o);
+  });
+}
+function it(e) {
+  e.y = -e.y;
+}
+function ys(e) {
+  e.nodes().forEach((t) => {
+    at(e.node(t));
+  }), e.edges().forEach((t) => {
+    const o = e.edge(t);
+    o.points.forEach(at), Object.hasOwn(o, "x") && at(o);
+  });
+}
+function at(e) {
+  const t = e.x;
+  e.x = e.y, e.y = t;
+}
+const oo = {
+  adjust: ps,
+  undo: bs
+};
+function ks(e) {
+  const t = {}, o = e.nodes().filter((l) => e.children(l).length === 0), n = o.map((l) => e.node(l).rank), s = X(Math.max, n), i = ge(s + 1).map(() => []);
+  function r(l) {
+    if (t[l]) return;
+    t[l] = !0;
+    const c = e.node(l);
+    i[c.rank].push(l), e.successors(l).forEach(r);
+  }
+  return o.sort(
+    (l, c) => e.node(l).rank - e.node(c).rank
+  ).forEach(r), i;
+}
+function Es(e, t) {
+  let o = 0;
+  for (let n = 1; n < t.length; ++n)
+    o += Cs(e, t[n - 1], t[n]);
+  return o;
+}
+function Cs(e, t, o) {
+  const n = Ie(
+    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, m) => d.pos - m.pos));
+  let i = 1;
+  for (; i < o.length; ) i <<= 1;
+  const r = 2 * i - 1;
+  i -= 1;
+  const a = new Array(r).fill(0);
+  let l = 0;
+  return s.forEach((c) => {
+    let d = c.pos + i;
+    a[d] += c.weight;
+    let m = 0;
+    for (; d > 0; )
+      d % 2 && (m += a[d + 1]), d = d - 1 >> 1, a[d] += c.weight;
+    l += c.weight * m;
+  }), l;
+}
+function _s(e, t = []) {
+  return t.map((o) => {
+    const n = e.inEdges(o);
+    if (!n.length)
+      return { v: o };
+    const s = n.reduce(
+      (i, r) => {
+        const a = e.edge(r), l = e.node(r.v);
+        return {
+          sum: i.sum + a.weight * l.order,
+          weight: i.weight + a.weight
+        };
+      },
+      { sum: 0, weight: 0 }
+    );
+    return {
+      v: o,
+      barycenter: s.sum / s.weight,
+      weight: s.weight
+    };
+  });
+}
+function xs(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 Ns(n);
+}
+function Ns(e) {
+  const t = [];
+  function o(s) {
+    return (i) => {
+      i.merged || (i.barycenter === void 0 || s.barycenter === void 0 || i.barycenter >= s.barycenter) && As(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) => Me(s, ["vs", "i", "barycenter", "weight"]));
+}
+function As(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 Ss(e, t) {
+  const o = mo(e, (d) => Object.hasOwn(d, "barycenter")), n = o.lhs, s = o.rhs.sort((d, m) => m.i - d.i), i = [];
+  let r = 0, a = 0, l = 0;
+  n.sort(Ls(!!t)), l = no(i, s, l), n.forEach((d) => {
+    l += d.vs.length, i.push(d.vs), r += d.barycenter * d.weight, a += d.weight, l = no(i, s, l);
+  });
+  const c = { vs: i.flat(!0) };
+  return a && (c.barycenter = r / a, c.weight = a), c;
+}
+function no(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 Ls(e) {
+  return (t, o) => t.barycenter < o.barycenter ? -1 : t.barycenter > o.barycenter ? 1 : e ? o.i - t.i : t.i - o.i;
+}
+function ko(e, t, o, n) {
+  let s = e.children(t);
+  const i = e.node(t), r = i ? i.borderLeft : void 0, a = i ? i.borderRight : void 0, l = {};
+  r && (s = s.filter((g) => g !== r && g !== a));
+  const c = _s(e, s);
+  c.forEach((g) => {
+    if (e.children(g.v).length) {
+      const b = ko(e, g.v, o, n);
+      l[g.v] = b, Object.hasOwn(b, "barycenter") && Os(g, b);
+    }
+  });
+  let d = xs(c, o);
+  Ms(d, l);
+  const m = Ss(d, n);
+  if (r && (m.vs = [r, m.vs, a].flat(!0), e.predecessors(r).length)) {
+    const g = e.node(e.predecessors(r)[0]), b = e.node(e.predecessors(a)[0]);
+    Object.hasOwn(m, "barycenter") || (m.barycenter = 0, m.weight = 0), m.barycenter = (m.barycenter * m.weight + g.order + b.order) / (m.weight + 2), m.weight += 2;
+  }
+  return m;
+}
+function Ms(e, t) {
+  e.forEach((o) => {
+    o.vs = o.vs.flatMap((n) => t[n] ? t[n].vs : n);
+  });
+}
+function Os(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 Ds(e, t, o, n) {
+  n || (n = e.nodes());
+  const s = Rs(e), i = new oe({ compound: !0 }).setGraph({ root: s }).setDefaultNodeLabel((r) => e.node(r));
+  return n.forEach((r) => {
+    const a = e.node(r), l = e.parent(r);
+    (a.rank === t || a.minRank <= t && t <= a.maxRank) && (i.setNode(r), i.setParent(r, l || s), e[o](r).forEach((d) => {
+      const m = d.v === r ? d.w : d.v, g = i.edge(m, r), b = g ? g.weight : 0;
+      i.setEdge(m, r, {
+        weight: e.edge(d).weight + b
+      });
+    }), Object.hasOwn(a, "minRank") && i.setNode(r, {
+      borderLeft: a.borderLeft[t],
+      borderRight: a.borderRight[t]
+    }));
+  }), i;
+}
+function Rs(e) {
+  let t;
+  for (; e.hasNode(t = Ve("_root")); ) ;
+  return t;
+}
+function Ts(e, t, o) {
+  let n = {}, s;
+  o.forEach((i) => {
+    let r = e.parent(i), a, l;
+    for (; r; ) {
+      if (a = e.parent(r), a ? (l = n[a], n[a] = r) : (l = s, s = r), l && l !== r) {
+        t.setEdge(l, r);
+        return;
+      }
+      r = a;
+    }
+  });
+}
+function Eo(e, t = {}) {
+  if (typeof t.customOrder == "function") {
+    t.customOrder(e, Eo);
+    return;
+  }
+  const o = mt(e), n = so(
+    e,
+    ge(1, o + 1),
+    "inEdges"
+  ), s = so(
+    e,
+    ge(o - 1, -1, -1),
+    "outEdges"
+  );
+  let i = ks(e);
+  if (ro(e, i), t.disableOptimalOrderHeuristic)
+    return;
+  let r = Number.POSITIVE_INFINITY, a;
+  const l = t.constraints || [];
+  for (let c = 0, d = 0; d < 4; ++c, ++d) {
+    const m = c % 2 === 0 ? n : s, g = c % 4 >= 2;
+    Ps(m, g, l), i = Oe(e);
+    const b = Es(e, i);
+    b < r ? (r = b, d = 0, a = structuredClone(i)) : b === r && (a = structuredClone(i));
+  }
+  ro(e, a);
+}
+function so(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 a = r.minRank; a <= r.maxRank; a++)
+        a !== r.rank && s(a, i);
+  }
+  return t.map(
+    (i) => Ds(
+      e,
+      i,
+      o,
+      n.get(i) || []
+    )
+  );
+}
+function Ps(e, t, o) {
+  const n = new oe();
+  e.forEach((s) => {
+    o.forEach((a) => n.setEdge(a.left, a.right));
+    const i = s.graph().root, r = ko(s, i, n, t);
+    r.vs.forEach((a, l) => {
+      s.node(a).order = l;
+    }), Ts(s, n, r.vs);
+  });
+}
+function ro(e, t) {
+  Object.values(t).forEach((o) => {
+    o.forEach((n, s) => {
+      e.node(n).order = s;
+    });
+  });
+}
+function Fs(e, t) {
+  const o = {};
+  function n(s, i) {
+    let r = 0, a = 0;
+    const l = s.length, c = i[i.length - 1];
+    return i.forEach((d, m) => {
+      const g = Bs(e, d), b = g ? e.node(g).order : l;
+      (g || d === c) && (i.slice(a, m + 1).forEach((N) => {
+        e.predecessors(N).forEach((_) => {
+          const P = e.node(_), J = P.order;
+          (J < r || b < J) && !(P.dummy && e.node(N).dummy) && Co(o, _, N);
+        });
+      }), a = m + 1, r = b);
+    }), i;
+  }
+  return t.length && t.reduce(n), o;
+}
+function $s(e, t) {
+  const o = {};
+  function n(i, r, a, l, c) {
+    let d;
+    ge(r, a).forEach((m) => {
+      d = i[m], e.node(d).dummy && e.predecessors(d).forEach((g) => {
+        const b = e.node(g);
+        b.dummy && (b.order < l || b.order > c) && Co(o, g, d);
+      });
+    });
+  }
+  function s(i, r) {
+    let a = -1, l, c = 0;
+    return r.forEach((d, m) => {
+      if (e.node(d).dummy === "border") {
+        const g = e.predecessors(d);
+        g.length && (l = e.node(g[0]).order, n(r, c, m, a, l), c = m, a = l);
+      }
+      n(r, c, r.length, l, i.length);
+    }), r;
+  }
+  return t.length && t.reduce(s), o;
+}
+function Bs(e, t) {
+  if (e.node(t).dummy)
+    return e.predecessors(t).find((o) => e.node(o).dummy);
+}
+function Co(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 zs(e, t, o) {
+  if (t > o) {
+    const n = t;
+    t = o, o = n;
+  }
+  return !!e[t] && Object.hasOwn(e[t], o);
+}
+function Vs(e, t, o, n) {
+  const s = {}, i = {}, r = {};
+  return t.forEach((a) => {
+    a.forEach((l, c) => {
+      s[l] = l, i[l] = l, r[l] = c;
+    });
+  }), t.forEach((a) => {
+    let l = -1;
+    a.forEach((c) => {
+      let d = n(c);
+      if (d.length) {
+        d = d.sort((g, b) => r[g] - r[b]);
+        const m = (d.length - 1) / 2;
+        for (let g = Math.floor(m), b = Math.ceil(m); g <= b; ++g) {
+          const N = d[g];
+          i[c] === c && l < r[N] && !zs(o, c, N) && (i[N] = c, i[c] = s[c] = s[N], l = r[N]);
+        }
+      }
+    });
+  }), { root: s, align: i };
+}
+function Is(e, t, o, n, s) {
+  const i = {}, r = Gs(e, t, o, s), a = s ? "borderLeft" : "borderRight";
+  function l(m, g) {
+    const b = r.nodes().slice(), N = {};
+    let _ = b.pop();
+    for (; _; ) {
+      if (N[_])
+        m(_);
+      else {
+        N[_] = !0, b.push(_);
+        for (const P of g(_))
+          b.push(P);
+      }
+      _ = b.pop();
+    }
+  }
+  function c(m) {
+    i[m] = r.inEdges(m).reduce((g, b) => Math.max(g, i[b.v] + r.edge(b)), 0);
+  }
+  function d(m) {
+    const g = r.outEdges(m).reduce((N, _) => Math.min(N, i[_.w] - r.edge(_)), Number.POSITIVE_INFINITY), b = e.node(m);
+    g !== Number.POSITIVE_INFINITY && b.borderType !== a && (i[m] = Math.max(i[m], g));
+  }
+  return l(c, r.predecessors.bind(r)), l(d, r.successors.bind(r)), Object.keys(n).forEach((m) => {
+    i[m] = i[o[m]];
+  }), i;
+}
+function Gs(e, t, o, n) {
+  const s = new e.constructor(), i = e.graph(), r = Us(i.nodesep, i.edgesep, n);
+  return t.forEach((a) => {
+    let l;
+    a.forEach((c) => {
+      const d = o[c];
+      if (s.setNode(d), l) {
+        const m = o[l], g = s.edge(m, d);
+        s.setEdge(
+          m,
+          d,
+          Math.max(r(e, c, l), g || 0)
+        );
+      }
+      l = c;
+    });
+  }), s;
+}
+function js(e, t) {
+  return Object.values(t).reduce(
+    (o, n) => {
+      let s = Number.NEGATIVE_INFINITY, i = Number.POSITIVE_INFINITY;
+      Object.entries(n).forEach(([a, l]) => {
+        const c = Zs(e, a) / 2;
+        s = Math.max(l + c, s), i = Math.min(l - c, i);
+      });
+      const r = s - i;
+      return r < o[0] && (o = [r, n]), o;
+    },
+    [Number.POSITIVE_INFINITY, null]
+  )[1];
+}
+function Ws(e, t) {
+  const o = Object.values(t), n = X(Math.min, o), s = X(Math.max, o);
+  ["u", "d"].forEach((i) => {
+    ["l", "r"].forEach((r) => {
+      const a = i + r;
+      let l = e[a];
+      if (l === t) return;
+      const c = Object.values(l);
+      let d = n - X(Math.min, c);
+      r !== "l" && (d = s - X(Math.max, c)), d && (l = De(l, (m) => m + d), e[a] = l);
+    });
+  });
+}
+function Ys(e, t) {
+  return De(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 Hs(e) {
+  const t = Oe(e), o = Object.assign(
+    Fs(e, t),
+    $s(e, t)
+  ), n = {};
+  let s;
+  ["u", "d"].forEach((r) => {
+    s = r === "u" ? t : Object.values(t).reverse(), ["l", "r"].forEach((a) => {
+      let l = s;
+      a === "r" && (l = l.map(
+        (g) => Object.values(g).reverse()
+      ));
+      const c = (r === "u" ? e.predecessors : e.successors).bind(e), d = Vs(
+        e,
+        l,
+        o,
+        c
+      );
+      let m = Is(
+        e,
+        l,
+        d.root,
+        d.align,
+        a === "r"
+      );
+      a === "r" && (m = De(m, (g) => -g)), n[r + a] = m;
+    });
+  });
+  const i = js(e, n);
+  return Ws(n, i), Ys(n, e.graph().align);
+}
+function Us(e, t, o) {
+  return (n, s, i) => {
+    const r = n.node(s), a = n.node(i);
+    let l = 0, c;
+    if (l += 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 && (l += o ? c : -c), c = 0, l += (r.dummy ? t : e) / 2, l += (a.dummy ? t : e) / 2, l += a.width / 2, Object.hasOwn(a, "labelpos"))
+      switch (a.labelpos.toLowerCase()) {
+        case "l":
+          c = a.width / 2;
+          break;
+        case "r":
+          c = -a.width / 2;
+          break;
+      }
+    return c && (l += o ? c : -c), c = 0, l;
+  };
+}
+function Zs(e, t) {
+  return e.node(t).width;
+}
+function Xs(e) {
+  const t = ht(e);
+  qs(t);
+  const o = Hs(t);
+  Object.entries(o).forEach(([n, s]) => {
+    e.node(n).x = s;
+  });
+}
+function qs(e) {
+  const t = Oe(e), o = e.graph().ranksep;
+  let n = 0;
+  t.forEach((s) => {
+    const i = s.reduce((r, a) => {
+      const l = e.node(a).height;
+      return r > l ? r : l;
+    }, 0);
+    s.forEach((r) => {
+      e.node(r).y = n + i / 2;
+    }), n += i + o;
+  });
+}
+function Ks(e, t = {}) {
+  const o = t.debugTiming ? go : vo;
+  return o("layout", () => {
+    const n = o("  buildLayoutGraph", () => ar(e));
+    return o("  runLayout", () => Js(n, o, t)), o("  updateInputGraph", () => Qs(e, n)), n;
+  });
+}
+function Js(e, t, o) {
+  t("    makeSpaceForEdgeLabels", () => lr(e)), t("    removeSelfEdges", () => pr(e)), t("    acyclic", () => Wn(e)), t("    nestingGraph.run", () => fs(e)), t("    rank", () => is(ht(e))), t("    injectEdgeLabelProxies", () => cr(e)), t("    removeEmptyRanks", () => fo(e)), t("    nestingGraph.cleanup", () => gs(e)), t("    normalizeRanks", () => uo(e)), t("    assignRankMinMax", () => ur(e)), t("    removeEdgeLabelProxies", () => dr(e)), t("    normalize.run", () => Un(e)), t("    parentDummyChains", () => cs(e)), t("    addBorderSegments", () => vs(e)), t("    order", () => Eo(e, o)), t("    insertSelfEdges", () => br(e)), t("    adjustCoordinateSystem", () => oo.adjust(e)), t("    position", () => Xs(e)), t("    positionSelfEdges", () => wr(e)), t("    removeBorderNodes", () => vr(e)), t("    normalize.undo", () => Xn(e)), t("    fixupEdgeLabelCoords", () => mr(e)), t("    undoCoordinateSystem", () => oo.undo(e)), t("    translateGraph", () => fr(e)), t("    assignNodeIntersects", () => hr(e)), t("    reversePoints", () => gr(e)), t("    acyclic.undo", () => Yn(e));
+}
+function Qs(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 er = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"], tr = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" }, or = ["acyclicer", "ranker", "rankdir", "align"], nr = ["width", "height", "rank"], io = { width: 0, height: 0 }, sr = ["minlen", "weight", "width", "height", "labeloffset"], rr = {
+  minlen: 1,
+  weight: 1,
+  width: 0,
+  height: 0,
+  labeloffset: 10,
+  labelpos: "r"
+}, ir = ["labelpos", "arrowshape"];
+function ar(e) {
+  const t = ct(e.graph()), o = {
+    ...tr,
+    ...lt(t, er),
+    ...Me(t, or)
+  }, n = new oe({ multigraph: !0, compound: !0 });
+  return n.setGraph(o), e.nodes().forEach((s) => {
+    const i = ct(e.node(s)), r = lt(i, nr);
+    Object.keys(io).forEach((a) => {
+      r[a] === void 0 && (r[a] = io[a]);
+    }), n.setNode(s, r), n.setParent(s, e.parent(s));
+  }), e.edges().forEach((s) => {
+    const i = ct(e.edge(s));
+    n.setEdge(
+      s,
+      {
+        ...rr,
+        ...lt(i, sr),
+        ...Me(i, ir)
+      }
+    );
+  }), n;
+}
+function lr(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 cr(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 };
+      ve(e, "edge-proxy", i, "_ep");
+    }
+  });
+}
+function ur(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 dr(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 fr(e) {
+  let t = Number.POSITIVE_INFINITY, o = 0, n = Number.POSITIVE_INFINITY, s = 0;
+  const i = e.graph(), r = i.marginx || 0, a = i.marginy || 0;
+  function l(c) {
+    const d = c.x, m = c.y, g = c.width, b = c.height;
+    t = Math.min(t, d - g / 2), o = Math.max(o, d + g / 2), n = Math.min(n, m - b / 2), s = Math.max(s, m + b / 2);
+  }
+  e.nodes().forEach((c) => l(e.node(c))), e.edges().forEach((c) => {
+    const d = e.edge(c);
+    Object.hasOwn(d, "x") && l(d);
+  }), t -= r, n -= a, 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((m) => {
+      m.x -= t, m.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 + a;
+}
+function ao(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 hr(e) {
+  e.edges().forEach((o) => {
+    const n = e.edge(o), s = e.node(o.v), i = e.node(o.w);
+    let r, a;
+    !n.points || !n.points.length ? (n.points = [], r = i, a = s) : (r = n.points[0], a = n.points[n.points.length - 1]);
+    const l = ft(s, r), c = ft(i, a), d = n.points.length ? n.points[0] : r, m = n.points.length ? n.points[n.points.length - 1] : a, g = n.arrowshape, b = g === "normal" || g === "vee", N = !!n.reversed;
+    let _ = l, P = c;
+    b && (N ? _ = ao(l, d, 4) : P = ao(c, m, 4)), n.points.unshift(_), n.points.push(P);
+  });
+}
+function mr(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 gr(e) {
+  e.edges().forEach((t) => {
+    const o = e.edge(t);
+    o.reversed && o.points.reverse();
+  });
+}
+function vr(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 pr(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 br(e) {
+  Oe(e).forEach((o) => {
+    let n = 0;
+    o.forEach((s, i) => {
+      const r = e.node(s);
+      r.order = i + n, (r.selfEdges || []).forEach((a) => {
+        ve(e, "selfedge", {
+          width: a.label.width,
+          height: a.label.height,
+          rank: r.rank,
+          order: i + ++n,
+          e: a.e,
+          label: a.label
+        }, "_se");
+      }), delete r.selfEdges;
+    });
+  });
+}
+function wr(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, a = n.height / 2;
+      e.setEdge(o.e, o.label), e.removeNode(t), o.label.points = [
+        { x: s + 2 * r / 3, y: i - a },
+        { x: s + 5 * r / 6, y: i - a },
+        { x: s + r, y: i },
+        { x: s + 5 * r / 6, y: i + a },
+        { x: s + 2 * r / 3, y: i + a }
+      ], o.label.x = o.x, o.label.y = o.y;
+    }
+  });
+}
+function lt(e, t) {
+  return De(Me(e, t), Number);
+}
+function ct(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 yr = {
+  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 kr(e) {
+  return e.length ? e.map(
+    (t, o) => `${o === 0 ? "M" : "L"} ${t.x} ${t.y}`
+  ).join(" ") : "";
+}
+function Er(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], a = i.x, l = i.y, c = (i.x + r.x) / 2, d = (i.y + r.y) / 2;
+    o += ` Q ${a} ${l} ${c} ${d}`;
+  }
+  const n = e[e.length - 1];
+  return o += ` L ${n.x} ${n.y}`, o;
+}
+function Cr(e) {
+  const { nodes: t, edges: o, configuration: n } = e, s = y(null), i = y(null), r = `dag-arrow-${ut()}`;
+  function a(l, c, d) {
+    i.value = null, s.value = null;
+    const m = {
+      ...yr,
+      ...d
+    }, g = new oe({ multigraph: !0, compound: !0 });
+    g.setGraph({
+      rankdir: m.rankDirection,
+      nodesep: m.nodeSeparation,
+      ranksep: m.rankSeparation,
+      edgesep: m.edgeSeparation,
+      align: m.align
+    }), l.forEach((u) => {
+      g.setNode(u.id, {
+        label: u.label,
+        width: u.width ?? m.nodeWidth,
+        height: u.height ?? m.nodeHeight
+      });
+    }), c.forEach((u) => {
+      g.setEdge(u.from, u.to, {
+        weight: u.weight ?? 1,
+        minlen: u.minLength ?? 1,
+        arrowShape: m.arrowShape ?? "normal"
+      });
+    }), Ks(g);
+    const b = l.map((u) => {
+      const j = g.node(u.id);
+      return {
+        id: u.id,
+        label: u.label,
+        x: j.x,
+        y: j.y,
+        width: j.width,
+        height: j.height,
+        original: u
+      };
+    }), N = g.edges().map((u) => {
+      const j = g.edge(u), Q = j.points || [];
+      if (!Q.length)
+        return null;
+      const Re = m.curvedEdges ? Er(Q) : kr(Q), Te = m.arrowShape !== "undirected" ? `url(#${r})` : null, Pe = c.find((we) => we?.from === u.v && we?.to === u.w);
+      return {
+        id: `${u.v}->${u.w}->${ut()}`,
+        from: u.v,
+        to: u.w,
+        points: Q,
+        pathData: Re,
+        markerEnd: Te,
+        original: {
+          ...Pe,
+          ...j
+        }
+      };
+    }).filter(Boolean), _ = m.padding;
+    if (!b.length) {
+      s.value = {
+        nodes: [],
+        edges: N,
+        viewBox: "0 0 0 0",
+        arrowShape: m.arrowShape,
+        arrowSize: m.arrowSize
+      };
+      return;
+    }
+    const P = b.flatMap((u) => [
+      u.x - u.width / 2,
+      u.x + u.width / 2
+    ]), J = b.flatMap((u) => [
+      u.y - u.height / 2,
+      u.y + u.height / 2
+    ]), be = Math.min(...P) - _, ue = Math.max(...P) + _, F = Math.min(...J) - _, I = Math.max(...J) + _;
+    s.value = {
+      nodes: b,
+      edges: N.map((u) => ({
+        ...u,
+        midpoint: u.pathData ? dn(u.pathData) : { x: 0, y: 0 }
+      })),
+      viewBox: `${be} ${F} ${ue - be} ${I - F}`,
+      arrowShape: m.arrowShape,
+      arrowSize: m.arrowSize
+    };
+  }
+  return rn(() => {
+    try {
+      const l = v(t) || [], c = v(o) || [], d = v(n) || {};
+      a(l, c, d);
+    } catch (l) {
+      console.error("[useDag] layout error:", l), i.value = l, s.value = null;
+    }
+  }), {
+    layoutData: s,
+    lastError: i,
+    arrowMarkerIdentifier: r,
+    recomputeLayout: () => {
+      const l = v(t) || [], c = v(o) || [], d = v(n) || {};
+      a(l, c, d);
+    }
+  };
+}
+const _o = { style: { chart: { backgroundColor: "#1A1A1A", color: "#CCCCCC", backgroundPattern: { dotColor: "#3A3A3A" }, 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" } } } } }, xo = { style: { chart: { backgroundColor: "#FFF8E1", color: "#424242", backgroundPattern: { dotColor: "#edc7bb" }, 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" } } } } }, No = { style: { chart: { backgroundColor: "#1E1E1E", color: "#BDBDBD", backgroundPattern: { dotColor: "#3E3E3E" }, 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" } } } } }, Ao = { style: { chart: { backgroundColor: "#1A1A1A", color: "#99AA99", backgroundPattern: { dotColor: "#2f3d2f" }, 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" } } } } }, So = { style: { chart: { backgroundColor: "#fbfafa", color: "#8A9892", backgroundPattern: { dotColor: "#dbcfc5" }, 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" } } } } }, Lo = { style: { chart: { backgroundColor: "#f6f6fb", color: "#50606C", backgroundPattern: { dotColor: "#c3cfd9" }, 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" } } } } }, Mo = {
+  default: {},
+  dark: _o,
+  celebration: xo,
+  celebrationNight: No,
+  hack: Ao,
+  zen: So,
+  concrete: Lo
+}, vi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  __proto__: null,
+  celebration: xo,
+  celebrationNight: No,
+  concrete: Lo,
+  dark: _o,
+  default: Mo,
+  hack: Ao,
+  zen: So
+}, Symbol.toStringTag, { value: "Module" })), _r = ["id"], xr = {
+  key: 0,
+  class: "dag-chart-error"
+}, Nr = ["viewBox", "xmlns"], Ar = { key: 0 }, Sr = ["id", "width", "height"], Lr = ["cx", "cy", "r", "fill"], Mr = ["x", "y", "width", "height", "fill"], Or = { key: 2 }, Dr = ["id", "markerWidth", "markerHeight", "refX", "refY"], Rr = ["d", "fill", "stroke"], Tr = ["d", "fill", "stroke"], Pr = { class: "vue-ui-dag-edges" }, Fr = ["d", "stroke", "stroke-width"], $r = ["cx", "cy", "r", "fill", "stroke", "stroke-width", "onMouseenter"], Br = { class: "vue-ui-dag-nodes" }, zr = ["onClick", "onMouseenter"], Vr = ["x", "y", "width", "height", "rx", "fill", "stroke", "stroke-width"], Ir = ["x", "y", "font-size", "fill", "font-weight"], Gr = ["x", "y", "font-size", "fill", "font-weight", "innerHTML"], jr = { key: 1 }, Wr = ["x", "y", "width", "height"], Yr = { class: "vue-ui-dag-edges" }, Hr = ["d", "stroke-width", "marker-end"], Ur = {
+  key: 6,
+  class: "vue-data-ui-watermark"
+}, Zr = ["data-position"], Xr = { key: 0 }, qr = ["data-position"], Kr = { key: 0 }, lo = 1.5, Jr = {
+  __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 = et(() => import("./PenAndPaper-Cjiyv0O9.js")), s = et(() => import("./UserOptions-DKK-Opvk.js")), i = et(() => import("./PackageVersion-BuFi5-eQ.js")), { vue_ui_dag: r } = wn(), { isThemeValid: a, warnInvalidTheme: l } = _n(), c = e, d = o, m = y(null), g = y(ut()), b = y(null), N = y(null), _ = y(null), P = y(0), J = y(0), be = y(!1), ue = y(!1), F = y(null), I = y(null), u = y(Ye()), j = y(u.value.style.chart.width), Q = y(u.value.style.chart.height), Re = y({ x: 0, y: 0 }), G = y(null), Te = y(null), Pe = y({ left: "0px", top: "0px" }), we = y("top"), ne = y(!1), gt = y({ x: 0, y: 0 }), vt = y({ x: 0, y: 0 }), ye = y(null), Ge = y(null), je = y({ left: "0px", top: "0px" }), pt = y("top"), Fe = y(!1), ke = y(!1), { svgRef: se } = Nn({ config: u.value.style.chart.title }), { userOptionsVisible: We, setUserOptionsVisibility: bt, keepUserOptionState: wt } = xn({ config: u.value }), ee = y(u.value.style.chart.layout.rankDirection), { loading: Ee, FINAL_DATASET: yt, manualLoading: kt } = yn({
+      ...an(c),
+      FINAL_CONFIG: u,
+      prepareConfig: Ye,
+      skeletonDataset: {
+        nodes: [
+          { id: "A", label: "" },
+          { id: "B", label: "" },
+          { id: "C", label: "" }
+        ],
+        edges: [
+          { from: "A", to: "B" },
+          { from: "A", to: "C" }
+        ]
+      },
+      skeletonConfig: fn({
+        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 Ye() {
+      const f = nt({
+        userConfig: c.config,
+        defaultConfig: r
+      }), p = f.theme;
+      if (!p) return f;
+      if (!a.value(f))
+        return l(f), f;
+      const h = nt({
+        userConfig: Mo[p] || c.config,
+        defaultConfig: f
+      });
+      return nt({
+        userConfig: c.config,
+        defaultConfig: h
+      });
+    }
+    const He = H(() => !!u.value.debug);
+    It(async () => {
+      hn(c.dataset) && (Ht({
+        componentName: "VueUiDag",
+        type: "dataset",
+        debug: He.value
+      }), ue.value = !1, kt.value = !0), c.dataset.nodes || (Ht({
+        componentName: "VueUiDag",
+        type: "datasetAttributeEmpty",
+        property: "nodes",
+        index: 0,
+        debug: He.value
+      }), ue.value = !1, kt.value = !0), ue.value = !0, await Ne(), zt();
+    }), Ae(() => c.config, async (f) => {
+      Ee.value || (u.value = Ye()), We.value = !u.value.userOptions.showOnChartHover, P.value += 1, ee.value = u.value.style.chart.layout.rankDirection, j.value = u.value.style.chart.width, Q.value = u.value.style.chart.height, de.value = u.value.style.chart.zoom.active, await Ne(), zt();
+    }, { deep: !0 });
+    const { isPrinting: Et, isImaging: Ct, generatePdf: _t, generateImage: xt } = En({
+      elementId: `dag_${g.value}`,
+      fileName: u.value.style.chart.title.text || "vue-ui-dag",
+      options: u.value.userOptions.print
+    }), Oo = H(() => u.value.style.chart.backgroundColor), Do = H(() => u.value.style.chart.title), { exportSvg: Ro, getSvg: To } = Cn({
+      svg: se,
+      title: Do,
+      legend: void 0,
+      legendItems: void 0,
+      backgroundColor: Oo
+    });
+    async function Nt({ isCb: f }) {
+      if (f) {
+        const { blob: p, url: h, text: w, dataUrl: O } = await To();
+        u.value.userOptions.callbacks.svg({ blob: p, url: h, text: w, dataUrl: O });
+      } else
+        Ro();
+    }
+    function Po() {
+      be.value = !0, bt(!0);
+    }
+    function Fo() {
+      bt(!1), be.value = !1;
+    }
+    function At({
+      tooltipRef: f,
+      isVisibleRef: p,
+      anchorRef: h,
+      styleRef: w,
+      placementRef: O,
+      offsetRef: A,
+      margin: E = 24
+    }) {
+      return function() {
+        const W = f.value;
+        if (!W || !p.value) return;
+        const S = W.getBoundingClientRect(), T = window.innerWidth, B = window.innerHeight, Y = h.value.x, q = h.value.y, U = A?.value?.x ?? 0, ae = A?.value?.y ?? 0;
+        let D = q - ae - S.height - E, Z = Y - S.width / 2, _e = "top";
+        if (D < E) {
+          const he = q + ae + E;
+          he + S.height <= B - E ? (D = he, _e = "bottom") : (D = q - S.height / 2, D < E && (D = E), D + S.height > B - E && (D = B - S.height - E), _e = "center");
+        }
+        Z < E && (Z = E), Z + S.width > T - E && (Z = T - S.width - E);
+        const on = Z <= E, nn = Z + S.width >= T - E;
+        if ((on || nn) && _e !== "center") {
+          let he, xe;
+          const sn = Y - U - E;
+          T - (Y + U) - E >= sn ? (he = "right", xe = Y + U + E) : (he = "left", xe = Y - U - E - S.width), xe >= E && xe + S.width <= T - E && (Z = xe, D = q - S.height / 2, D < E && (D = E), D + S.height > B - E && (D = B - S.height - E), _e = he);
+        }
+        O.value = _e, w.value = {
+          left: `${Z}px`,
+          top: `${D}px`
+        };
+      };
+    }
+    const $o = H(() => yt.value.nodes.map((f) => ({
+      ...f,
+      backgroundColor: f.backgroundColor ? Ut(f.backgroundColor) : u.value.style.chart.nodes.backgroundColor,
+      color: f.color ? Ut(f.color) : u.value.style.chart.nodes.labels.color
+    }))), Bo = H(() => yt.value.edges), zo = H(() => ({
+      ...u.value.style.chart.layout,
+      rankDirection: ee.value
+    })), { layoutData: k, lastError: St, arrowMarkerIdentifier: Vo } = Cr({
+      nodes: $o,
+      edges: Bo,
+      configuration: zo
+    });
+    function Lt(f) {
+      return k.value ? k.value.nodes.find((p) => p.id === f) : null;
+    }
+    const Io = H(() => {
+      if (!k.value) return [];
+      const f = u.value.style.chart.edges.stroke, p = /* @__PURE__ */ new Set();
+      return k.value.edges.forEach((h) => {
+        p.add(h.original?.color || f);
+      }), Array.from(p);
+    });
+    function Mt(f) {
+      return `${Vo}-${String(f).replace(/[^a-zA-Z0-9_-]/g, "_")}`;
+    }
+    const Ot = H(() => {
+      const f = j.value, p = Q.value, h = Number(f), w = Number(p), O = Number.isFinite(h) && h > 0, A = Number.isFinite(w) && w > 0;
+      return !O && !A ? null : {
+        width: O ? h : null,
+        height: A ? w : null
+      };
+    }), Ce = y(null), de = y(u.value.style.chart.zoom.active), {
+      viewBox: fe,
+      resetZoom: $e,
+      setInitialViewBox: Go,
+      scale: Dt,
+      zoomByFactor: Rt
+    } = bn(
+      se,
+      { x: 0, y: 0, width: 100, height: 100 },
+      1,
+      de,
+      () => {
+        ne.value = !1;
+      }
+    );
+    function jo() {
+      de.value = !de.value;
+    }
+    function Tt() {
+      const f = k.value && k.value.viewBox;
+      if (!f) return;
+      const p = String(f).split(" ").map(Number);
+      if (p.length !== 4) return;
+      const [h, w, O, A] = p;
+      if (!Number.isFinite(h) || !Number.isFinite(w) || !Number.isFinite(O) || !Number.isFinite(A))
+        return;
+      let E = O, R = A, W = h, S = w;
+      const T = Ot.value;
+      T && (T.width !== null && (E = T.width), T.height !== null && (R = T.height), W = h - (E - O) / 2, S = w - (R - A) / 2), Go(
+        { x: W, y: S, width: E, height: R },
+        { overwriteCurrentIfNotZoomed: !0 }
+      );
+    }
+    Ae(
+      () => k.value && k.value.viewBox,
+      () => {
+        Tt();
+      },
+      { immediate: !0 }
+    ), Ae(
+      () => Ot.value,
+      () => {
+        Tt();
+      }
+    ), Ae(() => ke.value, (f) => {
+      de.value = !f;
+    });
+    const Wo = H(() => {
+      const f = fe.value;
+      return f ? `${f.x} ${f.y} ${f.width} ${f.height}` : "0 0 0 0";
+    }), re = y(!1);
+    function Pt(f) {
+      re.value = f, J.value += 1;
+    }
+    function Ue() {
+      ke.value = !ke.value;
+    }
+    function Ze() {
+      Rt(lo, !0);
+    }
+    function Xe() {
+      Rt(1 / lo, !0);
+    }
+    const qe = ["TB", "RL", "BT", "LR"];
+    function Ke() {
+      ee.value = qe[(qe.indexOf(ee.value) + 1) % qe.length], $e();
+    }
+    const Yo = At({
+      tooltipRef: Te,
+      isVisibleRef: Fe,
+      anchorRef: Re,
+      styleRef: Pe,
+      placementRef: we
+    }), Ho = At({
+      tooltipRef: Ge,
+      isVisibleRef: ne,
+      anchorRef: gt,
+      styleRef: je,
+      placementRef: pt,
+      offsetRef: vt
+    });
+    async function Uo(f) {
+      d("onMidpointEnter", f);
+      const p = se.value;
+      if (!p || !f?.midpoint) return;
+      const h = p.createSVGPoint();
+      h.x = f.midpoint.x, h.y = f.midpoint.y;
+      const w = p.getScreenCTM();
+      if (!w) return;
+      const O = h.matrixTransform(w);
+      Re.value = {
+        x: O.x,
+        y: O.y
+      }, G.value = f, Fe.value = !0, await Ne(), Yo();
+    }
+    function Zo() {
+      Fe.value = !1, G.value = null, d("onMidpointLeave");
+    }
+    async function Xo(f) {
+      if (d("onNodeClick", f), !u.value.style.chart.nodes.tooltip.showOnClick) return;
+      const p = se.value;
+      if (!p) return;
+      const h = p.createSVGPoint();
+      h.x = f.x, h.y = f.y;
+      const w = p.getScreenCTM();
+      if (!w) return;
+      const O = h.matrixTransform(w), A = u.value.style.chart.layout.nodeWidth, E = u.value.style.chart.layout.nodeHeight, R = w.a, W = w.d, S = A * R, T = E * W;
+      vt.value = {
+        x: S / 2,
+        y: T / 2
+      }, gt.value = {
+        x: O.x,
+        y: O.y
+      }, ye.value = f, ne.value = !0, await Ne(), Ho();
+    }
+    function Ft() {
+      ne.value = !1, ye.value = null;
+    }
+    function $t(f) {
+      if (!ne.value) return;
+      const p = Ge.value;
+      if (p && p.contains(f.target))
+        return;
+      const h = se.value;
+      h && h.contains(f.target) && f.target.closest(".vue-ui-dag-node") || Ft();
+    }
+    function Bt(f) {
+      f.key === "Escape" && ne.value && Ft();
+    }
+    It(() => {
+      document.addEventListener("mousedown", $t), document.addEventListener("keydown", Bt);
+    }), Gt(() => {
+      document.removeEventListener("mousedown", $t), document.removeEventListener("keydown", Bt), F.value && (I.value && F.value.unobserve(I.value), F.value.disconnect());
+    });
+    function zt() {
+      if (!u.value.responsive) {
+        F.value && (I.value && F.value.unobserve(I.value), F.value.disconnect(), F.value = null, I.value = null);
+        return;
+      }
+      const f = vn(() => {
+        if (!m.value) return;
+        const { width: p, height: h } = pn({
+          chart: m.value,
+          title: u.value.style.chart.title.text ? b.value : null,
+          legend: u.value.style.chart.controls.show ? _.value?.$el : null,
+          source: N.value
+        });
+        requestAnimationFrame(() => {
+          j.value = Math.max(0.1, p), Q.value = Math.max(0.1, h - 12);
+        });
+      });
+      F.value && (I.value && F.value.unobserve(I.value), F.value.disconnect()), F.value = new ResizeObserver(f), I.value = m.value ? m.value.parentNode : null, I.value && F.value.observe(I.value), f();
+    }
+    function qo(f, p = {}) {
+      const {
+        direction: h = -1,
+        mode: w = "oneLapNearest",
+        dasharray: O = null
+      } = p;
+      if (!f || typeof f.getTotalLength != "function")
+        return He.value && console.warn(
+          "VueUiDag @getIdealDashoffsetDelta: invalid path element",
+          f
+        ), 0;
+      const A = f.getTotalLength(), E = O ?? f.getAttribute("stroke-dasharray") ?? (typeof getComputedStyle == "function" ? getComputedStyle(f).strokeDasharray : ""), R = Y(E);
+      if (!Number.isFinite(R) || R <= 0)
+        return h * A;
+      const W = Math.max(1, Math.round(A / R)), S = Math.max(1, Math.ceil(A / R)), T = Math.max(1, Math.floor(A / R));
+      let B;
+      return w === "pattern" ? B = R : w === "oneLapCeil" ? B = S * R : w === "oneLapFloor" ? B = T * R : B = W * R, h * B;
+      function Y(q) {
+        if (!q || q === "none") return NaN;
+        const U = String(q).replace(/,/g, " ").trim().split(/\s+/).map((D) => Number.parseFloat(D)).filter((D) => Number.isFinite(D));
+        if (!U.length) return NaN;
+        const ae = U.reduce((D, Z) => D + Z, 0);
+        return U.length % 2 === 1 ? ae * 2 : ae;
+      }
+    }
+    const Je = y(/* @__PURE__ */ new Map()), Qe = y(/* @__PURE__ */ new Map());
+    function Ko(f) {
+      return function(h) {
+        h ? Je.value.set(f, h) : Je.value.delete(f);
+      };
+    }
+    function Vt() {
+      Qe.value.forEach((f) => {
+        try {
+          f.cancel();
+        } catch {
+        }
+      }), Qe.value.clear();
+    }
+    function Jo() {
+      Vt();
+      const f = k.value?.edges ?? [];
+      if (!f.length) return;
+      const p = u.value.style.chart.edges.animations, h = Number(p.referenceDistance) > 0 ? Number(p.referenceDistance) : 24;
+      f.forEach((w) => {
+        if (!!!w?.original?.animated) return;
+        const A = Je.value.get(w.id);
+        if (!A) return;
+        const E = w?.original?.dasharray ?? p.dasharray;
+        A.style.strokeDasharray = String(E), A.style.strokeDashoffset = "0";
+        const R = ![void 0, null].includes(w?.original?.animationDirection), W = ![void 0, null].includes(p.animationDirection), S = R ? Number(w.original.animationDirection) : W ? Number(p.animationDirection) : -1, T = qo(A, {
+          direction: S,
+          mode: "oneLapNearest",
+          dasharray: String(E)
+        }), B = w?.original?.animationDurationMs ?? p.animationDurationMs ?? 1e3, Y = Number(B), U = Number.isFinite(Y) && Y > 0 ? h / Y : h / 1e3, ae = Math.max(1, Math.round(Math.abs(T) / Math.max(1e-9, U))), D = A.animate(
+          [{ strokeDashoffset: 0 }, { strokeDashoffset: T }],
+          { duration: ae, iterations: 1 / 0, easing: "linear" }
+        );
+        Qe.value.set(w.id, D);
+      });
+    }
+    Ae(
+      () => k.value && k.value.edges,
+      async () => {
+        await Ne(), Jo();
+      },
+      { deep: !0, immediate: !0 }
+    ), Gt(() => {
+      Vt();
+    });
+    async function Qo({ scale: f = 2 } = {}) {
+      if (!m.value) return;
+      const { width: p, height: h } = m.value.getBoundingClientRect(), w = p / h, { imageUri: O, base64: A } = await Sn({ domElement: m.value, base64: !0, img: !0, scale: f });
+      return {
+        imageUri: O,
+        base64: A,
+        title: u.value.style.chart.title.text ?? "vue-ui-dag",
+        width: p,
+        height: h,
+        aspectRatio: w
+      };
+    }
+    const ie = H(() => {
+      const f = Number(u.value.style.chart.layout.nodeHeight);
+      return Number.isFinite(f) && f > 0 ? f / u.value.style.chart.backgroundPattern.spacingRatio : 12;
+    }), en = H(() => ie.value * (u.value.style.chart.backgroundPattern.dotRadiusRatio / 100));
+    function tn() {
+      return k.value;
+    }
+    return t({
+      getData: tn,
+      getImage: Qo,
+      generatePdf: _t,
+      generateSvg: Nt,
+      generateImage: xt,
+      toggleAnnotator: Ue,
+      toggleFullscreen: Pt,
+      zoomIn: Ze,
+      zoomOut: Xe,
+      resetZoom: $e,
+      switchDirection: Ke
+    }), (f, p) => (C(), x("div", {
+      class: jt(`vue-data-ui-component vue-ui-dag ${re.value ? "vue-data-ui-wrapper-fullscreen" : ""} ${u.value.responsive ? "vue-ui-dag-responsive" : ""}`),
+      id: `dag_${g.value}`,
+      ref_key: "dagChart",
+      ref: m,
+      style: le({
+        fontFamily: u.value.style.fontFamily,
+        backgroundColor: u.value.style.chart.backgroundColor,
+        padding: "0.5rem"
+      }),
+      onMouseenter: Po,
+      onMouseleave: Fo
+    }, [
+      v(St) ? (C(), x("div", xr, Se(String(v(St))), 1)) : L("", !0),
+      u.value.userOptions.buttons.annotator ? (C(), te(v(n), {
+        key: 1,
+        svgRef: v(se),
+        backgroundColor: u.value.style.chart.backgroundColor,
+        color: u.value.style.chart.color,
+        active: ke.value,
+        onClose: Ue
+      }, {
+        "annotator-action-close": $(() => [
+          M(f.$slots, "annotator-action-close", {}, void 0, !0)
+        ]),
+        "annotator-action-color": $(({ color: h }) => [
+          M(f.$slots, "annotator-action-color", z(V({ color: h })), void 0, !0)
+        ]),
+        "annotator-action-draw": $(({ mode: h }) => [
+          M(f.$slots, "annotator-action-draw", z(V({ mode: h })), void 0, !0)
+        ]),
+        "annotator-action-undo": $(({ disabled: h }) => [
+          M(f.$slots, "annotator-action-undo", z(V({ disabled: h })), void 0, !0)
+        ]),
+        "annotator-action-redo": $(({ disabled: h }) => [
+          M(f.$slots, "annotator-action-redo", z(V({ disabled: h })), void 0, !0)
+        ]),
+        "annotator-action-delete": $(({ disabled: h }) => [
+          M(f.$slots, "annotator-action-delete", z(V({ disabled: h })), void 0, !0)
+        ]),
+        _: 3
+      }, 8, ["svgRef", "backgroundColor", "color", "active"])) : L("", !0),
+      u.value.userOptions.show && ue.value && (v(wt) || v(We)) ? (C(), te(v(s), {
+        ref: "userOptionsRef",
+        key: `user_option_${J.value}`,
+        backgroundColor: u.value.style.chart.backgroundColor,
+        color: u.value.style.chart.color,
+        isPrinting: v(Et),
+        isImaging: v(Ct),
+        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: re.value,
+        chartElement: m.value,
+        position: u.value.userOptions.position,
+        titles: { ...u.value.userOptions.buttonTitles },
+        hasAnnotator: u.value.userOptions.buttons.annotator,
+        isAnnotation: ke.value,
+        callbacks: u.value.userOptions.callbacks,
+        printScale: u.value.userOptions.print.scale,
+        hasZoom: u.value.userOptions.buttons.zoom,
+        isZoom: de.value,
+        onToggleFullscreen: Pt,
+        onGeneratePdf: v(_t),
+        onGenerateImage: v(xt),
+        onGenerateSvg: Nt,
+        onToggleAnnotator: Ue,
+        onToggleZoom: jo,
+        style: le({
+          visibility: v(wt) ? v(We) ? "visible" : "hidden" : "visible"
+        })
+      }, ln({ _: 2 }, [
+        f.$slots.menuIcon ? {
+          name: "menuIcon",
+          fn: $(({ isOpen: h, color: w }) => [
+            M(f.$slots, "menuIcon", z(V({ isOpen: h, color: w })), void 0, !0)
+          ]),
+          key: "0"
+        } : void 0,
+        f.$slots.optionPdf ? {
+          name: "optionPdf",
+          fn: $(() => [
+            M(f.$slots, "optionPdf", {}, void 0, !0)
+          ]),
+          key: "1"
+        } : void 0,
+        f.$slots.optionImg ? {
+          name: "optionImg",
+          fn: $(() => [
+            M(f.$slots, "optionImg", {}, void 0, !0)
+          ]),
+          key: "2"
+        } : void 0,
+        f.$slots.optionSvg ? {
+          name: "optionSvg",
+          fn: $(() => [
+            M(f.$slots, "optionSvg", {}, void 0, !0)
+          ]),
+          key: "3"
+        } : void 0,
+        f.$slots.optionFullscreen ? {
+          name: "optionFullscreen",
+          fn: $(({ toggleFullscreen: h, isFullscreen: w }) => [
+            M(f.$slots, "optionFullscreen", z(V({ toggleFullscreen: h, isFullscreen: w })), void 0, !0)
+          ]),
+          key: "4"
+        } : void 0,
+        f.$slots.optionAnnotator ? {
+          name: "optionAnnotator",
+          fn: $(({ toggleAnnotator: h, isAnnotator: w }) => [
+            M(f.$slots, "optionAnnotator", z(V({ toggleAnnotator: h, isAnnotator: w })), void 0, !0)
+          ]),
+          key: "5"
+        } : void 0,
+        f.$slots.optionZoom ? {
+          name: "optionZoom",
+          fn: $(({ toggleZoom: h, isZoomLocked: w }) => [
+            M(f.$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"])) : L("", !0),
+      u.value.style.chart.title.text ? (C(), x("div", {
+        key: 3,
+        ref_key: "chartTitle",
+        ref: b,
+        style: "width:100%;background:transparent;"
+      }, [
+        (C(), te(An, {
+          key: `title_${P.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)) : L("", !0),
+      u.value.style.chart.controls.position === "top" && !v(Ee) && u.value.style.chart.controls.show ? (C(), te(Zt, {
+        key: 4,
+        ref_key: "zoomControls",
+        ref: _,
+        config: u.value,
+        scale: v(Dt),
+        isFullscreen: re.value,
+        withDirection: "",
+        onZoomIn: Ze,
+        onZoomOut: Xe,
+        onResetZoom: p[0] || (p[0] = () => v($e)(!0)),
+        onSwitchDirection: Ke
+      }, null, 8, ["config", "scale", "isFullscreen"])) : L("", !0),
+      v(k) ? (C(), x("svg", {
+        key: 5,
+        ref_key: "svgRef",
+        ref: se,
+        class: jt({ "vue-ui-dag-svg": !0, "vue-data-ui-loading": v(Ee) }),
+        viewBox: Wo.value,
+        xmlns: v(mn),
+        style: le({
+          backgroundColor: u.value.style.chart.backgroundColor,
+          height: "100%",
+          width: "100%"
+        })
+      }, [
+        tt(v(i)),
+        u.value.style.chart.backgroundPattern.show ? (C(), x("defs", Ar, [
+          K("pattern", {
+            id: `dag_bg_pattern_${g.value}`,
+            patternUnits: "userSpaceOnUse",
+            width: ie.value,
+            height: ie.value
+          }, [
+            M(f.$slots, "background-pattern", z(V({
+              x: ie.value / 2,
+              y: ie.value / 2,
+              color: u.value.style.chart.backgroundPattern.dotColor
+            })), () => [
+              K("circle", {
+                cx: ie.value / 2,
+                cy: ie.value / 2,
+                r: en.value,
+                fill: u.value.style.chart.backgroundPattern.dotColor
+              }, null, 8, Lr)
+            ], !0)
+          ], 8, Sr)
+        ])) : L("", !0),
+        u.value.style.chart.backgroundPattern.show ? (C(), x("rect", {
+          key: 1,
+          x: v(fe)?.x ?? 0,
+          y: v(fe)?.y ?? 0,
+          width: v(fe)?.width ?? 0,
+          height: v(fe)?.height ?? 0,
+          fill: `url(#dag_bg_pattern_${g.value})`,
+          style: le({
+            pointerEvents: "none",
+            opacity: u.value.style.chart.backgroundPattern.opacity
+          })
+        }, null, 12, Mr)) : L("", !0),
+        v(k).arrowShape !== "undirected" ? (C(), x("defs", Or, [
+          (C(!0), x(me, null, Be(Io.value, (h) => (C(), x("marker", {
+            key: h,
+            id: Mt(h),
+            markerWidth: v(k).arrowSize,
+            markerHeight: v(k).arrowSize,
+            refX: v(k).arrowSize - 3,
+            refY: v(k).arrowSize / 2,
+            orient: "auto",
+            markerUnits: "strokeWidth"
+          }, [
+            v(k).arrowShape === "normal" ? (C(), x("path", {
+              key: 0,
+              d: `M 0 0 L ${v(k).arrowSize} ${v(k).arrowSize / 2} L 0 ${v(k).arrowSize} Z`,
+              fill: h,
+              stroke: h,
+              "stroke-width": "0"
+            }, null, 8, Rr)) : (C(), x("path", {
+              key: 1,
+              d: `M 0 0 L ${v(k).arrowSize} ${v(k).arrowSize / 2} L 0 ${v(k).arrowSize} L ${v(k).arrowSize / 3} ${v(k).arrowSize / 2} Z`,
+              fill: h,
+              stroke: h,
+              "stroke-width": "0"
+            }, null, 8, Tr))
+          ], 8, Dr))), 128))
+        ])) : L("", !0),
+        K("g", Pr, [
+          (C(!0), x(me, null, Be(v(k).edges, (h) => (C(), x(me, {
+            key: h.id
+          }, [
+            K("path", {
+              "data-cy-edge": "",
+              ref_for: !0,
+              ref: Ko(h.id),
+              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 === Ce.value || h.id === G.value?.id ? 2 : 1),
+              "stroke-linecap": "round",
+              "stroke-linejoin": "round",
+              style: { "pointer-events": "none", transition: "stroke-width 0.2s ease-in-out" }
+            }, null, 8, Fr),
+            u.value.style.chart.midpoints.show ? (C(), x("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 === Ce.value || h.id === G.value?.id ? 2 : 1),
+              style: { transition: "stroke-width 0.2s ease-in-out" },
+              onMouseenter: (w) => Uo(h),
+              onMouseleave: Zo
+            }, null, 40, $r)) : L("", !0)
+          ], 64))), 128))
+        ]),
+        K("g", Br, [
+          (C(!0), x(me, null, Be(v(k).nodes, (h) => (C(), x("g", {
+            key: h.id,
+            class: "vue-ui-dag-node",
+            onClick: cn((w) => u.value.style.chart.nodes.tooltip.showOnClick && Xo(h), ["stop"]),
+            onMouseenter: (w) => Ce.value = h.id,
+            onMouseleave: p[1] || (p[1] = (w) => Ce.value = null)
+          }, [
+            f.$slots.node ? L("", !0) : (C(), x(me, { key: 0 }, [
+              K("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: le({
+                  cursor: u.value.style.chart.nodes.tooltip.showOnClick ? "pointer" : "default"
+                })
+              }, null, 12, Vr),
+              f.$slots["node-label"] ? (C(), x("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"
+              }, [
+                M(f.$slots, "node-label", ot({ ref_for: !0 }, { node: h, orientation: ee.value }), () => [
+                  un(Se(h.label), 1)
+                ], !0)
+              ], 8, Ir)) : f.$slots["free-node-label"] ? L("", !0) : (C(), x("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(gn)({
+                  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, Gr))
+            ], 64)),
+            f.$slots["free-node-label"] ? (C(), x("g", jr, [
+              M(f.$slots, "free-node-label", ot({ ref_for: !0 }, { node: h, layoutData: v(k), orientation: ee.value }), void 0, !0)
+            ])) : L("", !0),
+            f.$slots.node ? (C(), x("foreignObject", {
+              key: 2,
+              x: h.x - h.width / 2,
+              y: h.y - h.height / 2,
+              width: h.width,
+              height: h.height
+            }, [
+              M(f.$slots, "node", ot({ ref_for: !0 }, { node: h, orientation: ee.value }), void 0, !0)
+            ], 8, Wr)) : L("", !0)
+          ], 40, zr))), 128))
+        ]),
+        K("g", Yr, [
+          (C(!0), x(me, null, Be(v(k).edges, (h) => (C(), x("path", {
+            key: h.id,
+            d: h.pathData,
+            fill: "none",
+            stroke: "transparent",
+            "stroke-width": u.value.style.chart.edges.strokeWidth * (h.from === Ce.value || h.id === G.value?.id ? 1.3 : 1),
+            "stroke-linecap": "round",
+            "stroke-linejoin": "round",
+            "marker-end": v(k).arrowShape === "undirected" ? null : `url(#${Mt(h.original?.color || u.value.style.chart.edges.stroke)})`,
+            style: { "pointer-events": "none", transition: "stroke-width 0.2s ease-in-out" }
+          }, null, 8, Hr))), 128))
+        ]),
+        M(f.$slots, "svg", {
+          svg: {
+            drawingArea: v(fe),
+            data: v(k),
+            orientation: ee.value
+          }
+        }, void 0, !0)
+      ], 14, Nr)) : L("", !0),
+      f.$slots.watermark ? (C(), x("div", Ur, [
+        M(f.$slots, "watermark", z(V({ isPrinting: v(Et) || v(Ct) })), void 0, !0)
+      ])) : L("", !0),
+      tt(Wt, { name: "fade" }, {
+        default: $(() => [
+          Fe.value ? (C(), te(Yt, {
+            key: 0,
+            to: re.value ? m.value : "body"
+          }, [
+            K("div", {
+              "data-cy-tooltip-midpoint": "",
+              ref_key: "tooltipRef",
+              ref: Te,
+              class: "vue-ui-dag-tooltip",
+              style: le({
+                ...Pe.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": we.value
+            }, [
+              M(f.$slots, "tooltip-midpoint", z(V({ edge: G.value, layoutData: v(k) })), () => [
+                G.value ? (C(), x("div", Xr, Se(Lt(G.value.from)?.label ?? G.value.from) + " → " + Se(Lt(G.value.to)?.label ?? G.value.to), 1)) : L("", !0)
+              ], !0)
+            ], 12, Zr)
+          ], 8, ["to"])) : L("", !0)
+        ]),
+        _: 3
+      }),
+      tt(Wt, { name: "fade" }, {
+        default: $(() => [
+          ne.value ? (C(), te(Yt, {
+            key: 0,
+            to: re.value ? m.value : "body"
+          }, [
+            K("div", {
+              "data-cy-tooltip-node": "",
+              ref_key: "nodeTooltipRef",
+              ref: Ge,
+              class: "vue-ui-dag-node-tooltip",
+              style: le({
+                maxWidth: u.value.style.chart.nodes.tooltip.maxWidth,
+                left: je.value.left,
+                top: je.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": pt.value
+            }, [
+              M(f.$slots, "tooltip-node", z(V({ node: ye.value, layoutData: v(k) })), () => [
+                ye.value ? (C(), x("div", Kr, Se(ye.value.label), 1)) : L("", !0)
+              ], !0)
+            ], 12, qr)
+          ], 8, ["to"])) : L("", !0)
+        ]),
+        _: 3
+      }),
+      u.value.style.chart.controls.position === "bottom" && !v(Ee) && u.value.style.chart.controls.show ? (C(), te(Zt, {
+        key: 7,
+        ref_key: "zoomControls",
+        ref: _,
+        config: u.value,
+        scale: v(Dt),
+        isFullscreen: re.value,
+        withDirection: "",
+        onZoomIn: Ze,
+        onZoomOut: Xe,
+        onResetZoom: p[2] || (p[2] = () => v($e)(!0)),
+        onSwitchDirection: Ke
+      }, null, 8, ["config", "scale", "isFullscreen"])) : L("", !0),
+      f.$slots.source ? (C(), x("div", {
+        key: 8,
+        ref_key: "source",
+        ref: N,
+        dir: "auto"
+      }, [
+        M(f.$slots, "source", {}, void 0, !0)
+      ], 512)) : L("", !0),
+      v(Ee) ? (C(), te(kn, { key: 9 })) : L("", !0)
+    ], 46, _r));
+  }
+}, Qr = /* @__PURE__ */ Ln(Jr, [["__scopeId", "data-v-1a06cb38"]]), pi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  __proto__: null,
+  default: Qr
+}, Symbol.toStringTag, { value: "Module" }));
+export {
+  vi as a,
+  pi as b,
+  Qr as v
+};