vue-data-ui 3.10.4 → 3.11.0

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

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