chiltepin-render 0.33.3 → 0.34.1

package/dist/index.js

@@ -4011,2468 +4011,2495 @@ function nodeCellAttrs(col, row, w2) {
   return ` data-col="${col}" data-row="${row}"${w2 !== void 0 ? ` data-w="${w2}"` : ""}`;
 }
 
-// ../../node_modules/.pnpm/@dagrejs+dagre@3.0.0/node_modules/@dagrejs/dagre/dist/dagre.esm.js
-var ge = Object.defineProperty;
-var hn = (e, n, t) => n in e ? ge(e, n, { enumerable: true, configurable: true, writable: true, value: t }) : e[n] = t;
-var fn = (e, n) => {
-  for (var t in n) ge(e, t, { get: n[t], enumerable: true });
+// src/svg/glyphs.ts
+var GENERIC_BOX = "box";
+var PATHS = {
+  // λ
+  function: "M3 2 H5 L10.5 12 M7.6 7 L3.5 12",
+  // pail: elliptical rim, tapered sides
+  bucket: "M2 3.5 a5 1.6 0 0 0 10 0 a5 1.6 0 0 0 -10 0 M2 3.5 L3.5 12.5 H10.5 L12 3.5",
+  // three message bars
+  queue: "M3 1.5 V12.5 M7 1.5 V12.5 M11 1.5 V12.5",
+  // one in, fan out to three
+  topic: "M1.5 7 H5.5 M5.5 7 L11.5 2.5 M5.5 7 H12 M5.5 7 L11.5 11.5",
+  // stacked memory slabs
+  cache: "M1.5 4.5 L7 2 L12.5 4.5 L7 7 Z M1.5 8 L7 10.5 L12.5 8 M1.5 11 L7 13.5 L12.5 11",
+  // the cylinder
+  db: "M1.5 3 a5.5 2.2 0 0 0 11 0 a5.5 2.2 0 0 0 -11 0 V11 a5.5 2.2 0 0 0 11 0 V3",
+  // cloud
+  cdn: "M3.5 12 a3 3 0 0 1 0.3 -6 a4 4 0 0 1 7.6 1 a2.5 2.5 0 0 1 0.6 5 Z",
+  // splitter: one lane in, three out
+  lb: "M1.5 7 H5 M5 7 L9 3 H12.5 M5 7 H12.5 M5 7 L9 11 H12.5",
+  // double chevron
+  gateway: "M2 1.5 L7 7 L2 12.5 M7.5 1.5 L12.5 7 L7.5 12.5",
+  // hexagon with a core
+  pod: "M7 1.2 L12.2 4.1 V9.9 L7 12.8 L1.8 9.9 V4.1 Z M5.2 7 a1.8 1.8 0 1 0 3.6 0 a1.8 1.8 0 1 0 -3.6 0",
+  // wheel: ring + four spokes
+  cluster: "M1.5 7 a5.5 5.5 0 1 0 11 0 a5.5 5.5 0 1 0 -11 0 M7 1.5 V4.5 M7 9.5 V12.5 M1.5 7 H4.5 M9.5 7 H12.5",
+  // head + shoulders
+  user: "M4.5 4.5 a2.5 2.5 0 1 0 5 0 a2.5 2.5 0 1 0 -5 0 M2.5 13 a4.5 4.5 0 0 1 9 0",
+  // window with a header band
+  browser: "M1.5 2.5 H12.5 V11.5 H1.5 Z M1.5 5.5 H12.5",
+  // phone
+  mobile: "M4 1.5 H10 a1 1 0 0 1 1 1 V11.5 a1 1 0 0 1 -1 1 H4 a1 1 0 0 1 -1 -1 V2.5 a1 1 0 0 1 1 -1 Z M6 11 H8",
+  // clock
+  cron: "M1.5 7 a5.5 5.5 0 1 0 11 0 a5.5 5.5 0 1 0 -11 0 M7 3.5 V7 L9.5 8.5",
+  // four-point spark
+  ml: "M7 1.5 L8.4 5.6 L12.5 7 L8.4 8.4 L7 12.5 L5.6 8.4 L1.5 7 L5.6 5.6 Z",
+  // padlock
+  secret: "M3 6.5 H11 V13 H3 Z M4.5 6.5 V4.5 a2.5 2.5 0 0 1 5 0 V6.5",
+  // three sliders
+  config: "M1.5 3.5 H12.5 M1.5 7 H12.5 M1.5 10.5 H12.5 M4.5 2 V5 M9.5 5.5 V8.5 M6 9 V12",
+  // replica set: two overlapping squares
+  deployment: "M1.5 5 H9 V12.5 H1.5 Z M4 5 V2.5 H11.5 V10 H9",
+  // arrow into a door
+  ingress: "M1.5 7 H8 M5.5 4.5 L8 7 L5.5 9.5 M10 1.5 H12.5 V12.5 H10",
+  // two rack slabs
+  node: "M2 2 H12 V6 H2 Z M2 8 H12 V12 H2 Z M4.5 4 H6.5 M4.5 10 H6.5",
+  // folder tab
+  namespace: "M1.5 3.5 H5.5 L7 5 H12.5 V12 H1.5 Z",
+  box: "M2 2 H12 V12 H2 Z"
 };
-var pe = (e, n, t) => hn(e, n + "" , t);
-var z = {};
-fn(z, { Graph: () => p, alg: () => R, json: () => ye, version: () => pn });
-var bn = Object.defineProperty;
-var Le = (e, n) => {
-  for (var t in n) bn(e, t, { get: n[t], enumerable: true });
+var ALIAS = {
+  function: "function",
+  lambda: "function",
+  bucket: "bucket",
+  s3: "bucket",
+  blob: "bucket",
+  object: "bucket",
+  queue: "queue",
+  sqs: "queue",
+  mq: "queue",
+  broker: "queue",
+  rabbitmq: "queue",
+  topic: "topic",
+  sns: "topic",
+  kafka: "topic",
+  kinesis: "topic",
+  stream: "topic",
+  cache: "cache",
+  redis: "cache",
+  memcached: "cache",
+  db: "db",
+  database: "db",
+  store: "db",
+  postgres: "db",
+  mysql: "db",
+  mongo: "db",
+  mongodb: "db",
+  dynamo: "db",
+  cdn: "cdn",
+  lb: "lb",
+  gateway: "gateway",
+  proxy: "gateway",
+  pod: "pod",
+  cluster: "cluster",
+  user: "user",
+  person: "user",
+  actor: "user",
+  browser: "browser",
+  web: "browser",
+  mobile: "mobile",
+  cron: "cron",
+  scheduler: "cron",
+  job: "cron",
+  cronjob: "cron",
+  ml: "ml",
+  model: "ml",
+  llm: "ml",
+  agent: "ml",
+  ai: "ml",
+  secret: "secret",
+  secrets: "secret",
+  vault: "secret",
+  kms: "secret",
+  config: "config",
+  configmap: "config",
+  settings: "config",
+  deployment: "deployment",
+  ingress: "ingress",
+  node: "node",
+  vm: "node",
+  server: "node",
+  host: "node",
+  namespace: "namespace"
 };
-var p = class {
-  constructor(e) {
-    this._isDirected = true, this._isMultigraph = false, this._isCompound = false, this._nodes = {}, this._in = {}, this._preds = {}, this._out = {}, this._sucs = {}, this._edgeObjs = {}, this._edgeLabels = {}, this._nodeCount = 0, this._edgeCount = 0, this._defaultNodeLabelFn = () => {
-    }, this._defaultEdgeLabelFn = () => {
-    }, e && (this._isDirected = "directed" in e ? e.directed : true, this._isMultigraph = "multigraph" in e ? e.multigraph : false, this._isCompound = "compound" in e ? e.compound : false), this._isCompound && (this._parent = {}, this._children = {}, this._children["\0"] = {});
-  }
-  isDirected() {
-    return this._isDirected;
-  }
-  isMultigraph() {
-    return this._isMultigraph;
-  }
-  isCompound() {
-    return this._isCompound;
-  }
-  setGraph(e) {
-    return this._label = e, this;
-  }
-  graph() {
-    return this._label;
-  }
-  setDefaultNodeLabel(e) {
-    return typeof e != "function" ? this._defaultNodeLabelFn = () => e : this._defaultNodeLabelFn = e, this;
+function glyphNameFor(kind) {
+  return ALIAS[(kind ?? "").trim().toLowerCase()] ?? GENERIC_BOX;
+}
+function hasGlyph(kind) {
+  return (kind ?? "").trim().toLowerCase() in ALIAS;
+}
+function cloudGlyph(kind, x2, y, c = "var(--muted)") {
+  const d = PATHS[glyphNameFor(kind)];
+  return `<path d="${d}" transform="translate(${x2} ${y})" fill="none" stroke="${c}" stroke-width="1.3" stroke-linecap="round" stroke-linejoin="round"/>`;
+}
+
+// src/svg/blockStyle.ts
+var KNOWN_NODE_KINDS = [
+  "client",
+  "service",
+  "microservice",
+  "compute",
+  "container",
+  "data",
+  "store",
+  "db",
+  "database",
+  "postgres",
+  "mysql",
+  "mongo",
+  "mongodb",
+  "dynamo",
+  "bucket",
+  "blob",
+  "object",
+  "s3",
+  "queue",
+  "mq",
+  "broker",
+  "sqs",
+  "rabbitmq",
+  "cache",
+  "redis",
+  "memcached",
+  "gateway",
+  "lb",
+  "proxy",
+  "function",
+  "lambda",
+  "cdn",
+  "external",
+  "producer",
+  "topic",
+  "consumer",
+  "context",
+  "firewall",
+  "waf",
+  "shield",
+  "dns",
+  "auth",
+  "identity",
+  "idp",
+  "iam",
+  "oauth",
+  "sso",
+  "monitor",
+  "observability",
+  "metrics",
+  "logs",
+  "tracing",
+  "apm",
+  "scheduler",
+  "cron",
+  "job",
+  "stream",
+  "kafka",
+  "kinesis",
+  "warehouse",
+  "lake",
+  "analytics",
+  "bi",
+  "search",
+  "index",
+  "elasticsearch",
+  "opensearch",
+  "registry",
+  "ci",
+  "cicd",
+  "pipeline",
+  "git",
+  "repo",
+  "scm",
+  "device",
+  "iot",
+  "email",
+  "sms",
+  "config",
+  "settings",
+  "ml",
+  "model",
+  "llm",
+  "agent",
+  "ai",
+  "user",
+  "person",
+  "actor",
+  "browser",
+  "web",
+  "mobile",
+  "vm",
+  "server",
+  "host",
+  "secrets",
+  "vault",
+  "kms",
+  "notification",
+  "webhook",
+  "worker",
+  "etl",
+  "shard",
+  "shards",
+  "sharded",
+  "replica",
+  "replicas",
+  "replicaset",
+  "users",
+  "crowd",
+  "region",
+  "geo",
+  "globe",
+  // `preset: k8s` vocabulary (namespaces are groups; these are the node kinds).
+  "deployment",
+  "pod",
+  "ingress",
+  "configmap",
+  "secret",
+  "cronjob",
+  "node",
+  "namespace",
+  "cluster",
+  "sns"
+];
+var SKIN = {};
+var def = (kinds, skin) => {
+  for (const k2 of kinds) SKIN[k2] = skin;
+};
+var primary = (chip3) => ({ chip: chip3, primary: true, fill: "paper", dashed: false });
+var secondary = (chip3) => ({ chip: chip3, primary: false, fill: "paper-2", dashed: false });
+var external = (chip3) => ({ chip: chip3, primary: true, fill: "paper", dashed: true });
+def(["client", "user", "person", "actor", "users", "crowd", "browser", "web", "mobile", "device", "iot"], primary("CLIENT"));
+def(["service", "microservice", "compute", "container", "worker", "etl"], primary("SVC"));
+def(["data"], primary("DATA"));
+def(["store", "db", "database", "postgres", "mysql", "mongo", "mongodb", "dynamo"], secondary("DB"));
+def(["shard", "shards", "sharded", "replica", "replicas", "replicaset"], secondary("DB"));
+def(["bucket", "blob", "object", "s3"], secondary("BUCKET"));
+def(["warehouse", "lake"], secondary("WAREHOUSE"));
+def(["queue", "mq", "broker", "sqs", "rabbitmq"], secondary("QUEUE"));
+def(["topic"], secondary("TOPIC"));
+def(["stream", "kafka", "kinesis"], secondary("BUS"));
+def(["cache", "redis", "memcached"], secondary("CACHE"));
+def(["search", "index", "elasticsearch", "opensearch"], secondary("SEARCH"));
+def(["registry"], secondary("REGISTRY"));
+def(["gateway", "proxy"], primary("GATEWAY"));
+def(["lb"], primary("LB"));
+def(["function", "lambda"], primary("FN"));
+def(["cdn"], external("EDGE"));
+def(["external"], external("EXT"));
+def(["producer"], primary("PRODUCER"));
+def(["consumer"], primary("CONSUMER"));
+def(["context"], primary("CONTEXT"));
+def(["firewall", "waf", "shield"], primary("WAF"));
+def(["dns"], external("DNS"));
+def(["auth", "identity", "idp", "iam", "oauth", "sso"], primary("AUTH"));
+def(["monitor", "observability", "metrics", "logs", "tracing", "apm"], primary("OBS"));
+def(["scheduler", "cron", "job"], primary("CRON"));
+def(["analytics", "bi"], primary("ANALYTICS"));
+def(["ci", "cicd", "pipeline"], primary("CI"));
+def(["git", "repo", "scm"], secondary("GIT"));
+def(["email", "sms"], external("EMAIL"));
+def(["config", "settings"], secondary("CONFIG"));
+def(["ml", "model", "llm", "agent", "ai"], primary("AI"));
+def(["vm", "server", "host"], primary("HOST"));
+def(["secrets", "vault", "kms"], secondary("SECRETS"));
+def(["notification", "webhook"], external("WEBHOOK"));
+def(["region", "geo", "globe"], external("REGION"));
+def(["deployment"], primary("DEPLOY"));
+def(["pod"], primary("POD"));
+def(["ingress"], primary("INGRESS"));
+def(["configmap"], secondary("CONFIG"));
+def(["secret"], secondary("SECRETS"));
+def(["cronjob"], primary("CRON"));
+def(["node"], primary("NODE"));
+def(["namespace"], secondary("NS"));
+def(["cluster"], primary("CLUSTER"));
+def(["sns"], secondary("TOPIC"));
+function nodeSkin(kind) {
+  const k2 = (kind ?? "").trim().toLowerCase();
+  if (k2 === "") return { chip: "", primary: true, fill: "paper", dashed: false };
+  return SKIN[k2] ?? primary(k2.toUpperCase());
+}
+function skinFill(sk, accent = false) {
+  if (accent) return "var(--accent-tint)";
+  return sk.fill === "paper-2" ? "var(--paper-2)" : "var(--paper)";
+}
+function nodeGlyph(kind, x2, y, c) {
+  const k2 = (kind ?? "").toLowerCase();
+  if (k2 === "store" || k2 === "db" || k2 === "database" || k2 === "postgres" || k2 === "mysql" || k2 === "mongo" || k2 === "mongodb" || k2 === "dynamo") {
+    return `<g stroke="${c}" stroke-width="1.3" fill="none"><ellipse cx="${x2 + 8}" cy="${y + 3}" rx="7" ry="3"/><path d="M${x2 + 1} ${y + 3} V ${y + 13}"/><path d="M${x2 + 15} ${y + 3} V ${y + 13}"/><path d="M${x2 + 1} ${y + 13} a 7 3 0 0 0 14 0"/></g>`;
   }
-  nodeCount() {
-    return this._nodeCount;
+  if (k2 === "bucket" || k2 === "blob" || k2 === "object" || k2 === "s3") {
+    return `<g stroke="${c}" stroke-width="1.3" fill="none"><ellipse cx="${x2 + 8}" cy="${y + 3}" rx="7" ry="2.5"/><path d="M${x2 + 1.5} ${y + 3} L ${x2 + 3.5} ${y + 14} L ${x2 + 12.5} ${y + 14} L ${x2 + 14.5} ${y + 3}"/></g>`;
   }
-  nodes() {
-    return Object.keys(this._nodes);
+  if (k2 === "queue" || k2 === "topic" || k2 === "mq" || k2 === "broker" || k2 === "sqs" || k2 === "rabbitmq") {
+    return `<g stroke="${c}" stroke-width="1.6"><path d="M${x2 + 2} ${y + 1} V ${y + 14}"/><path d="M${x2 + 8} ${y + 1} V ${y + 14}"/><path d="M${x2 + 14} ${y + 1} V ${y + 14}"/></g>`;
   }
-  sources() {
-    return this.nodes().filter((e) => Object.keys(this._in[e]).length === 0);
+  if (k2 === "firewall" || k2 === "waf" || k2 === "shield") {
+    return `<path d="M${x2 + 8} ${y} L ${x2 + 15} ${y + 3} V ${y + 9} Q ${x2 + 15} ${y + 14} ${x2 + 8} ${y + 16} Q ${x2 + 1} ${y + 14} ${x2 + 1} ${y + 9} V ${y + 3} Z" fill="none" stroke="${c}" stroke-width="1.3"/>`;
   }
-  sinks() {
-    return this.nodes().filter((e) => Object.keys(this._out[e]).length === 0);
+  if (k2 === "dns") {
+    return `<g stroke="${c}" stroke-width="1.2" fill="none"><circle cx="${x2 + 8}" cy="${y + 8}" r="7"/><ellipse cx="${x2 + 8}" cy="${y + 8}" rx="3" ry="7"/><path d="M${x2 + 1.5} ${y + 8} H ${x2 + 14.5}"/></g>`;
   }
-  setNodes(e, n) {
-    return e.forEach((t) => {
-      n !== void 0 ? this.setNode(t, n) : this.setNode(t);
-    }), this;
+  if (k2 === "auth" || k2 === "identity" || k2 === "idp" || k2 === "iam" || k2 === "oauth" || k2 === "sso") {
+    return `<g stroke="${c}" stroke-width="1.4" fill="none"><circle cx="${x2 + 5}" cy="${y + 8}" r="3.5"/><path d="M${x2 + 8.5} ${y + 8} H ${x2 + 15} M${x2 + 12.5} ${y + 8} V ${y + 11.5} M${x2 + 15} ${y + 8} V ${y + 10.5}"/></g>`;
   }
-  setNode(e, n) {
-    return e in this._nodes ? (arguments.length > 1 && (this._nodes[e] = n), this) : (this._nodes[e] = arguments.length > 1 ? n : this._defaultNodeLabelFn(e), this._isCompound && (this._parent[e] = "\0", this._children[e] = {}, this._children["\0"][e] = true), this._in[e] = {}, this._preds[e] = {}, this._out[e] = {}, this._sucs[e] = {}, ++this._nodeCount, this);
+  if (k2 === "monitor" || k2 === "observability" || k2 === "metrics" || k2 === "logs" || k2 === "tracing" || k2 === "apm") {
+    return `<path d="M${x2} ${y + 9} H ${x2 + 4} L ${x2 + 6.5} ${y + 3} L ${x2 + 9.5} ${y + 13} L ${x2 + 12} ${y + 9} H ${x2 + 16}" fill="none" stroke="${c}" stroke-width="1.5" stroke-linejoin="round"/>`;
   }
-  node(e) {
-    return this._nodes[e];
+  if (k2 === "scheduler" || k2 === "cron" || k2 === "job") {
+    return `<g stroke="${c}" stroke-width="1.3" fill="none"><circle cx="${x2 + 8}" cy="${y + 8}" r="7"/><path d="M${x2 + 8} ${y + 4} V ${y + 8} L ${x2 + 11.5} ${y + 10}"/></g>`;
   }
-  hasNode(e) {
-    return e in this._nodes;
+  if (k2 === "stream" || k2 === "kafka" || k2 === "kinesis") {
+    const wave = (dy) => `<path d="M${x2 + 1} ${y + 4 + dy} q 3.5 -3 7 0 t 7 0" fill="none" stroke="${c}" stroke-width="1.4"/>`;
+    return `<g>${wave(0)}${wave(4.5)}${wave(9)}</g>`;
   }
-  removeNode(e) {
-    if (e in this._nodes) {
-      let n = (t) => this.removeEdge(this._edgeObjs[t]);
-      delete this._nodes[e], this._isCompound && (this._removeFromParentsChildList(e), delete this._parent[e], this.children(e).forEach((t) => {
-        this.setParent(t);
-      }), delete this._children[e]), Object.keys(this._in[e]).forEach(n), delete this._in[e], delete this._preds[e], Object.keys(this._out[e]).forEach(n), delete this._out[e], delete this._sucs[e], --this._nodeCount;
-    }
-    return this;
+  if (k2 === "warehouse" || k2 === "lake") {
+    return `<g stroke="${c}" stroke-width="1.3" fill="none"><ellipse cx="${x2 + 8}" cy="${y + 3}" rx="7" ry="3"/><path d="M${x2 + 1} ${y + 3} V ${y + 13}"/><path d="M${x2 + 15} ${y + 3} V ${y + 13}"/><path d="M${x2 + 1} ${y + 8} a 7 3 0 0 0 14 0"/><path d="M${x2 + 1} ${y + 13} a 7 3 0 0 0 14 0"/></g>`;
   }
-  setParent(e, n) {
-    if (!this._isCompound) throw new Error("Cannot set parent in a non-compound graph");
-    if (n === void 0) n = "\0";
-    else {
-      n += "";
-      for (let t = n; t !== void 0; t = this.parent(t)) if (t === e) throw new Error("Setting " + n + " as parent of " + e + " would create a cycle");
-      this.setNode(n);
-    }
-    return this.setNode(e), this._removeFromParentsChildList(e), this._parent[e] = n, this._children[n][e] = true, this;
+  if (k2 === "search" || k2 === "index") {
+    return `<g stroke="${c}" stroke-width="1.4" fill="none"><circle cx="${x2 + 6.5}" cy="${y + 6.5}" r="5"/><path d="M${x2 + 10.5} ${y + 10.5} L ${x2 + 15} ${y + 15}"/></g>`;
   }
-  parent(e) {
-    if (this._isCompound) {
-      let n = this._parent[e];
-      if (n !== "\0") return n;
-    }
+  if (k2 === "ml" || k2 === "model" || k2 === "llm" || k2 === "agent" || k2 === "ai") {
+    return `<path d="M${x2 + 8} ${y + 1} L ${x2 + 9.8} ${y + 6.2} L ${x2 + 15} ${y + 8} L ${x2 + 9.8} ${y + 9.8} L ${x2 + 8} ${y + 15} L ${x2 + 6.2} ${y + 9.8} L ${x2 + 1} ${y + 8} L ${x2 + 6.2} ${y + 6.2} Z" fill="${c}"/>`;
   }
-  children(e = "\0") {
-    if (this._isCompound) {
-      let n = this._children[e];
-      if (n) return Object.keys(n);
-    } else {
-      if (e === "\0") return this.nodes();
-      if (this.hasNode(e)) return [];
-    }
-    return [];
+  if (k2 === "user" || k2 === "person" || k2 === "actor") {
+    return `<g fill="${c}"><circle cx="${x2 + 8}" cy="${y + 4.5}" r="3.5"/><path d="M ${x2 + 2} ${y + 15} a 6 6.5 0 0 1 12 0 z"/></g>`;
   }
-  predecessors(e) {
-    let n = this._preds[e];
-    if (n) return Object.keys(n);
+  if (k2 === "browser" || k2 === "web") {
+    return `<g stroke="${c}" stroke-width="1.3" fill="none"><rect x="${x2 + 1}" y="${y + 2}" width="14" height="12" rx="2"/><path d="M${x2 + 1} ${y + 6} H ${x2 + 15}"/></g>`;
   }
-  successors(e) {
-    let n = this._sucs[e];
-    if (n) return Object.keys(n);
+  if (k2 === "mobile") {
+    return `<g stroke="${c}" stroke-width="1.3" fill="none"><rect x="${x2 + 4}" y="${y + 1}" width="8" height="14" rx="2"/><path d="M${x2 + 7} ${y + 12.5} H ${x2 + 9}"/></g>`;
   }
-  neighbors(e) {
-    let n = this.predecessors(e);
-    if (n) {
-      let t = new Set(n);
-      for (let r5 of this.successors(e)) t.add(r5);
-      return Array.from(t.values());
-    }
+  if (k2 === "vm" || k2 === "server" || k2 === "host") {
+    return `<g stroke="${c}" stroke-width="1.3" fill="none"><rect x="${x2 + 2}" y="${y + 2}" width="12" height="5" rx="1.2"/><rect x="${x2 + 2}" y="${y + 9}" width="12" height="5" rx="1.2"/><path d="M${x2 + 4.5} ${y + 4.5} H ${x2 + 7} M${x2 + 4.5} ${y + 11.5} H ${x2 + 7}"/></g>`;
   }
-  isLeaf(e) {
-    let n;
-    return this.isDirected() ? n = this.successors(e) : n = this.neighbors(e), n.length === 0;
+  if (k2 === "secrets" || k2 === "vault" || k2 === "kms") {
+    return `<g stroke="${c}" stroke-width="1.3" fill="none"><rect x="${x2 + 3}" y="${y + 7}" width="10" height="8" rx="1.5"/><path d="M${x2 + 5} ${y + 7} V ${y + 5} a 3 3 0 0 1 6 0 V ${y + 7}"/></g>`;
   }
-  filterNodes(e) {
-    let n = new this.constructor({ directed: this._isDirected, multigraph: this._isMultigraph, compound: this._isCompound });
-    n.setGraph(this.graph()), Object.entries(this._nodes).forEach(([o, i]) => {
-      e(o) && n.setNode(o, i);
-    }), Object.values(this._edgeObjs).forEach((o) => {
-      n.hasNode(o.v) && n.hasNode(o.w) && n.setEdge(o, this.edge(o));
-    });
-    let t = {}, r5 = (o) => {
-      let i = this.parent(o);
-      return !i || n.hasNode(i) ? (t[o] = i != null ? i : void 0, i != null ? i : void 0) : i in t ? t[i] : r5(i);
-    };
-    return this._isCompound && n.nodes().forEach((o) => n.setParent(o, r5(o))), n;
+  if (k2 === "notification" || k2 === "webhook") {
+    return `<g stroke="${c}" stroke-width="1.3" fill="none"><path d="M${x2 + 3} ${y + 11} a 5 5 0 0 1 1.6 -3.6 V ${y + 5} a 3.4 3.4 0 0 1 6.8 0 v 2.4 a 5 5 0 0 1 1.6 3.6 z"/><path d="M${x2 + 6.5} ${y + 13.5} a 1.5 1.5 0 0 0 3 0"/></g>`;
   }
-  setDefaultEdgeLabel(e) {
-    return typeof e != "function" ? this._defaultEdgeLabelFn = () => e : this._defaultEdgeLabelFn = e, this;
+  if (k2 === "email" || k2 === "sms") {
+    return `<g stroke="${c}" stroke-width="1.3" fill="none"><rect x="${x2 + 1}" y="${y + 3}" width="14" height="10" rx="1.5"/><path d="M${x2 + 1.5} ${y + 4} L ${x2 + 8} ${y + 9} L ${x2 + 14.5} ${y + 4}"/></g>`;
   }
-  edgeCount() {
-    return this._edgeCount;
+  if (k2 === "registry") {
+    return `<g stroke="${c}" stroke-width="1.2" fill="none"><rect x="${x2 + 1}" y="${y + 8}" width="6" height="6" rx="1"/><rect x="${x2 + 9}" y="${y + 8}" width="6" height="6" rx="1"/><rect x="${x2 + 5}" y="${y + 1}" width="6" height="6" rx="1"/></g>`;
   }
-  edges() {
-    return Object.values(this._edgeObjs);
+  if (k2 === "ci" || k2 === "cicd" || k2 === "pipeline") {
+    return `<g stroke="${c}" stroke-width="1.3" fill="none"><circle cx="${x2 + 8}" cy="${y + 8}" r="7"/><path d="M${x2 + 6} ${y + 5} L ${x2 + 11.5} ${y + 8} L ${x2 + 6} ${y + 11} Z" fill="${c}" stroke="none"/></g>`;
   }
-  setPath(e, n) {
-    return e.reduce((t, r5) => (n !== void 0 ? this.setEdge(t, r5, n) : this.setEdge(t, r5), r5)), this;
+  if (k2 === "git" || k2 === "repo" || k2 === "scm") {
+    return `<g stroke="${c}" stroke-width="1.3" fill="none"><circle cx="${x2 + 4}" cy="${y + 3.5}" r="2.5"/><circle cx="${x2 + 4}" cy="${y + 12.5}" r="2.5"/><circle cx="${x2 + 12}" cy="${y + 6}" r="2.5"/><path d="M${x2 + 4} ${y + 6} V ${y + 10} M${x2 + 4} ${y + 8} q 0 -2 3 -2 h 2.5"/></g>`;
   }
-  setEdge(e, n, t, r5) {
-    let o, i, s, a, d = false;
-    typeof e == "object" && e !== null && "v" in e ? (o = e.v, i = e.w, s = e.name, arguments.length === 2 && (a = n, d = true)) : (o = e, i = n, s = r5, arguments.length > 2 && (a = t, d = true)), o = "" + o, i = "" + i, s !== void 0 && (s = "" + s);
-    let l = C(this._isDirected, o, i, s);
-    if (l in this._edgeLabels) return d && (this._edgeLabels[l] = a), this;
-    if (s !== void 0 && !this._isMultigraph) throw new Error("Cannot set a named edge when isMultigraph = false");
-    this.setNode(o), this.setNode(i), this._edgeLabels[l] = d ? a : this._defaultEdgeLabelFn(o, i, s);
-    let u = gn(this._isDirected, o, i, s);
-    return o = u.v, i = u.w, Object.freeze(u), this._edgeObjs[l] = u, me(this._preds[i], o), me(this._sucs[o], i), this._in[i][l] = u, this._out[o][l] = u, this._edgeCount++, this;
+  if (k2 === "device" || k2 === "iot") {
+    return `<g stroke="${c}" stroke-width="1.2" fill="none"><rect x="${x2 + 4}" y="${y + 4}" width="8" height="8" rx="1.5"/><path d="M${x2 + 6} ${y + 4} V ${y + 1} M${x2 + 10} ${y + 4} V ${y + 1} M${x2 + 6} ${y + 15} V ${y + 12} M${x2 + 10} ${y + 15} V ${y + 12} M${x2 + 4} ${y + 6} H ${x2 + 1} M${x2 + 4} ${y + 10} H ${x2 + 1} M${x2 + 15} ${y + 6} H ${x2 + 12} M${x2 + 15} ${y + 10} H ${x2 + 12}"/></g>`;
   }
-  edge(e, n, t) {
-    let r5 = arguments.length === 1 ? Y(this._isDirected, e) : C(this._isDirected, e, n, t);
-    return this._edgeLabels[r5];
+  if (k2 === "analytics" || k2 === "bi") {
+    return `<g fill="${c}"><rect x="${x2 + 1}" y="${y + 9}" width="3.4" height="6" rx="0.8"/><rect x="${x2 + 6.3}" y="${y + 5}" width="3.4" height="10" rx="0.8"/><rect x="${x2 + 11.6}" y="${y + 1}" width="3.4" height="14" rx="0.8"/></g>`;
   }
-  edgeAsObj(e, n, t) {
-    let r5 = arguments.length === 1 ? this.edge(e) : this.edge(e, n, t);
-    return typeof r5 != "object" ? { label: r5 } : r5;
+  if (k2 === "config" || k2 === "settings") {
+    return `<g stroke="${c}" stroke-width="1.3" fill="none"><circle cx="${x2 + 8}" cy="${y + 8}" r="4"/><path d="M${x2 + 8} ${y + 1} V ${y + 3.5} M${x2 + 8} ${y + 12.5} V ${y + 15} M${x2 + 1} ${y + 8} H ${x2 + 3.5} M${x2 + 12.5} ${y + 8} H ${x2 + 15} M${x2 + 3} ${y + 3} L ${x2 + 5} ${y + 5} M${x2 + 11} ${y + 11} L ${x2 + 13} ${y + 13} M${x2 + 13} ${y + 3} L ${x2 + 11} ${y + 5} M${x2 + 5} ${y + 11} L ${x2 + 3} ${y + 13}"/></g>`;
   }
-  hasEdge(e, n, t) {
-    return (arguments.length === 1 ? Y(this._isDirected, e) : C(this._isDirected, e, n, t)) in this._edgeLabels;
+  if (k2 === "cache" || k2 === "redis" || k2 === "memcached") {
+    const slab = (dy) => `<path d="M${x2 + 1} ${y + 5 + dy} L${x2 + 8} ${y + 2 + dy} L${x2 + 15} ${y + 5 + dy} L${x2 + 8} ${y + 8 + dy} Z" fill="none" stroke="${c}" stroke-width="1.2"/>`;
+    return `<g>${slab(0)}${slab(3.5)}${slab(7)}</g>`;
   }
-  removeEdge(e, n, t) {
-    let r5 = arguments.length === 1 ? Y(this._isDirected, e) : C(this._isDirected, e, n, t), o = this._edgeObjs[r5];
-    if (o) {
-      let i = o.v, s = o.w;
-      delete this._edgeLabels[r5], delete this._edgeObjs[r5], Ee(this._preds[s], i), Ee(this._sucs[i], s), delete this._in[s][r5], delete this._out[i][r5], this._edgeCount--;
-    }
-    return this;
+  if (k2 === "function" || k2 === "lambda") {
+    return `<text x="${x2 + 7}" y="${y + 14}" font-family="Georgia, serif" font-size="17" font-style="italic" font-weight="700" fill="${c}" text-anchor="middle">\u0192</text>`;
   }
-  inEdges(e, n) {
-    return this.isDirected() ? this.filterEdges(this._in[e], e, n) : this.nodeEdges(e, n);
+  if (k2 === "cdn" || k2 === "external") {
+    return `<path d="M${x2 + 3} ${y + 13} a 4 4 0 0 1 0.5 -8 a 5 5 0 0 1 9.5 1.2 a 3 3 0 0 1 1 6.8 z" fill="none" stroke="${c}" stroke-width="1.3"/>`;
   }
-  outEdges(e, n) {
-    return this.isDirected() ? this.filterEdges(this._out[e], e, n) : this.nodeEdges(e, n);
+  if (k2 === "gateway" || k2 === "lb" || k2 === "proxy") {
+    return `<g stroke="${c}" stroke-width="1.5" fill="none"><path d="M${x2 + 2} ${y + 1} L ${x2 + 8} ${y + 7} L ${x2 + 2} ${y + 13}"/><path d="M${x2 + 8} ${y + 1} L ${x2 + 14} ${y + 7} L ${x2 + 8} ${y + 13}"/></g>`;
   }
-  nodeEdges(e, n) {
-    if (e in this._nodes) return this.filterEdges({ ...this._in[e], ...this._out[e] }, e, n);
+  if (k2 === "service" || k2 === "microservice" || k2 === "compute" || k2 === "container" || k2 === "worker" || k2 === "etl") {
+    return `<g stroke="${c}" stroke-width="1.3"><rect x="${x2 + 4}" y="${y + 1}" width="11" height="11" rx="1.5" fill="none"/><rect x="${x2 + 1}" y="${y + 4}" width="11" height="11" rx="1.5" fill="var(--paper)"/></g>`;
   }
-  _removeFromParentsChildList(e) {
-    delete this._children[this._parent[e]][e];
+  return hasGlyph(k2) ? cloudGlyph(k2, x2, y, c) : "";
+}
+var SKIN_EDGE = {
+  solid: { stroke: "var(--muted)", sw: 1.5, dash: "", marker: "skArrow", err: false },
+  dashed: { stroke: "var(--muted)", sw: 1.5, dash: "5 4", marker: "skOpen", err: false },
+  forbidden: { stroke: "var(--negative)", sw: 1.5, dash: "4 3", marker: "skErr", err: true },
+  error: { stroke: "var(--negative)", sw: 1.5, dash: "", marker: "skErr", err: true }
+};
+
+// ../../node_modules/.pnpm/@dagrejs+dagre@3.0.0/node_modules/@dagrejs/dagre/dist/dagre.esm.js
+var ge = Object.defineProperty;
+var hn = (e, n, t) => n in e ? ge(e, n, { enumerable: true, configurable: true, writable: true, value: t }) : e[n] = t;
+var fn = (e, n) => {
+  for (var t in n) ge(e, t, { get: n[t], enumerable: true });
+};
+var pe = (e, n, t) => hn(e, n + "" , t);
+var z = {};
+fn(z, { Graph: () => p, alg: () => R, json: () => ye, version: () => pn });
+var bn = Object.defineProperty;
+var Le = (e, n) => {
+  for (var t in n) bn(e, t, { get: n[t], enumerable: true });
+};
+var p = class {
+  constructor(e) {
+    this._isDirected = true, this._isMultigraph = false, this._isCompound = false, this._nodes = {}, this._in = {}, this._preds = {}, this._out = {}, this._sucs = {}, this._edgeObjs = {}, this._edgeLabels = {}, this._nodeCount = 0, this._edgeCount = 0, this._defaultNodeLabelFn = () => {
+    }, this._defaultEdgeLabelFn = () => {
+    }, e && (this._isDirected = "directed" in e ? e.directed : true, this._isMultigraph = "multigraph" in e ? e.multigraph : false, this._isCompound = "compound" in e ? e.compound : false), this._isCompound && (this._parent = {}, this._children = {}, this._children["\0"] = {});
   }
-  filterEdges(e, n, t) {
-    if (!e) return;
-    let r5 = Object.values(e);
-    return t ? r5.filter((o) => o.v === n && o.w === t || o.v === t && o.w === n) : r5;
+  isDirected() {
+    return this._isDirected;
   }
-};
-function me(e, n) {
-  e[n] ? e[n]++ : e[n] = 1;
-}
-function Ee(e, n) {
-  e[n] !== void 0 && !--e[n] && delete e[n];
-}
-function C(e, n, t, r5) {
-  let o = "" + n, i = "" + t;
-  if (!e && o > i) {
-    let s = o;
-    o = i, i = s;
+  isMultigraph() {
+    return this._isMultigraph;
   }
-  return o + "
" + i + "
" + (r5 === void 0 ? "\0" : r5);
-}
-function gn(e, n, t, r5) {
-  let o = "" + n, i = "" + t;
-  if (!e && o > i) {
-    let a = o;
-    o = i, i = a;
+  isCompound() {
+    return this._isCompound;
   }
-  let s = { v: o, w: i };
-  return r5 && (s.name = r5), s;
-}
-function Y(e, n) {
-  return C(e, n.v, n.w, n.name);
-}
-var pn = "4.0.1";
-var ye = {};
-Le(ye, { read: () => yn, write: () => mn });
-function mn(e) {
-  let n = { options: { directed: e.isDirected(), multigraph: e.isMultigraph(), compound: e.isCompound() }, nodes: En(e), edges: Ln(e) }, t = e.graph();
-  return t !== void 0 && (n.value = structuredClone(t)), n;
-}
-function En(e) {
-  return e.nodes().map((n) => {
-    let t = e.node(n), r5 = e.parent(n), o = { v: n };
-    return t !== void 0 && (o.value = t), r5 !== void 0 && (o.parent = r5), o;
-  });
-}
-function Ln(e) {
-  return e.edges().map((n) => {
-    let t = e.edge(n), r5 = { v: n.v, w: n.w };
-    return n.name !== void 0 && (r5.name = n.name), t !== void 0 && (r5.value = t), r5;
-  });
-}
-function yn(e) {
-  let n = new p(e.options);
-  return e.value !== void 0 && n.setGraph(e.value), e.nodes.forEach((t) => {
-    n.setNode(t.v, t.value), t.parent && n.setParent(t.v, t.parent);
-  }), e.edges.forEach((t) => {
-    n.setEdge({ v: t.v, w: t.w, name: t.name }, t.value);
-  }), n;
-}
-var R = {};
-Le(R, { CycleException: () => D, bellmanFord: () => we, components: () => Gn, dijkstra: () => F, dijkstraAll: () => _n, findCycles: () => xn, floydWarshall: () => On, isAcyclic: () => Cn, postorder: () => Pn, preorder: () => Mn, prim: () => jn, shortestPaths: () => Sn, tarjan: () => Ge, topsort: () => ke });
-var wn = () => 1;
-function we(e, n, t, r5) {
-  return Nn(e, String(n), t || wn, r5 || function(o) {
-    return e.outEdges(o);
-  });
-}
-function Nn(e, n, t, r5) {
-  let o = {}, i, s = 0, a = e.nodes(), d = function(c) {
-    let h = t(c);
-    o[c.v].distance + h < o[c.w].distance && (o[c.w] = { distance: o[c.v].distance + h, predecessor: c.v }, i = true);
-  }, l = function() {
-    a.forEach(function(c) {
-      r5(c).forEach(function(h) {
-        let f = h.v === c ? h.v : h.w, g = f === h.v ? h.w : h.v;
-        d({ v: f, w: g });
-      });
-    });
-  };
-  a.forEach(function(c) {
-    let h = c === n ? 0 : Number.POSITIVE_INFINITY;
-    o[c] = { distance: h, predecessor: "" };
-  });
-  let u = a.length;
-  for (let c = 1; c < u && (i = false, s++, l(), !!i); c++) ;
-  if (s === u - 1 && (i = false, l(), i)) throw new Error("The graph contains a negative weight cycle");
-  return o;
-}
-function Gn(e) {
-  let n = {}, t = [], r5;
-  function o(i) {
-    i in n || (n[i] = true, r5.push(i), e.successors(i).forEach(o), e.predecessors(i).forEach(o));
+  setGraph(e) {
+    return this._label = e, this;
   }
-  return e.nodes().forEach(function(i) {
-    r5 = [], o(i), r5.length && t.push(r5);
-  }), t;
-}
-var Ne = class {
-  constructor() {
-    this._arr = [], this._keyIndices = {};
+  graph() {
+    return this._label;
   }
-  size() {
-    return this._arr.length;
+  setDefaultNodeLabel(e) {
+    return typeof e != "function" ? this._defaultNodeLabelFn = () => e : this._defaultNodeLabelFn = e, this;
   }
-  keys() {
-    return this._arr.map((e) => e.key);
+  nodeCount() {
+    return this._nodeCount;
   }
-  has(e) {
-    return e in this._keyIndices;
+  nodes() {
+    return Object.keys(this._nodes);
   }
-  priority(e) {
-    let n = this._keyIndices[e];
-    if (n !== void 0) return this._arr[n].priority;
+  sources() {
+    return this.nodes().filter((e) => Object.keys(this._in[e]).length === 0);
   }
-  min() {
-    if (this.size() === 0) throw new Error("Queue underflow");
-    return this._arr[0].key;
+  sinks() {
+    return this.nodes().filter((e) => Object.keys(this._out[e]).length === 0);
   }
-  add(e, n) {
-    let t = this._keyIndices, r5 = String(e);
-    if (!(r5 in t)) {
-      let o = this._arr, i = o.length;
-      return t[r5] = i, o.push({ key: r5, priority: n }), this._decrease(i), true;
-    }
-    return false;
+  setNodes(e, n) {
+    return e.forEach((t) => {
+      n !== void 0 ? this.setNode(t, n) : this.setNode(t);
+    }), this;
   }
-  removeMin() {
-    this._swap(0, this._arr.length - 1);
-    let e = this._arr.pop();
-    return delete this._keyIndices[e.key], this._heapify(0), e.key;
+  setNode(e, n) {
+    return e in this._nodes ? (arguments.length > 1 && (this._nodes[e] = n), this) : (this._nodes[e] = arguments.length > 1 ? n : this._defaultNodeLabelFn(e), this._isCompound && (this._parent[e] = "\0", this._children[e] = {}, this._children["\0"][e] = true), this._in[e] = {}, this._preds[e] = {}, this._out[e] = {}, this._sucs[e] = {}, ++this._nodeCount, this);
   }
-  decrease(e, n) {
-    let t = this._keyIndices[e];
-    if (t === void 0) throw new Error(`Key not found: ${e}`);
-    let r5 = this._arr[t].priority;
-    if (n > r5) throw new Error(`New priority is greater than current priority. Key: ${e} Old: ${r5} New: ${n}`);
-    this._arr[t].priority = n, this._decrease(t);
+  node(e) {
+    return this._nodes[e];
   }
-  _heapify(e) {
-    let n = this._arr, t = 2 * e, r5 = t + 1, o = e;
-    t < n.length && (o = n[t].priority < n[o].priority ? t : o, r5 < n.length && (o = n[r5].priority < n[o].priority ? r5 : o), o !== e && (this._swap(e, o), this._heapify(o)));
+  hasNode(e) {
+    return e in this._nodes;
   }
-  _decrease(e) {
-    let n = this._arr, t = n[e].priority, r5;
-    for (; e !== 0 && (r5 = e >> 1, !(n[r5].priority < t)); ) this._swap(e, r5), e = r5;
+  removeNode(e) {
+    if (e in this._nodes) {
+      let n = (t) => this.removeEdge(this._edgeObjs[t]);
+      delete this._nodes[e], this._isCompound && (this._removeFromParentsChildList(e), delete this._parent[e], this.children(e).forEach((t) => {
+        this.setParent(t);
+      }), delete this._children[e]), Object.keys(this._in[e]).forEach(n), delete this._in[e], delete this._preds[e], Object.keys(this._out[e]).forEach(n), delete this._out[e], delete this._sucs[e], --this._nodeCount;
+    }
+    return this;
   }
-  _swap(e, n) {
-    let t = this._arr, r5 = this._keyIndices, o = t[e], i = t[n];
-    t[e] = i, t[n] = o, r5[i.key] = e, r5[o.key] = n;
+  setParent(e, n) {
+    if (!this._isCompound) throw new Error("Cannot set parent in a non-compound graph");
+    if (n === void 0) n = "\0";
+    else {
+      n += "";
+      for (let t = n; t !== void 0; t = this.parent(t)) if (t === e) throw new Error("Setting " + n + " as parent of " + e + " would create a cycle");
+      this.setNode(n);
+    }
+    return this.setNode(e), this._removeFromParentsChildList(e), this._parent[e] = n, this._children[n][e] = true, this;
   }
-};
-var kn = () => 1;
-function F(e, n, t, r5) {
-  let o = function(i) {
-    return e.outEdges(i);
-  };
-  return vn(e, String(n), t || kn, r5 || o);
-}
-function vn(e, n, t, r5) {
-  let o = {}, i = new Ne(), s, a, d = function(l) {
-    let u = l.v !== s ? l.v : l.w, c = o[u], h = t(l), f = a.distance + h;
-    if (h < 0) throw new Error("dijkstra does not allow negative edge weights. Bad edge: " + l + " Weight: " + h);
-    f < c.distance && (c.distance = f, c.predecessor = s, i.decrease(u, f));
-  };
-  for (e.nodes().forEach(function(l) {
-    let u = l === n ? 0 : Number.POSITIVE_INFINITY;
-    o[l] = { distance: u, predecessor: "" }, i.add(l, u);
-  }); i.size() > 0 && (s = i.removeMin(), a = o[s], a.distance !== Number.POSITIVE_INFINITY); ) r5(s).forEach(d);
-  return o;
-}
-function _n(e, n, t) {
-  return e.nodes().reduce(function(r5, o) {
-    return r5[o] = F(e, o, n, t), r5;
-  }, {});
-}
-function Ge(e) {
-  let n = 0, t = [], r5 = {}, o = [];
-  function i(s) {
-    let a = r5[s] = { onStack: true, lowlink: n, index: n++ };
-    if (t.push(s), e.successors(s).forEach(function(d) {
-      d in r5 ? r5[d].onStack && (a.lowlink = Math.min(a.lowlink, r5[d].index)) : (i(d), a.lowlink = Math.min(a.lowlink, r5[d].lowlink));
-    }), a.lowlink === a.index) {
-      let d = [], l;
-      do
-        l = t.pop(), r5[l].onStack = false, d.push(l);
-      while (s !== l);
-      o.push(d);
+  parent(e) {
+    if (this._isCompound) {
+      let n = this._parent[e];
+      if (n !== "\0") return n;
     }
   }
-  return e.nodes().forEach(function(s) {
-    s in r5 || i(s);
-  }), o;
-}
-function xn(e) {
-  return Ge(e).filter(function(n) {
-    return n.length > 1 || n.length === 1 && e.hasEdge(n[0], n[0]);
-  });
-}
-var Tn = () => 1;
-function On(e, n, t) {
-  return In(e, n || Tn, t || function(r5) {
-    return e.outEdges(r5);
-  });
-}
-function In(e, n, t) {
-  let r5 = {}, o = e.nodes();
-  return o.forEach(function(i) {
-    r5[i] = {}, r5[i][i] = { distance: 0, predecessor: "" }, o.forEach(function(s) {
-      i !== s && (r5[i][s] = { distance: Number.POSITIVE_INFINITY, predecessor: "" });
-    }), t(i).forEach(function(s) {
-      let a = s.v === i ? s.w : s.v, d = n(s);
-      r5[i][a] = { distance: d, predecessor: i };
-    });
-  }), o.forEach(function(i) {
-    let s = r5[i];
-    o.forEach(function(a) {
-      let d = r5[a];
-      o.forEach(function(l) {
-        let u = d[i], c = s[l], h = d[l], f = u.distance + c.distance;
-        f < h.distance && (h.distance = f, h.predecessor = c.predecessor);
-      });
+  children(e = "\0") {
+    if (this._isCompound) {
+      let n = this._children[e];
+      if (n) return Object.keys(n);
+    } else {
+      if (e === "\0") return this.nodes();
+      if (this.hasNode(e)) return [];
+    }
+    return [];
+  }
+  predecessors(e) {
+    let n = this._preds[e];
+    if (n) return Object.keys(n);
+  }
+  successors(e) {
+    let n = this._sucs[e];
+    if (n) return Object.keys(n);
+  }
+  neighbors(e) {
+    let n = this.predecessors(e);
+    if (n) {
+      let t = new Set(n);
+      for (let r5 of this.successors(e)) t.add(r5);
+      return Array.from(t.values());
+    }
+  }
+  isLeaf(e) {
+    let n;
+    return this.isDirected() ? n = this.successors(e) : n = this.neighbors(e), n.length === 0;
+  }
+  filterNodes(e) {
+    let n = new this.constructor({ directed: this._isDirected, multigraph: this._isMultigraph, compound: this._isCompound });
+    n.setGraph(this.graph()), Object.entries(this._nodes).forEach(([o, i]) => {
+      e(o) && n.setNode(o, i);
+    }), Object.values(this._edgeObjs).forEach((o) => {
+      n.hasNode(o.v) && n.hasNode(o.w) && n.setEdge(o, this.edge(o));
     });
-  }), r5;
-}
-var D = class extends Error {
-  constructor(...e) {
-    super(...e);
+    let t = {}, r5 = (o) => {
+      let i = this.parent(o);
+      return !i || n.hasNode(i) ? (t[o] = i != null ? i : void 0, i != null ? i : void 0) : i in t ? t[i] : r5(i);
+    };
+    return this._isCompound && n.nodes().forEach((o) => n.setParent(o, r5(o))), n;
   }
-};
-function ke(e) {
-  let n = {}, t = {}, r5 = [];
-  function o(i) {
-    if (i in t) throw new D();
-    i in n || (t[i] = true, n[i] = true, e.predecessors(i).forEach(o), delete t[i], r5.push(i));
+  setDefaultEdgeLabel(e) {
+    return typeof e != "function" ? this._defaultEdgeLabelFn = () => e : this._defaultEdgeLabelFn = e, this;
   }
-  if (e.sinks().forEach(o), Object.keys(n).length !== e.nodeCount()) throw new D();
-  return r5;
-}
-function Cn(e) {
-  try {
-    ke(e);
-  } catch (n) {
-    if (n instanceof D) return false;
-    throw n;
+  edgeCount() {
+    return this._edgeCount;
   }
-  return true;
-}
-function Rn(e, n, t, r5, o) {
-  Array.isArray(n) || (n = [n]);
-  let i = ((a) => {
-    var d;
-    return (d = e.isDirected() ? e.successors(a) : e.neighbors(a)) != null ? d : [];
-  }), s = {};
-  return n.forEach(function(a) {
-    if (!e.hasNode(a)) throw new Error("Graph does not have node: " + a);
-    o = ve(e, a, t === "post", s, i, r5, o);
-  }), o;
-}
-function ve(e, n, t, r5, o, i, s) {
-  return n in r5 || (r5[n] = true, t || (s = i(s, n)), o(n).forEach(function(a) {
-    s = ve(e, a, t, r5, o, i, s);
-  }), t && (s = i(s, n))), s;
-}
-function _e(e, n, t) {
-  return Rn(e, n, t, function(r5, o) {
-    return r5.push(o), r5;
-  }, []);
-}
-function Pn(e, n) {
-  return _e(e, n, "post");
-}
-function Mn(e, n) {
-  return _e(e, n, "pre");
-}
-function jn(e, n) {
-  let t = new p(), r5 = {}, o = new Ne(), i;
-  function s(d) {
-    let l = d.v === i ? d.w : d.v, u = o.priority(l);
-    if (u !== void 0) {
-      let c = n(d);
-      c < u && (r5[l] = i, o.decrease(l, c));
-    }
+  edges() {
+    return Object.values(this._edgeObjs);
   }
-  if (e.nodeCount() === 0) return t;
-  e.nodes().forEach(function(d) {
-    o.add(d, Number.POSITIVE_INFINITY), t.setNode(d);
-  }), o.decrease(e.nodes()[0], 0);
-  let a = false;
-  for (; o.size() > 0; ) {
-    if (i = o.removeMin(), i in r5) t.setEdge(i, r5[i]);
-    else {
-      if (a) throw new Error("Input graph is not connected: " + e);
-      a = true;
-    }
-    e.nodeEdges(i).forEach(s);
+  setPath(e, n) {
+    return e.reduce((t, r5) => (n !== void 0 ? this.setEdge(t, r5, n) : this.setEdge(t, r5), r5)), this;
   }
-  return t;
-}
-function Sn(e, n, t, r5) {
-  return Fn(e, n, t, r5 != null ? r5 : ((o) => {
-    let i = e.outEdges(o);
-    return i != null ? i : [];
-  }));
-}
-function Fn(e, n, t, r5) {
-  if (t === void 0) return F(e, n, t, r5);
-  let o = false, i = e.nodes();
-  for (let s = 0; s < i.length; s++) {
-    let a = r5(i[s]);
-    for (let d = 0; d < a.length; d++) {
-      let l = a[d], u = l.v === i[s] ? l.v : l.w, c = u === l.v ? l.w : l.v;
-      t({ v: u, w: c }) < 0 && (o = true);
+  setEdge(e, n, t, r5) {
+    let o, i, s, a, d = false;
+    typeof e == "object" && e !== null && "v" in e ? (o = e.v, i = e.w, s = e.name, arguments.length === 2 && (a = n, d = true)) : (o = e, i = n, s = r5, arguments.length > 2 && (a = t, d = true)), o = "" + o, i = "" + i, s !== void 0 && (s = "" + s);
+    let l = C(this._isDirected, o, i, s);
+    if (l in this._edgeLabels) return d && (this._edgeLabels[l] = a), this;
+    if (s !== void 0 && !this._isMultigraph) throw new Error("Cannot set a named edge when isMultigraph = false");
+    this.setNode(o), this.setNode(i), this._edgeLabels[l] = d ? a : this._defaultEdgeLabelFn(o, i, s);
+    let u = gn(this._isDirected, o, i, s);
+    return o = u.v, i = u.w, Object.freeze(u), this._edgeObjs[l] = u, me(this._preds[i], o), me(this._sucs[o], i), this._in[i][l] = u, this._out[o][l] = u, this._edgeCount++, this;
+  }
+  edge(e, n, t) {
+    let r5 = arguments.length === 1 ? Y(this._isDirected, e) : C(this._isDirected, e, n, t);
+    return this._edgeLabels[r5];
+  }
+  edgeAsObj(e, n, t) {
+    let r5 = arguments.length === 1 ? this.edge(e) : this.edge(e, n, t);
+    return typeof r5 != "object" ? { label: r5 } : r5;
+  }
+  hasEdge(e, n, t) {
+    return (arguments.length === 1 ? Y(this._isDirected, e) : C(this._isDirected, e, n, t)) in this._edgeLabels;
+  }
+  removeEdge(e, n, t) {
+    let r5 = arguments.length === 1 ? Y(this._isDirected, e) : C(this._isDirected, e, n, t), o = this._edgeObjs[r5];
+    if (o) {
+      let i = o.v, s = o.w;
+      delete this._edgeLabels[r5], delete this._edgeObjs[r5], Ee(this._preds[s], i), Ee(this._sucs[i], s), delete this._in[s][r5], delete this._out[i][r5], this._edgeCount--;
     }
-    if (o) return we(e, n, t, r5);
+    return this;
   }
-  return F(e, n, t, r5);
-}
-function w(e, n, t, r5) {
-  let o = r5;
-  for (; e.hasNode(o); ) o = j(r5);
-  return t.dummy = n, e.setNode(o, t), o;
-}
-function xe(e) {
-  let n = new p().setGraph(e.graph());
-  return e.nodes().forEach((t) => n.setNode(t, e.node(t))), e.edges().forEach((t) => {
-    let r5 = n.edge(t.v, t.w) || { weight: 0, minlen: 1 }, o = e.edge(t);
-    n.setEdge(t.v, t.w, { weight: r5.weight + o.weight, minlen: Math.max(r5.minlen, o.minlen) });
-  }), n;
-}
-function A(e) {
-  let n = new p({ multigraph: e.isMultigraph() }).setGraph(e.graph());
-  return e.nodes().forEach((t) => {
-    e.children(t).length || n.setNode(t, e.node(t));
-  }), e.edges().forEach((t) => {
-    n.setEdge(t, e.edge(t));
-  }), n;
-}
-function H(e, n) {
-  let t = e.x, r5 = e.y, o = n.x - t, i = n.y - r5, s = e.width / 2, a = e.height / 2;
-  if (!o && !i) throw new Error("Not possible to find intersection inside of the rectangle");
-  let d, l;
-  return Math.abs(i) * s > Math.abs(o) * a ? (i < 0 && (a = -a), d = a * o / i, l = a) : (o < 0 && (s = -s), d = s, l = s * i / o), { x: t + d, y: r5 + l };
-}
-function N(e) {
-  let n = k(X(e) + 1).map(() => []);
-  return e.nodes().forEach((t) => {
-    let r5 = e.node(t), o = r5.rank;
-    o !== void 0 && (n[o] || (n[o] = []), n[o][r5.order] = t);
-  }), n;
-}
-function Te(e) {
-  let n = e.nodes().map((r5) => {
-    let o = e.node(r5).rank;
-    return o === void 0 ? Number.MAX_VALUE : o;
-  }), t = L(Math.min, n);
-  e.nodes().forEach((r5) => {
-    let o = e.node(r5);
-    Object.hasOwn(o, "rank") && (o.rank -= t);
-  });
+  inEdges(e, n) {
+    return this.isDirected() ? this.filterEdges(this._in[e], e, n) : this.nodeEdges(e, n);
+  }
+  outEdges(e, n) {
+    return this.isDirected() ? this.filterEdges(this._out[e], e, n) : this.nodeEdges(e, n);
+  }
+  nodeEdges(e, n) {
+    if (e in this._nodes) return this.filterEdges({ ...this._in[e], ...this._out[e] }, e, n);
+  }
+  _removeFromParentsChildList(e) {
+    delete this._children[this._parent[e]][e];
+  }
+  filterEdges(e, n, t) {
+    if (!e) return;
+    let r5 = Object.values(e);
+    return t ? r5.filter((o) => o.v === n && o.w === t || o.v === t && o.w === n) : r5;
+  }
+};
+function me(e, n) {
+  e[n] ? e[n]++ : e[n] = 1;
 }
-function Oe(e) {
-  let n = e.nodes().map((s) => e.node(s).rank).filter((s) => s !== void 0), t = L(Math.min, n), r5 = [];
-  e.nodes().forEach((s) => {
-    let a = e.node(s).rank - t;
-    r5[a] || (r5[a] = []), r5[a].push(s);
-  });
-  let o = 0, i = e.graph().nodeRankFactor;
-  Array.from(r5).forEach((s, a) => {
-    s === void 0 && a % i !== 0 ? --o : s !== void 0 && o && s.forEach((d) => e.node(d).rank += o);
-  });
+function Ee(e, n) {
+  e[n] !== void 0 && !--e[n] && delete e[n];
 }
-function q(e, n, t, r5) {
-  let o = { width: 0, height: 0 };
-  return arguments.length >= 4 && (o.rank = t, o.order = r5), w(e, "border", o, n);
+function C(e, n, t, r5) {
+  let o = "" + n, i = "" + t;
+  if (!e && o > i) {
+    let s = o;
+    o = i, i = s;
+  }
+  return o + "
" + i + "
" + (r5 === void 0 ? "\0" : r5);
 }
-function Dn(e, n = Ie) {
-  let t = [];
-  for (let r5 = 0; r5 < e.length; r5 += n) {
-    let o = e.slice(r5, r5 + n);
-    t.push(o);
+function gn(e, n, t, r5) {
+  let o = "" + n, i = "" + t;
+  if (!e && o > i) {
+    let a = o;
+    o = i, i = a;
   }
-  return t;
+  let s = { v: o, w: i };
+  return r5 && (s.name = r5), s;
 }
-var Ie = 65535;
-function L(e, n) {
-  if (n.length > Ie) {
-    let t = Dn(n);
-    return e(...t.map((r5) => e(...r5)));
-  } else return e(...n);
+function Y(e, n) {
+  return C(e, n.v, n.w, n.name);
+}
+var pn = "4.0.1";
+var ye = {};
+Le(ye, { read: () => yn, write: () => mn });
+function mn(e) {
+  let n = { options: { directed: e.isDirected(), multigraph: e.isMultigraph(), compound: e.isCompound() }, nodes: En(e), edges: Ln(e) }, t = e.graph();
+  return t !== void 0 && (n.value = structuredClone(t)), n;
 }
-function X(e) {
-  let t = e.nodes().map((r5) => {
-    let o = e.node(r5).rank;
-    return o === void 0 ? Number.MIN_VALUE : o;
+function En(e) {
+  return e.nodes().map((n) => {
+    let t = e.node(n), r5 = e.parent(n), o = { v: n };
+    return t !== void 0 && (o.value = t), r5 !== void 0 && (o.parent = r5), o;
   });
-  return L(Math.max, t);
-}
-function Ce(e, n) {
-  let t = { lhs: [], rhs: [] };
-  return e.forEach((r5) => {
-    n(r5) ? t.lhs.push(r5) : t.rhs.push(r5);
-  }), t;
 }
-function P(e, n) {
-  let t = Date.now();
-  try {
-    return n();
-  } finally {
-    console.log(e + " time: " + (Date.now() - t) + "ms");
-  }
+function Ln(e) {
+  return e.edges().map((n) => {
+    let t = e.edge(n), r5 = { v: n.v, w: n.w };
+    return n.name !== void 0 && (r5.name = n.name), t !== void 0 && (r5.value = t), r5;
+  });
 }
-function M(e, n) {
-  return n();
+function yn(e) {
+  let n = new p(e.options);
+  return e.value !== void 0 && n.setGraph(e.value), e.nodes.forEach((t) => {
+    n.setNode(t.v, t.value), t.parent && n.setParent(t.v, t.parent);
+  }), e.edges.forEach((t) => {
+    n.setEdge({ v: t.v, w: t.w, name: t.name }, t.value);
+  }), n;
 }
-var An = 0;
-function j(e) {
-  let n = ++An;
-  return e + ("" + n);
+var R = {};
+Le(R, { CycleException: () => D, bellmanFord: () => we, components: () => Gn, dijkstra: () => F, dijkstraAll: () => _n, findCycles: () => xn, floydWarshall: () => On, isAcyclic: () => Cn, postorder: () => Pn, preorder: () => Mn, prim: () => jn, shortestPaths: () => Sn, tarjan: () => Ge, topsort: () => ke });
+var wn = () => 1;
+function we(e, n, t, r5) {
+  return Nn(e, String(n), t || wn, r5 || function(o) {
+    return e.outEdges(o);
+  });
 }
-function k(e, n, t = 1) {
-  n == null && (n = e, e = 0);
-  let r5 = (i) => i < n;
-  t < 0 && (r5 = (i) => n < i);
-  let o = [];
-  for (let i = e; r5(i); i += t) o.push(i);
+function Nn(e, n, t, r5) {
+  let o = {}, i, s = 0, a = e.nodes(), d = function(c) {
+    let h = t(c);
+    o[c.v].distance + h < o[c.w].distance && (o[c.w] = { distance: o[c.v].distance + h, predecessor: c.v }, i = true);
+  }, l = function() {
+    a.forEach(function(c) {
+      r5(c).forEach(function(h) {
+        let f = h.v === c ? h.v : h.w, g = f === h.v ? h.w : h.v;
+        d({ v: f, w: g });
+      });
+    });
+  };
+  a.forEach(function(c) {
+    let h = c === n ? 0 : Number.POSITIVE_INFINITY;
+    o[c] = { distance: h, predecessor: "" };
+  });
+  let u = a.length;
+  for (let c = 1; c < u && (i = false, s++, l(), !!i); c++) ;
+  if (s === u - 1 && (i = false, l(), i)) throw new Error("The graph contains a negative weight cycle");
   return o;
 }
-function T(e, n) {
-  let t = {};
-  for (let r5 of n) e[r5] !== void 0 && (t[r5] = e[r5]);
-  return t;
-}
-function O(e, n) {
-  let t;
-  return typeof n == "string" ? t = (r5) => r5[n] : t = n, Object.entries(e).reduce((r5, [o, i]) => (r5[o] = t(i, o), r5), {});
-}
-function Re(e, n) {
-  return e.reduce((t, r5, o) => (t[r5] = n[o], t), {});
+function Gn(e) {
+  let n = {}, t = [], r5;
+  function o(i) {
+    i in n || (n[i] = true, r5.push(i), e.successors(i).forEach(o), e.predecessors(i).forEach(o));
+  }
+  return e.nodes().forEach(function(i) {
+    r5 = [], o(i), r5.length && t.push(r5);
+  }), t;
 }
-var _ = "\0";
-var U = "3.0.0";
-var K = class {
+var Ne = class {
   constructor() {
-    pe(this, "_sentinel");
-    let n = {};
-    n._next = n._prev = n, this._sentinel = n;
+    this._arr = [], this._keyIndices = {};
   }
-  dequeue() {
-    let n = this._sentinel, t = n._prev;
-    if (t !== n) return Pe(t), t;
+  size() {
+    return this._arr.length;
   }
-  enqueue(n) {
-    let t = this._sentinel;
-    n._prev && n._next && Pe(n), n._next = t._next, t._next._prev = n, t._next = n, n._prev = t;
+  keys() {
+    return this._arr.map((e) => e.key);
   }
-  toString() {
-    let n = [], t = this._sentinel, r5 = t._prev;
-    for (; r5 !== t; ) n.push(JSON.stringify(r5, Vn)), r5 = r5._prev;
-    return "[" + n.join(", ") + "]";
+  has(e) {
+    return e in this._keyIndices;
+  }
+  priority(e) {
+    let n = this._keyIndices[e];
+    if (n !== void 0) return this._arr[n].priority;
+  }
+  min() {
+    if (this.size() === 0) throw new Error("Queue underflow");
+    return this._arr[0].key;
+  }
+  add(e, n) {
+    let t = this._keyIndices, r5 = String(e);
+    if (!(r5 in t)) {
+      let o = this._arr, i = o.length;
+      return t[r5] = i, o.push({ key: r5, priority: n }), this._decrease(i), true;
+    }
+    return false;
+  }
+  removeMin() {
+    this._swap(0, this._arr.length - 1);
+    let e = this._arr.pop();
+    return delete this._keyIndices[e.key], this._heapify(0), e.key;
+  }
+  decrease(e, n) {
+    let t = this._keyIndices[e];
+    if (t === void 0) throw new Error(`Key not found: ${e}`);
+    let r5 = this._arr[t].priority;
+    if (n > r5) throw new Error(`New priority is greater than current priority. Key: ${e} Old: ${r5} New: ${n}`);
+    this._arr[t].priority = n, this._decrease(t);
+  }
+  _heapify(e) {
+    let n = this._arr, t = 2 * e, r5 = t + 1, o = e;
+    t < n.length && (o = n[t].priority < n[o].priority ? t : o, r5 < n.length && (o = n[r5].priority < n[o].priority ? r5 : o), o !== e && (this._swap(e, o), this._heapify(o)));
+  }
+  _decrease(e) {
+    let n = this._arr, t = n[e].priority, r5;
+    for (; e !== 0 && (r5 = e >> 1, !(n[r5].priority < t)); ) this._swap(e, r5), e = r5;
+  }
+  _swap(e, n) {
+    let t = this._arr, r5 = this._keyIndices, o = t[e], i = t[n];
+    t[e] = i, t[n] = o, r5[i.key] = e, r5[o.key] = n;
   }
 };
-function Pe(e) {
-  e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
+var kn = () => 1;
+function F(e, n, t, r5) {
+  let o = function(i) {
+    return e.outEdges(i);
+  };
+  return vn(e, String(n), t || kn, r5 || o);
 }
-function Vn(e, n) {
-  if (e !== "_next" && e !== "_prev") return n;
+function vn(e, n, t, r5) {
+  let o = {}, i = new Ne(), s, a, d = function(l) {
+    let u = l.v !== s ? l.v : l.w, c = o[u], h = t(l), f = a.distance + h;
+    if (h < 0) throw new Error("dijkstra does not allow negative edge weights. Bad edge: " + l + " Weight: " + h);
+    f < c.distance && (c.distance = f, c.predecessor = s, i.decrease(u, f));
+  };
+  for (e.nodes().forEach(function(l) {
+    let u = l === n ? 0 : Number.POSITIVE_INFINITY;
+    o[l] = { distance: u, predecessor: "" }, i.add(l, u);
+  }); i.size() > 0 && (s = i.removeMin(), a = o[s], a.distance !== Number.POSITIVE_INFINITY); ) r5(s).forEach(d);
+  return o;
 }
-var Me = K;
-var Wn = () => 1;
-function Q(e, n) {
-  if (e.nodeCount() <= 1) return [];
-  let t = Yn(e, n || Wn);
-  return Bn(t.graph, t.buckets, t.zeroIdx).flatMap((o) => e.outEdges(o.v, o.w) || []);
+function _n(e, n, t) {
+  return e.nodes().reduce(function(r5, o) {
+    return r5[o] = F(e, o, n, t), r5;
+  }, {});
 }
-function Bn(e, n, t) {
-  var a;
-  let r5 = [], o = n[n.length - 1], i = n[0], s;
-  for (; e.nodeCount(); ) {
-    for (; s = i.dequeue(); ) $(e, n, t, s);
-    for (; s = o.dequeue(); ) $(e, n, t, s);
-    if (e.nodeCount()) {
-      for (let d = n.length - 2; d > 0; --d) if (s = (a = n[d]) == null ? void 0 : a.dequeue(), s) {
-        r5 = r5.concat($(e, n, t, s, true) || []);
-        break;
-      }
+function Ge(e) {
+  let n = 0, t = [], r5 = {}, o = [];
+  function i(s) {
+    let a = r5[s] = { onStack: true, lowlink: n, index: n++ };
+    if (t.push(s), e.successors(s).forEach(function(d) {
+      d in r5 ? r5[d].onStack && (a.lowlink = Math.min(a.lowlink, r5[d].index)) : (i(d), a.lowlink = Math.min(a.lowlink, r5[d].lowlink));
+    }), a.lowlink === a.index) {
+      let d = [], l;
+      do
+        l = t.pop(), r5[l].onStack = false, d.push(l);
+      while (s !== l);
+      o.push(d);
     }
   }
-  return r5;
-}
-function $(e, n, t, r5, o) {
-  let i = [], s = o ? i : void 0;
-  return (e.inEdges(r5.v) || []).forEach((a) => {
-    let d = e.edge(a), l = e.node(a.v);
-    o && i.push({ v: a.v, w: a.w }), l.out -= d, J(n, t, l);
-  }), (e.outEdges(r5.v) || []).forEach((a) => {
-    let d = e.edge(a), l = a.w, u = e.node(l);
-    u.in -= d, J(n, t, u);
-  }), e.removeNode(r5.v), s;
+  return e.nodes().forEach(function(s) {
+    s in r5 || i(s);
+  }), o;
 }
-function Yn(e, n) {
-  let t = new p(), r5 = 0, o = 0;
-  e.nodes().forEach((a) => {
-    t.setNode(a, { v: a, in: 0, out: 0 });
-  }), e.edges().forEach((a) => {
-    let d = t.edge(a.v, a.w) || 0, l = n(a), u = d + l;
-    t.setEdge(a.v, a.w, u);
-    let c = t.node(a.v), h = t.node(a.w);
-    o = Math.max(o, c.out += l), r5 = Math.max(r5, h.in += l);
+function xn(e) {
+  return Ge(e).filter(function(n) {
+    return n.length > 1 || n.length === 1 && e.hasEdge(n[0], n[0]);
   });
-  let i = zn(o + r5 + 3).map(() => new Me()), s = r5 + 1;
-  return t.nodes().forEach((a) => {
-    J(i, s, t.node(a));
-  }), { graph: t, buckets: i, zeroIdx: s };
-}
-function J(e, n, t) {
-  var r5, o, i;
-  t.out ? t.in ? (i = e[t.out - t.in + n]) == null || i.enqueue(t) : (o = e[e.length - 1]) == null || o.enqueue(t) : (r5 = e[0]) == null || r5.enqueue(t);
-}
-function zn(e) {
-  let n = [];
-  for (let t = 0; t < e; t++) n.push(t);
-  return n;
 }
-function je(e) {
-  (e.graph().acyclicer === "greedy" ? Q(e, t(e)) : Hn(e)).forEach((r5) => {
-    let o = e.edge(r5);
-    e.removeEdge(r5), o.forwardName = r5.name, o.reversed = true, e.setEdge(r5.w, r5.v, o, j("rev"));
+var Tn = () => 1;
+function On(e, n, t) {
+  return In(e, n || Tn, t || function(r5) {
+    return e.outEdges(r5);
   });
-  function t(r5) {
-    return (o) => r5.edge(o).weight;
-  }
 }
-function Hn(e) {
-  let n = [], t = {}, r5 = {};
+function In(e, n, t) {
+  let r5 = {}, o = e.nodes();
+  return o.forEach(function(i) {
+    r5[i] = {}, r5[i][i] = { distance: 0, predecessor: "" }, o.forEach(function(s) {
+      i !== s && (r5[i][s] = { distance: Number.POSITIVE_INFINITY, predecessor: "" });
+    }), t(i).forEach(function(s) {
+      let a = s.v === i ? s.w : s.v, d = n(s);
+      r5[i][a] = { distance: d, predecessor: i };
+    });
+  }), o.forEach(function(i) {
+    let s = r5[i];
+    o.forEach(function(a) {
+      let d = r5[a];
+      o.forEach(function(l) {
+        let u = d[i], c = s[l], h = d[l], f = u.distance + c.distance;
+        f < h.distance && (h.distance = f, h.predecessor = c.predecessor);
+      });
+    });
+  }), r5;
+}
+var D = class extends Error {
+  constructor(...e) {
+    super(...e);
+  }
+};
+function ke(e) {
+  let n = {}, t = {}, r5 = [];
   function o(i) {
-    Object.hasOwn(r5, i) || (r5[i] = true, t[i] = true, e.outEdges(i).forEach((s) => {
-      Object.hasOwn(t, s.w) ? n.push(s) : o(s.w);
-    }), delete t[i]);
+    if (i in t) throw new D();
+    i in n || (t[i] = true, n[i] = true, e.predecessors(i).forEach(o), delete t[i], r5.push(i));
   }
-  return e.nodes().forEach(o), n;
-}
-function Se(e) {
-  e.edges().forEach((n) => {
-    let t = e.edge(n);
-    if (t.reversed) {
-      e.removeEdge(n);
-      let r5 = t.forwardName;
-      delete t.reversed, delete t.forwardName, e.setEdge(n.w, n.v, t, r5);
-    }
-  });
+  if (e.sinks().forEach(o), Object.keys(n).length !== e.nodeCount()) throw new D();
+  return r5;
 }
-function Fe(e) {
-  e.graph().dummyChains = [], e.edges().forEach((n) => Xn(e, n));
+function Cn(e) {
+  try {
+    ke(e);
+  } catch (n) {
+    if (n instanceof D) return false;
+    throw n;
+  }
+  return true;
 }
-function Xn(e, n) {
-  let t = n.v, r5 = e.node(t).rank, o = n.w, i = e.node(o).rank, s = n.name, a = e.edge(n), d = a.labelRank;
-  if (i === r5 + 1) return;
-  e.removeEdge(n);
-  let l, u, c;
-  for (c = 0, ++r5; r5 < i; ++c, ++r5) a.points = [], u = { width: 0, height: 0, edgeLabel: a, edgeObj: n, rank: r5 }, l = w(e, "edge", u, "_d"), r5 === d && (u.width = a.width, u.height = a.height, u.dummy = "edge-label", u.labelpos = a.labelpos), e.setEdge(t, l, { weight: a.weight }, s), c === 0 && e.graph().dummyChains.push(l), t = l;
-  e.setEdge(t, o, { weight: a.weight }, s);
+function Rn(e, n, t, r5, o) {
+  Array.isArray(n) || (n = [n]);
+  let i = ((a) => {
+    var d;
+    return (d = e.isDirected() ? e.successors(a) : e.neighbors(a)) != null ? d : [];
+  }), s = {};
+  return n.forEach(function(a) {
+    if (!e.hasNode(a)) throw new Error("Graph does not have node: " + a);
+    o = ve(e, a, t === "post", s, i, r5, o);
+  }), o;
 }
-function De(e) {
-  e.graph().dummyChains.forEach((n) => {
-    let t = e.node(n), r5 = t.edgeLabel, o;
-    for (e.setEdge(t.edgeObj, r5); t.dummy; ) o = e.successors(n)[0], e.removeNode(n), r5.points.push({ x: t.x, y: t.y }), t.dummy === "edge-label" && (r5.x = t.x, r5.y = t.y, r5.width = t.width, r5.height = t.height), n = o, t = e.node(n);
-  });
+function ve(e, n, t, r5, o, i, s) {
+  return n in r5 || (r5[n] = true, t || (s = i(s, n)), o(n).forEach(function(a) {
+    s = ve(e, a, t, r5, o, i, s);
+  }), t && (s = i(s, n))), s;
 }
-function S(e) {
-  let n = {};
-  function t(r5) {
-    let o = e.node(r5);
-    if (Object.hasOwn(n, r5)) return o.rank;
-    n[r5] = true;
-    let i = e.outEdges(r5), s = i ? i.map((d) => d == null ? Number.POSITIVE_INFINITY : t(d.w) - e.edge(d).minlen) : [], a = L(Math.min, s);
-    return a === Number.POSITIVE_INFINITY && (a = 0), o.rank = a;
-  }
-  e.sources().forEach(t);
+function _e(e, n, t) {
+  return Rn(e, n, t, function(r5, o) {
+    return r5.push(o), r5;
+  }, []);
 }
-function v(e, n) {
-  return e.node(n.w).rank - e.node(n.v).rank - e.edge(n).minlen;
+function Pn(e, n) {
+  return _e(e, n, "post");
 }
-var V = Kn;
-function Kn(e) {
-  let n = new p({ directed: false }), t = e.nodes();
-  if (t.length === 0) throw new Error("Graph must have at least one node");
-  let r5 = t[0], o = e.nodeCount();
-  n.setNode(r5, {});
-  let i, s;
-  for (; $n(n, e) < o && (i = Jn(n, e), !!i); ) s = n.hasNode(i.v) ? v(e, i) : -v(e, i), Qn(n, e, s);
-  return n;
+function Mn(e, n) {
+  return _e(e, n, "pre");
 }
-function $n(e, n) {
-  function t(r5) {
-    let o = n.nodeEdges(r5);
-    o && o.forEach((i) => {
-      let s = i.v, a = r5 === s ? i.w : s;
-      !e.hasNode(a) && !v(n, i) && (e.setNode(a, {}), e.setEdge(r5, a, {}), t(a));
-    });
+function jn(e, n) {
+  let t = new p(), r5 = {}, o = new Ne(), i;
+  function s(d) {
+    let l = d.v === i ? d.w : d.v, u = o.priority(l);
+    if (u !== void 0) {
+      let c = n(d);
+      c < u && (r5[l] = i, o.decrease(l, c));
+    }
   }
-  return e.nodes().forEach(t), e.nodeCount();
+  if (e.nodeCount() === 0) return t;
+  e.nodes().forEach(function(d) {
+    o.add(d, Number.POSITIVE_INFINITY), t.setNode(d);
+  }), o.decrease(e.nodes()[0], 0);
+  let a = false;
+  for (; o.size() > 0; ) {
+    if (i = o.removeMin(), i in r5) t.setEdge(i, r5[i]);
+    else {
+      if (a) throw new Error("Input graph is not connected: " + e);
+      a = true;
+    }
+    e.nodeEdges(i).forEach(s);
+  }
+  return t;
 }
-function Jn(e, n) {
-  return n.edges().reduce((r5, o) => {
-    let i = Number.POSITIVE_INFINITY;
-    return e.hasNode(o.v) !== e.hasNode(o.w) && (i = v(n, o)), i < r5[0] ? [i, o] : r5;
-  }, [Number.POSITIVE_INFINITY, null])[1];
+function Sn(e, n, t, r5) {
+  return Fn(e, n, t, r5 != null ? r5 : ((o) => {
+    let i = e.outEdges(o);
+    return i != null ? i : [];
+  }));
 }
-function Qn(e, n, t) {
-  e.nodes().forEach((r5) => n.node(r5).rank += t);
+function Fn(e, n, t, r5) {
+  if (t === void 0) return F(e, n, t, r5);
+  let o = false, i = e.nodes();
+  for (let s = 0; s < i.length; s++) {
+    let a = r5(i[s]);
+    for (let d = 0; d < a.length; d++) {
+      let l = a[d], u = l.v === i[s] ? l.v : l.w, c = u === l.v ? l.w : l.v;
+      t({ v: u, w: c }) < 0 && (o = true);
+    }
+    if (o) return we(e, n, t, r5);
+  }
+  return F(e, n, t, r5);
 }
-var { preorder: Zn, postorder: et } = R;
-var Ve = x;
-x.initLowLimValues = ee;
-x.initCutValues = Z;
-x.calcCutValue = We;
-x.leaveEdge = Ye;
-x.enterEdge = ze;
-x.exchangeEdges = He;
-function x(e) {
-  e = xe(e), S(e);
-  let n = V(e);
-  ee(n), Z(n, e);
-  let t, r5;
-  for (; t = Ye(n); ) r5 = ze(n, e, t), He(n, e, t, r5);
+function w(e, n, t, r5) {
+  let o = r5;
+  for (; e.hasNode(o); ) o = j(r5);
+  return t.dummy = n, e.setNode(o, t), o;
 }
-function Z(e, n) {
-  let t = et(e, e.nodes());
-  t = t.slice(0, t.length - 1), t.forEach((r5) => nt(e, n, r5));
+function xe(e) {
+  let n = new p().setGraph(e.graph());
+  return e.nodes().forEach((t) => n.setNode(t, e.node(t))), e.edges().forEach((t) => {
+    let r5 = n.edge(t.v, t.w) || { weight: 0, minlen: 1 }, o = e.edge(t);
+    n.setEdge(t.v, t.w, { weight: r5.weight + o.weight, minlen: Math.max(r5.minlen, o.minlen) });
+  }), n;
 }
-function nt(e, n, t) {
-  let o = e.node(t).parent, i = e.edge(t, o);
-  i.cutvalue = We(e, n, t);
+function A(e) {
+  let n = new p({ multigraph: e.isMultigraph() }).setGraph(e.graph());
+  return e.nodes().forEach((t) => {
+    e.children(t).length || n.setNode(t, e.node(t));
+  }), e.edges().forEach((t) => {
+    n.setEdge(t, e.edge(t));
+  }), n;
 }
-function We(e, n, t) {
-  let o = e.node(t).parent, i = true, s = n.edge(t, o), a = 0;
-  s || (i = false, s = n.edge(o, t)), a = s.weight;
-  let d = n.nodeEdges(t);
-  return d && d.forEach((l) => {
-    let u = l.v === t, c = u ? l.w : l.v;
-    if (c !== o) {
-      let h = u === i, f = n.edge(l).weight;
-      if (a += h ? f : -f, rt(e, t, c)) {
-        let b = e.edge(t, c).cutvalue;
-        a += h ? -b : b;
-      }
-    }
-  }), a;
+function H(e, n) {
+  let t = e.x, r5 = e.y, o = n.x - t, i = n.y - r5, s = e.width / 2, a = e.height / 2;
+  if (!o && !i) throw new Error("Not possible to find intersection inside of the rectangle");
+  let d, l;
+  return Math.abs(i) * s > Math.abs(o) * a ? (i < 0 && (a = -a), d = a * o / i, l = a) : (o < 0 && (s = -s), d = s, l = s * i / o), { x: t + d, y: r5 + l };
 }
-function ee(e, n) {
-  arguments.length < 2 && (n = e.nodes()[0]), Be(e, {}, 1, n);
+function N(e) {
+  let n = k(X(e) + 1).map(() => []);
+  return e.nodes().forEach((t) => {
+    let r5 = e.node(t), o = r5.rank;
+    o !== void 0 && (n[o] || (n[o] = []), n[o][r5.order] = t);
+  }), n;
 }
-function Be(e, n, t, r5, o) {
-  let i = t, s = e.node(r5);
-  n[r5] = true;
-  let a = e.neighbors(r5);
-  return a && a.forEach((d) => {
-    Object.hasOwn(n, d) || (t = Be(e, n, t, d, r5));
-  }), s.low = i, s.lim = t++, o ? s.parent = o : delete s.parent, t;
+function Te(e) {
+  let n = e.nodes().map((r5) => {
+    let o = e.node(r5).rank;
+    return o === void 0 ? Number.MAX_VALUE : o;
+  }), t = L(Math.min, n);
+  e.nodes().forEach((r5) => {
+    let o = e.node(r5);
+    Object.hasOwn(o, "rank") && (o.rank -= t);
+  });
+}
+function Oe(e) {
+  let n = e.nodes().map((s) => e.node(s).rank).filter((s) => s !== void 0), t = L(Math.min, n), r5 = [];
+  e.nodes().forEach((s) => {
+    let a = e.node(s).rank - t;
+    r5[a] || (r5[a] = []), r5[a].push(s);
+  });
+  let o = 0, i = e.graph().nodeRankFactor;
+  Array.from(r5).forEach((s, a) => {
+    s === void 0 && a % i !== 0 ? --o : s !== void 0 && o && s.forEach((d) => e.node(d).rank += o);
+  });
 }
-function Ye(e) {
-  return e.edges().find((n) => e.edge(n).cutvalue < 0);
+function q(e, n, t, r5) {
+  let o = { width: 0, height: 0 };
+  return arguments.length >= 4 && (o.rank = t, o.order = r5), w(e, "border", o, n);
 }
-function ze(e, n, t) {
-  let r5 = t.v, o = t.w;
-  n.hasEdge(r5, o) || (r5 = t.w, o = t.v);
-  let i = e.node(r5), s = e.node(o), a = i, d = false;
-  return i.lim > s.lim && (a = s, d = true), n.edges().filter((u) => d === Ae(e, e.node(u.v), a) && d !== Ae(e, e.node(u.w), a)).reduce((u, c) => v(n, c) < v(n, u) ? c : u);
+function Dn(e, n = Ie) {
+  let t = [];
+  for (let r5 = 0; r5 < e.length; r5 += n) {
+    let o = e.slice(r5, r5 + n);
+    t.push(o);
+  }
+  return t;
 }
-function He(e, n, t, r5) {
-  let o = t.v, i = t.w;
-  e.removeEdge(o, i), e.setEdge(r5.v, r5.w, {}), ee(e), Z(e, n), tt(e, n);
+var Ie = 65535;
+function L(e, n) {
+  if (n.length > Ie) {
+    let t = Dn(n);
+    return e(...t.map((r5) => e(...r5)));
+  } else return e(...n);
 }
-function tt(e, n) {
-  let t = e.nodes().find((o) => !e.node(o).parent);
-  if (!t) return;
-  let r5 = Zn(e, [t]);
-  r5 = r5.slice(1), r5.forEach((o) => {
-    let s = e.node(o).parent, a = n.edge(o, s), d = false;
-    a || (a = n.edge(s, o), d = true), n.node(o).rank = n.node(s).rank + (d ? a.minlen : -a.minlen);
+function X(e) {
+  let t = e.nodes().map((r5) => {
+    let o = e.node(r5).rank;
+    return o === void 0 ? Number.MIN_VALUE : o;
   });
+  return L(Math.max, t);
 }
-function rt(e, n, t) {
-  return e.hasEdge(n, t);
-}
-function Ae(e, n, t) {
-  return t.low <= n.lim && n.lim <= t.lim;
+function Ce(e, n) {
+  let t = { lhs: [], rhs: [] };
+  return e.forEach((r5) => {
+    n(r5) ? t.lhs.push(r5) : t.rhs.push(r5);
+  }), t;
 }
-var Xe = ot;
-function ot(e) {
-  let n = e.graph().ranker;
-  if (typeof n == "function") return n(e);
-  switch (n) {
-    case "network-simplex":
-      qe(e);
-      break;
-    case "tight-tree":
-      st(e);
-      break;
-    case "longest-path":
-      it(e);
-      break;
-    case "none":
-      break;
-    default:
-      qe(e);
+function P(e, n) {
+  let t = Date.now();
+  try {
+    return n();
+  } finally {
+    console.log(e + " time: " + (Date.now() - t) + "ms");
   }
 }
-var it = S;
-function st(e) {
-  S(e), V(e);
+function M(e, n) {
+  return n();
 }
-function qe(e) {
-  Ve(e);
+var An = 0;
+function j(e) {
+  let n = ++An;
+  return e + ("" + n);
 }
-var Ue = at;
-function at(e) {
-  let n = lt(e);
-  e.graph().dummyChains.forEach((t) => {
-    let r5 = e.node(t), o = r5.edgeObj, i = dt(e, n, o.v, o.w), s = i.path, a = i.lca, d = 0, l = s[d], u = true;
-    for (; t !== o.w; ) {
-      if (r5 = e.node(t), u) {
-        for (; (l = s[d]) !== a && e.node(l).maxRank < r5.rank; ) d++;
-        l === a && (u = false);
-      }
-      if (!u) {
-        for (; d < s.length - 1 && e.node(s[d + 1]).minRank <= r5.rank; ) d++;
-        l = s[d];
-      }
-      l !== void 0 && e.setParent(t, l), t = e.successors(t)[0];
-    }
-  });
+function k(e, n, t = 1) {
+  n == null && (n = e, e = 0);
+  let r5 = (i) => i < n;
+  t < 0 && (r5 = (i) => n < i);
+  let o = [];
+  for (let i = e; r5(i); i += t) o.push(i);
+  return o;
 }
-function dt(e, n, t, r5) {
-  let o = [], i = [], s = Math.min(n[t].low, n[r5].low), a = Math.max(n[t].lim, n[r5].lim), d;
-  d = t;
-  do
-    d = e.parent(d), o.push(d);
-  while (d && (n[d].low > s || a > n[d].lim));
-  let l = d, u = r5;
-  for (; (u = e.parent(u)) !== l; ) i.push(u);
-  return { path: o.concat(i.reverse()), lca: l };
+function T(e, n) {
+  let t = {};
+  for (let r5 of n) e[r5] !== void 0 && (t[r5] = e[r5]);
+  return t;
 }
-function lt(e) {
-  let n = {}, t = 0;
-  function r5(o) {
-    let i = t;
-    e.children(o).forEach(r5), n[o] = { low: i, lim: t++ };
-  }
-  return e.children(_).forEach(r5), n;
+function O(e, n) {
+  let t;
+  return typeof n == "string" ? t = (r5) => r5[n] : t = n, Object.entries(e).reduce((r5, [o, i]) => (r5[o] = t(i, o), r5), {});
 }
-function Ke(e) {
-  let n = w(e, "root", {}, "_root"), t = ut(e), r5 = Object.values(t), o = L(Math.max, r5) - 1, i = 2 * o + 1;
-  e.graph().nestingRoot = n, e.edges().forEach((a) => e.edge(a).minlen *= i);
-  let s = ct(e) + 1;
-  e.children(_).forEach((a) => $e(e, n, i, s, o, t, a)), e.graph().nodeRankFactor = i;
+function Re(e, n) {
+  return e.reduce((t, r5, o) => (t[r5] = n[o], t), {});
 }
-function $e(e, n, t, r5, o, i, s) {
-  var c;
-  let a = e.children(s);
-  if (!a.length) {
-    s !== n && e.setEdge(n, s, { weight: 0, minlen: t });
-    return;
+var _ = "\0";
+var U = "3.0.0";
+var K = class {
+  constructor() {
+    pe(this, "_sentinel");
+    let n = {};
+    n._next = n._prev = n, this._sentinel = n;
   }
-  let d = q(e, "_bt"), l = q(e, "_bb"), u = e.node(s);
-  e.setParent(d, s), u.borderTop = d, e.setParent(l, s), u.borderBottom = l, a.forEach((h) => {
-    var y;
-    $e(e, n, t, r5, o, i, h);
-    let f = e.node(h), g = f.borderTop ? f.borderTop : h, b = f.borderBottom ? f.borderBottom : h, m = f.borderTop ? r5 : 2 * r5, E = g !== b ? 1 : o - ((y = i[s]) != null ? y : 0) + 1;
-    e.setEdge(d, g, { weight: m, minlen: E, nestingEdge: true }), e.setEdge(b, l, { weight: m, minlen: E, nestingEdge: true });
-  }), e.parent(s) || e.setEdge(n, d, { weight: 0, minlen: o + ((c = i[s]) != null ? c : 0) });
-}
-function ut(e) {
-  let n = {};
-  function t(r5, o) {
-    let i = e.children(r5);
-    i && i.length && i.forEach((s) => t(s, o + 1)), n[r5] = o;
+  dequeue() {
+    let n = this._sentinel, t = n._prev;
+    if (t !== n) return Pe(t), t;
   }
-  return e.children(_).forEach((r5) => t(r5, 1)), n;
+  enqueue(n) {
+    let t = this._sentinel;
+    n._prev && n._next && Pe(n), n._next = t._next, t._next._prev = n, t._next = n, n._prev = t;
+  }
+  toString() {
+    let n = [], t = this._sentinel, r5 = t._prev;
+    for (; r5 !== t; ) n.push(JSON.stringify(r5, Vn)), r5 = r5._prev;
+    return "[" + n.join(", ") + "]";
+  }
+};
+function Pe(e) {
+  e._prev._next = e._next, e._next._prev = e._prev, delete e._next, delete e._prev;
 }
-function ct(e) {
-  return e.edges().reduce((n, t) => n + e.edge(t).weight, 0);
+function Vn(e, n) {
+  if (e !== "_next" && e !== "_prev") return n;
 }
-function Je(e) {
-  let n = e.graph();
-  e.removeNode(n.nestingRoot), delete n.nestingRoot, e.edges().forEach((t) => {
-    e.edge(t).nestingEdge && e.removeEdge(t);
-  });
+var Me = K;
+var Wn = () => 1;
+function Q(e, n) {
+  if (e.nodeCount() <= 1) return [];
+  let t = Yn(e, n || Wn);
+  return Bn(t.graph, t.buckets, t.zeroIdx).flatMap((o) => e.outEdges(o.v, o.w) || []);
 }
-var Ze = ft;
-function ft(e) {
-  function n(t) {
-    let r5 = e.children(t), o = e.node(t);
-    if (r5.length && r5.forEach(n), Object.hasOwn(o, "minRank")) {
-      o.borderLeft = [], o.borderRight = [];
-      for (let i = o.minRank, s = o.maxRank + 1; i < s; ++i) Qe(e, "borderLeft", "_bl", t, o, i), Qe(e, "borderRight", "_br", t, o, i);
+function Bn(e, n, t) {
+  var a;
+  let r5 = [], o = n[n.length - 1], i = n[0], s;
+  for (; e.nodeCount(); ) {
+    for (; s = i.dequeue(); ) $(e, n, t, s);
+    for (; s = o.dequeue(); ) $(e, n, t, s);
+    if (e.nodeCount()) {
+      for (let d = n.length - 2; d > 0; --d) if (s = (a = n[d]) == null ? void 0 : a.dequeue(), s) {
+        r5 = r5.concat($(e, n, t, s, true) || []);
+        break;
+      }
     }
   }
-  e.children(_).forEach(n);
-}
-function Qe(e, n, t, r5, o, i) {
-  let s = { width: 0, height: 0, rank: i, borderType: n }, a = o[n][i - 1], d = w(e, "border", s, t);
-  o[n][i] = d, e.setParent(d, r5), a && e.setEdge(a, d, { weight: 1 });
-}
-function nn(e) {
-  var t;
-  let n = (t = e.graph().rankdir) == null ? void 0 : t.toLowerCase();
-  (n === "lr" || n === "rl") && rn(e);
-}
-function tn(e) {
-  var t;
-  let n = (t = e.graph().rankdir) == null ? void 0 : t.toLowerCase();
-  (n === "bt" || n === "rl") && bt(e), (n === "lr" || n === "rl") && (gt(e), rn(e));
-}
-function rn(e) {
-  e.nodes().forEach((n) => en(e.node(n))), e.edges().forEach((n) => en(e.edge(n)));
+  return r5;
 }
-function en(e) {
-  let n = e.width;
-  e.width = e.height, e.height = n;
+function $(e, n, t, r5, o) {
+  let i = [], s = o ? i : void 0;
+  return (e.inEdges(r5.v) || []).forEach((a) => {
+    let d = e.edge(a), l = e.node(a.v);
+    o && i.push({ v: a.v, w: a.w }), l.out -= d, J(n, t, l);
+  }), (e.outEdges(r5.v) || []).forEach((a) => {
+    let d = e.edge(a), l = a.w, u = e.node(l);
+    u.in -= d, J(n, t, u);
+  }), e.removeNode(r5.v), s;
 }
-function bt(e) {
-  e.nodes().forEach((n) => ne(e.node(n))), e.edges().forEach((n) => {
-    var r5;
-    let t = e.edge(n);
-    (r5 = t.points) == null || r5.forEach(ne), Object.hasOwn(t, "y") && ne(t);
+function Yn(e, n) {
+  let t = new p(), r5 = 0, o = 0;
+  e.nodes().forEach((a) => {
+    t.setNode(a, { v: a, in: 0, out: 0 });
+  }), e.edges().forEach((a) => {
+    let d = t.edge(a.v, a.w) || 0, l = n(a), u = d + l;
+    t.setEdge(a.v, a.w, u);
+    let c = t.node(a.v), h = t.node(a.w);
+    o = Math.max(o, c.out += l), r5 = Math.max(r5, h.in += l);
   });
+  let i = zn(o + r5 + 3).map(() => new Me()), s = r5 + 1;
+  return t.nodes().forEach((a) => {
+    J(i, s, t.node(a));
+  }), { graph: t, buckets: i, zeroIdx: s };
 }
-function ne(e) {
-  e.y = -e.y;
-}
-function gt(e) {
-  e.nodes().forEach((n) => te(e.node(n))), e.edges().forEach((n) => {
-    var r5;
-    let t = e.edge(n);
-    (r5 = t.points) == null || r5.forEach(te), Object.hasOwn(t, "x") && te(t);
-  });
+function J(e, n, t) {
+  var r5, o, i;
+  t.out ? t.in ? (i = e[t.out - t.in + n]) == null || i.enqueue(t) : (o = e[e.length - 1]) == null || o.enqueue(t) : (r5 = e[0]) == null || r5.enqueue(t);
 }
-function te(e) {
-  let n = e.x;
-  e.x = e.y, e.y = n;
+function zn(e) {
+  let n = [];
+  for (let t = 0; t < e; t++) n.push(t);
+  return n;
 }
-function re(e) {
-  let n = {}, t = e.nodes().filter((d) => !e.children(d).length), r5 = t.map((d) => e.node(d).rank), o = L(Math.max, r5), i = k(o + 1).map(() => []);
-  function s(d) {
-    if (n[d]) return;
-    n[d] = true;
-    let l = e.node(d);
-    i[l.rank].push(d);
-    let u = e.successors(d);
-    u && u.forEach(s);
+function je(e) {
+  (e.graph().acyclicer === "greedy" ? Q(e, t(e)) : Hn(e)).forEach((r5) => {
+    let o = e.edge(r5);
+    e.removeEdge(r5), o.forwardName = r5.name, o.reversed = true, e.setEdge(r5.w, r5.v, o, j("rev"));
+  });
+  function t(r5) {
+    return (o) => r5.edge(o).weight;
   }
-  return t.sort((d, l) => e.node(d).rank - e.node(l).rank).forEach(s), i;
-}
-function oe(e, n) {
-  let t = 0;
-  for (let r5 = 1; r5 < n.length; ++r5) t += mt(e, n[r5 - 1], n[r5]);
-  return t;
 }
-function mt(e, n, t) {
-  let r5 = Re(t, t.map((l, u) => u)), o = n.flatMap((l) => {
-    let u = e.outEdges(l);
-    return u ? u.map((c) => ({ pos: r5[c.w], weight: e.edge(c).weight })).sort((c, h) => c.pos - h.pos) : [];
-  }), i = 1;
-  for (; i < t.length; ) i <<= 1;
-  let s = 2 * i - 1;
-  i -= 1;
-  let a = new Array(s).fill(0), d = 0;
-  return o.forEach((l) => {
-    let u = l.pos + i;
-    a[u] += l.weight;
-    let c = 0;
-    for (; u > 0; ) u % 2 && (c += a[u + 1]), u = u - 1 >> 1, a[u] += l.weight;
-    d += l.weight * c;
-  }), d;
+function Hn(e) {
+  let n = [], t = {}, r5 = {};
+  function o(i) {
+    Object.hasOwn(r5, i) || (r5[i] = true, t[i] = true, e.outEdges(i).forEach((s) => {
+      Object.hasOwn(t, s.w) ? n.push(s) : o(s.w);
+    }), delete t[i]);
+  }
+  return e.nodes().forEach(o), n;
 }
-function ie(e, n = []) {
-  return n.map((t) => {
-    let r5 = e.inEdges(t);
-    if (!r5 || !r5.length) return { v: t };
-    {
-      let o = r5.reduce((i, s) => {
-        let a = e.edge(s), d = e.node(s.v);
-        return { sum: i.sum + a.weight * d.order, weight: i.weight + a.weight };
-      }, { sum: 0, weight: 0 });
-      return { v: t, barycenter: o.sum / o.weight, weight: o.weight };
+function Se(e) {
+  e.edges().forEach((n) => {
+    let t = e.edge(n);
+    if (t.reversed) {
+      e.removeEdge(n);
+      let r5 = t.forwardName;
+      delete t.reversed, delete t.forwardName, e.setEdge(n.w, n.v, t, r5);
     }
   });
 }
-function se(e, n) {
-  let t = {};
-  e.forEach((o, i) => {
-    let s = { indegree: 0, in: [], out: [], vs: [o.v], i };
-    o.barycenter !== void 0 && (s.barycenter = o.barycenter, s.weight = o.weight), t[o.v] = s;
-  }), n.edges().forEach((o) => {
-    let i = t[o.v], s = t[o.w];
-    i !== void 0 && s !== void 0 && (s.indegree++, i.out.push(s));
+function Fe(e) {
+  e.graph().dummyChains = [], e.edges().forEach((n) => Xn(e, n));
+}
+function Xn(e, n) {
+  let t = n.v, r5 = e.node(t).rank, o = n.w, i = e.node(o).rank, s = n.name, a = e.edge(n), d = a.labelRank;
+  if (i === r5 + 1) return;
+  e.removeEdge(n);
+  let l, u, c;
+  for (c = 0, ++r5; r5 < i; ++c, ++r5) a.points = [], u = { width: 0, height: 0, edgeLabel: a, edgeObj: n, rank: r5 }, l = w(e, "edge", u, "_d"), r5 === d && (u.width = a.width, u.height = a.height, u.dummy = "edge-label", u.labelpos = a.labelpos), e.setEdge(t, l, { weight: a.weight }, s), c === 0 && e.graph().dummyChains.push(l), t = l;
+  e.setEdge(t, o, { weight: a.weight }, s);
+}
+function De(e) {
+  e.graph().dummyChains.forEach((n) => {
+    let t = e.node(n), r5 = t.edgeLabel, o;
+    for (e.setEdge(t.edgeObj, r5); t.dummy; ) o = e.successors(n)[0], e.removeNode(n), r5.points.push({ x: t.x, y: t.y }), t.dummy === "edge-label" && (r5.x = t.x, r5.y = t.y, r5.width = t.width, r5.height = t.height), n = o, t = e.node(n);
   });
-  let r5 = Object.values(t).filter((o) => !o.indegree);
-  return Et(r5);
 }
-function Et(e) {
-  let n = [];
-  function t(o) {
-    return (i) => {
-      i.merged || (i.barycenter === void 0 || o.barycenter === void 0 || i.barycenter >= o.barycenter) && Lt(o, i);
-    };
-  }
-  function r5(o) {
-    return (i) => {
-      i.in.push(o), --i.indegree === 0 && e.push(i);
-    };
-  }
-  for (; e.length; ) {
-    let o = e.pop();
-    n.push(o), o.in.reverse().forEach(t(o)), o.out.forEach(r5(o));
+function S(e) {
+  let n = {};
+  function t(r5) {
+    let o = e.node(r5);
+    if (Object.hasOwn(n, r5)) return o.rank;
+    n[r5] = true;
+    let i = e.outEdges(r5), s = i ? i.map((d) => d == null ? Number.POSITIVE_INFINITY : t(d.w) - e.edge(d).minlen) : [], a = L(Math.min, s);
+    return a === Number.POSITIVE_INFINITY && (a = 0), o.rank = a;
   }
-  return n.filter((o) => !o.merged).map((o) => T(o, ["vs", "i", "barycenter", "weight"]));
+  e.sources().forEach(t);
 }
-function Lt(e, n) {
-  let t = 0, r5 = 0;
-  e.weight && (t += e.barycenter * e.weight, r5 += e.weight), n.weight && (t += n.barycenter * n.weight, r5 += n.weight), e.vs = n.vs.concat(e.vs), e.barycenter = t / r5, e.weight = r5, e.i = Math.min(n.i, e.i), n.merged = true;
+function v(e, n) {
+  return e.node(n.w).rank - e.node(n.v).rank - e.edge(n).minlen;
 }
-function ae(e, n) {
-  let t = Ce(e, (u) => Object.hasOwn(u, "barycenter")), r5 = t.lhs, o = t.rhs.sort((u, c) => c.i - u.i), i = [], s = 0, a = 0, d = 0;
-  r5.sort(yt(!!n)), d = on(i, o, d), r5.forEach((u) => {
-    d += u.vs.length, i.push(u.vs), s += u.barycenter * u.weight, a += u.weight, d = on(i, o, d);
-  });
-  let l = { vs: i.flat(1) };
-  return a && (l.barycenter = s / a, l.weight = a), l;
+var V = Kn;
+function Kn(e) {
+  let n = new p({ directed: false }), t = e.nodes();
+  if (t.length === 0) throw new Error("Graph must have at least one node");
+  let r5 = t[0], o = e.nodeCount();
+  n.setNode(r5, {});
+  let i, s;
+  for (; $n(n, e) < o && (i = Jn(n, e), !!i); ) s = n.hasNode(i.v) ? v(e, i) : -v(e, i), Qn(n, e, s);
+  return n;
 }
-function on(e, n, t) {
-  let r5;
-  for (; n.length && (r5 = n[n.length - 1]).i <= t; ) n.pop(), e.push(r5.vs), t++;
-  return t;
+function $n(e, n) {
+  function t(r5) {
+    let o = n.nodeEdges(r5);
+    o && o.forEach((i) => {
+      let s = i.v, a = r5 === s ? i.w : s;
+      !e.hasNode(a) && !v(n, i) && (e.setNode(a, {}), e.setEdge(r5, a, {}), t(a));
+    });
+  }
+  return e.nodes().forEach(t), e.nodeCount();
 }
-function yt(e) {
-  return (n, t) => n.barycenter < t.barycenter ? -1 : n.barycenter > t.barycenter ? 1 : e ? t.i - n.i : n.i - t.i;
+function Jn(e, n) {
+  return n.edges().reduce((r5, o) => {
+    let i = Number.POSITIVE_INFINITY;
+    return e.hasNode(o.v) !== e.hasNode(o.w) && (i = v(n, o)), i < r5[0] ? [i, o] : r5;
+  }, [Number.POSITIVE_INFINITY, null])[1];
 }
-function W(e, n, t, r5) {
-  let o = e.children(n), i = e.node(n), s = i ? i.borderLeft : void 0, a = i ? i.borderRight : void 0, d = {};
-  s && (o = o.filter((h) => h !== s && h !== a));
-  let l = ie(e, o);
-  l.forEach((h) => {
-    if (e.children(h.v).length) {
-      let f = W(e, h.v, t, r5);
-      d[h.v] = f, Object.hasOwn(f, "barycenter") && Nt(h, f);
-    }
-  });
-  let u = se(l, t);
-  wt(u, d);
-  let c = ae(u, r5);
-  if (s && a) {
-    c.vs = [s, c.vs, a].flat(1);
-    let h = e.predecessors(s);
-    if (h && h.length) {
-      let f = e.node(h[0]), g = e.predecessors(a), b = e.node(g[0]);
-      Object.hasOwn(c, "barycenter") || (c.barycenter = 0, c.weight = 0), c.barycenter = (c.barycenter * c.weight + f.order + b.order) / (c.weight + 2), c.weight += 2;
-    }
-  }
-  return c;
+function Qn(e, n, t) {
+  e.nodes().forEach((r5) => n.node(r5).rank += t);
 }
-function wt(e, n) {
-  e.forEach((t) => {
-    t.vs = t.vs.flatMap((r5) => n[r5] ? n[r5].vs : r5);
-  });
+var { preorder: Zn, postorder: et } = R;
+var Ve = x;
+x.initLowLimValues = ee;
+x.initCutValues = Z;
+x.calcCutValue = We;
+x.leaveEdge = Ye;
+x.enterEdge = ze;
+x.exchangeEdges = He;
+function x(e) {
+  e = xe(e), S(e);
+  let n = V(e);
+  ee(n), Z(n, e);
+  let t, r5;
+  for (; t = Ye(n); ) r5 = ze(n, e, t), He(n, e, t, r5);
 }
-function Nt(e, n) {
-  e.barycenter !== void 0 ? (e.barycenter = (e.barycenter * e.weight + n.barycenter * n.weight) / (e.weight + n.weight), e.weight += n.weight) : (e.barycenter = n.barycenter, e.weight = n.weight);
+function Z(e, n) {
+  let t = et(e, e.nodes());
+  t = t.slice(0, t.length - 1), t.forEach((r5) => nt(e, n, r5));
 }
-function de(e, n, t, r5) {
-  r5 || (r5 = e.nodes());
-  let o = Gt(e), i = new p({ compound: true }).setGraph({ root: o }).setDefaultNodeLabel((s) => e.node(s));
-  return r5.forEach((s) => {
-    let a = e.node(s), d = e.parent(s);
-    if (a.rank === n || a.minRank <= n && n <= a.maxRank) {
-      i.setNode(s), i.setParent(s, d || o);
-      let l = e[t](s);
-      l && l.forEach((u) => {
-        let c = u.v === s ? u.w : u.v, h = i.edge(c, s), f = h !== void 0 ? h.weight : 0;
-        i.setEdge(c, s, { weight: e.edge(u).weight + f });
-      }), Object.hasOwn(a, "minRank") && i.setNode(s, { borderLeft: a.borderLeft[n], borderRight: a.borderRight[n] });
+function nt(e, n, t) {
+  let o = e.node(t).parent, i = e.edge(t, o);
+  i.cutvalue = We(e, n, t);
+}
+function We(e, n, t) {
+  let o = e.node(t).parent, i = true, s = n.edge(t, o), a = 0;
+  s || (i = false, s = n.edge(o, t)), a = s.weight;
+  let d = n.nodeEdges(t);
+  return d && d.forEach((l) => {
+    let u = l.v === t, c = u ? l.w : l.v;
+    if (c !== o) {
+      let h = u === i, f = n.edge(l).weight;
+      if (a += h ? f : -f, rt(e, t, c)) {
+        let b = e.edge(t, c).cutvalue;
+        a += h ? -b : b;
+      }
     }
-  }), i;
+  }), a;
 }
-function Gt(e) {
-  let n;
-  for (; e.hasNode(n = j("_root")); ) ;
-  return n;
+function ee(e, n) {
+  arguments.length < 2 && (n = e.nodes()[0]), Be(e, {}, 1, n);
 }
-function le(e, n, t) {
-  let r5 = {}, o;
-  t.forEach((i) => {
-    let s = e.parent(i), a, d;
-    for (; s; ) {
-      if (a = e.parent(s), a ? (d = r5[a], r5[a] = s) : (d = o, o = s), d && d !== s) {
-        n.setEdge(d, s);
-        return;
-      }
-      s = a;
-    }
-  });
+function Be(e, n, t, r5, o) {
+  let i = t, s = e.node(r5);
+  n[r5] = true;
+  let a = e.neighbors(r5);
+  return a && a.forEach((d) => {
+    Object.hasOwn(n, d) || (t = Be(e, n, t, d, r5));
+  }), s.low = i, s.lim = t++, o ? s.parent = o : delete s.parent, t;
 }
-function B(e, n = {}) {
-  if (typeof n.customOrder == "function") {
-    n.customOrder(e, B);
-    return;
-  }
-  let t = X(e), r5 = sn(e, k(1, t + 1), "inEdges"), o = sn(e, k(t - 1, -1, -1), "outEdges"), i = re(e);
-  if (an(e, i), n.disableOptimalOrderHeuristic) return;
-  let s = Number.POSITIVE_INFINITY, a, d = n.constraints || [];
-  for (let l = 0, u = 0; u < 4; ++l, ++u) {
-    kt(l % 2 ? r5 : o, l % 4 >= 2, d), i = N(e);
-    let c = oe(e, i);
-    c < s ? (u = 0, a = Object.assign({}, i), s = c) : c === s && (a = structuredClone(i));
-  }
-  an(e, a);
+function Ye(e) {
+  return e.edges().find((n) => e.edge(n).cutvalue < 0);
 }
-function sn(e, n, t) {
-  let r5 = /* @__PURE__ */ new Map(), o = (i, s) => {
-    r5.has(i) || r5.set(i, []), r5.get(i).push(s);
-  };
-  for (let i of e.nodes()) {
-    let s = e.node(i);
-    if (typeof s.rank == "number" && o(s.rank, i), typeof s.minRank == "number" && typeof s.maxRank == "number") for (let a = s.minRank; a <= s.maxRank; a++) a !== s.rank && o(a, i);
-  }
-  return n.map(function(i) {
-    return de(e, i, t, r5.get(i) || []);
-  });
+function ze(e, n, t) {
+  let r5 = t.v, o = t.w;
+  n.hasEdge(r5, o) || (r5 = t.w, o = t.v);
+  let i = e.node(r5), s = e.node(o), a = i, d = false;
+  return i.lim > s.lim && (a = s, d = true), n.edges().filter((u) => d === Ae(e, e.node(u.v), a) && d !== Ae(e, e.node(u.w), a)).reduce((u, c) => v(n, c) < v(n, u) ? c : u);
 }
-function kt(e, n, t) {
-  let r5 = new p();
-  e.forEach(function(o) {
-    t.forEach((a) => r5.setEdge(a.left, a.right));
-    let i = o.graph().root, s = W(o, i, r5, n);
-    s.vs.forEach((a, d) => o.node(a).order = d), le(o, r5, s.vs);
-  });
+function He(e, n, t, r5) {
+  let o = t.v, i = t.w;
+  e.removeEdge(o, i), e.setEdge(r5.v, r5.w, {}), ee(e), Z(e, n), tt(e, n);
 }
-function an(e, n) {
-  Object.values(n).forEach((t) => t.forEach((r5, o) => e.node(r5).order = o));
+function tt(e, n) {
+  let t = e.nodes().find((o) => !e.node(o).parent);
+  if (!t) return;
+  let r5 = Zn(e, [t]);
+  r5 = r5.slice(1), r5.forEach((o) => {
+    let s = e.node(o).parent, a = n.edge(o, s), d = false;
+    a || (a = n.edge(s, o), d = true), n.node(o).rank = n.node(s).rank + (d ? a.minlen : -a.minlen);
+  });
 }
-function vt(e, n) {
-  let t = {};
-  function r5(o, i) {
-    let s = 0, a = 0, d = o.length, l = i[i.length - 1];
-    return i.forEach((u, c) => {
-      let h = xt(e, u), f = h ? e.node(h).order : d;
-      (h || u === l) && (i.slice(a, c + 1).forEach((g) => {
-        let b = e.predecessors(g);
-        b && b.forEach((m) => {
-          let E = e.node(m), y = E.order;
-          (y < s || f < y) && !(E.dummy && e.node(g).dummy) && dn(t, m, g);
-        });
-      }), a = c + 1, s = f);
-    }), i;
-  }
-  return n.length && n.reduce(r5), t;
+function rt(e, n, t) {
+  return e.hasEdge(n, t);
 }
-function _t(e, n) {
-  let t = {};
-  function r5(i, s, a, d, l) {
-    k(s, a).forEach((u) => {
-      let c = i[u];
-      if (c !== void 0 && e.node(c).dummy) {
-        let h = e.predecessors(c);
-        h && h.forEach((f) => {
-          if (f === void 0) return;
-          let g = e.node(f);
-          g.dummy && (g.order < d || g.order > l) && dn(t, f, c);
-        });
-      }
-    });
-  }
-  function o(i, s) {
-    let a = -1, d = -1, l = 0;
-    return s.forEach((u, c) => {
-      if (e.node(u).dummy === "border") {
-        let h = e.predecessors(u);
-        if (h && h.length) {
-          let f = h[0];
-          if (f === void 0) return;
-          d = e.node(f).order, r5(s, l, c, a, d), l = c, a = d;
-        }
-      }
-      r5(s, l, s.length, d, i.length);
-    }), s;
-  }
-  return n.length && n.reduce(o), t;
+function Ae(e, n, t) {
+  return t.low <= n.lim && n.lim <= t.lim;
 }
-function xt(e, n) {
-  if (e.node(n).dummy) {
-    let t = e.predecessors(n);
-    if (t) return t.find((r5) => e.node(r5).dummy);
+var Xe = ot;
+function ot(e) {
+  let n = e.graph().ranker;
+  if (typeof n == "function") return n(e);
+  switch (n) {
+    case "network-simplex":
+      qe(e);
+      break;
+    case "tight-tree":
+      st(e);
+      break;
+    case "longest-path":
+      it(e);
+      break;
+    case "none":
+      break;
+    default:
+      qe(e);
   }
 }
-function dn(e, n, t) {
-  if (n > t) {
-    let o = n;
-    n = t, t = o;
-  }
-  let r5 = e[n];
-  r5 || (e[n] = r5 = {}), r5[t] = true;
+var it = S;
+function st(e) {
+  S(e), V(e);
 }
-function Tt(e, n, t) {
-  if (n > t) {
-    let o = n;
-    n = t, t = o;
-  }
-  let r5 = e[n];
-  return r5 !== void 0 && Object.hasOwn(r5, t);
+function qe(e) {
+  Ve(e);
 }
-function Ot(e, n, t, r5) {
-  let o = {}, i = {}, s = {};
-  return n.forEach((a) => {
-    a.forEach((d, l) => {
-      o[d] = d, i[d] = d, s[d] = l;
-    });
-  }), n.forEach((a) => {
-    let d = -1;
-    a.forEach((l) => {
-      let u = r5(l);
-      if (u && u.length) {
-        let c = u.sort((f, g) => {
-          let b = s[f], m = s[g];
-          return (b !== void 0 ? b : 0) - (m !== void 0 ? m : 0);
-        }), h = (c.length - 1) / 2;
-        for (let f = Math.floor(h), g = Math.ceil(h); f <= g; ++f) {
-          let b = c[f];
-          if (b === void 0) continue;
-          let m = s[b];
-          if (m !== void 0 && i[l] === l && d < m && !Tt(t, l, b)) {
-            let E = o[b];
-            E !== void 0 && (i[b] = l, i[l] = o[l] = E, d = m);
-          }
-        }
+var Ue = at;
+function at(e) {
+  let n = lt(e);
+  e.graph().dummyChains.forEach((t) => {
+    let r5 = e.node(t), o = r5.edgeObj, i = dt(e, n, o.v, o.w), s = i.path, a = i.lca, d = 0, l = s[d], u = true;
+    for (; t !== o.w; ) {
+      if (r5 = e.node(t), u) {
+        for (; (l = s[d]) !== a && e.node(l).maxRank < r5.rank; ) d++;
+        l === a && (u = false);
       }
-    });
-  }), { root: o, align: i };
-}
-function It(e, n, t, r5, o = false) {
-  let i = {}, s = Ct(e, n, t, o), a = o ? "borderLeft" : "borderRight";
-  function d(f, g) {
-    let b = s.nodes().slice(), m = {}, E = b.pop();
-    for (; E; ) {
-      if (m[E]) f(E);
-      else {
-        m[E] = true, b.push(E);
-        for (let y of g(E)) b.push(y);
+      if (!u) {
+        for (; d < s.length - 1 && e.node(s[d + 1]).minRank <= r5.rank; ) d++;
+        l = s[d];
       }
-      E = b.pop();
+      l !== void 0 && e.setParent(t, l), t = e.successors(t)[0];
     }
+  });
+}
+function dt(e, n, t, r5) {
+  let o = [], i = [], s = Math.min(n[t].low, n[r5].low), a = Math.max(n[t].lim, n[r5].lim), d;
+  d = t;
+  do
+    d = e.parent(d), o.push(d);
+  while (d && (n[d].low > s || a > n[d].lim));
+  let l = d, u = r5;
+  for (; (u = e.parent(u)) !== l; ) i.push(u);
+  return { path: o.concat(i.reverse()), lca: l };
+}
+function lt(e) {
+  let n = {}, t = 0;
+  function r5(o) {
+    let i = t;
+    e.children(o).forEach(r5), n[o] = { low: i, lim: t++ };
   }
-  function l(f) {
-    let g = s.inEdges(f);
-    g ? i[f] = g.reduce((b, m) => {
-      var I;
-      let E = (I = i[m.v]) != null ? I : 0, y = s.edge(m);
-      return Math.max(b, E + (y !== void 0 ? y : 0));
-    }, 0) : i[f] = 0;
-  }
-  function u(f) {
-    let g = s.outEdges(f), b = Number.POSITIVE_INFINITY;
-    g && (b = g.reduce((E, y) => {
-      let I = i[y.w], be = s.edge(y);
-      return Math.min(E, (I !== void 0 ? I : 0) - (be !== void 0 ? be : 0));
-    }, Number.POSITIVE_INFINITY));
-    let m = e.node(f);
-    b !== Number.POSITIVE_INFINITY && m.borderType !== a && (i[f] = Math.max(i[f] !== void 0 ? i[f] : 0, b));
-  }
-  function c(f) {
-    return s.predecessors(f) || [];
-  }
-  function h(f) {
-    return s.successors(f) || [];
+  return e.children(_).forEach(r5), n;
+}
+function Ke(e) {
+  let n = w(e, "root", {}, "_root"), t = ut(e), r5 = Object.values(t), o = L(Math.max, r5) - 1, i = 2 * o + 1;
+  e.graph().nestingRoot = n, e.edges().forEach((a) => e.edge(a).minlen *= i);
+  let s = ct(e) + 1;
+  e.children(_).forEach((a) => $e(e, n, i, s, o, t, a)), e.graph().nodeRankFactor = i;
+}
+function $e(e, n, t, r5, o, i, s) {
+  var c;
+  let a = e.children(s);
+  if (!a.length) {
+    s !== n && e.setEdge(n, s, { weight: 0, minlen: t });
+    return;
   }
-  return d(l, c), d(u, h), Object.keys(r5).forEach((f) => {
-    var b;
-    let g = t[f];
-    g !== void 0 && (i[f] = (b = i[g]) != null ? b : 0);
-  }), i;
+  let d = q(e, "_bt"), l = q(e, "_bb"), u = e.node(s);
+  e.setParent(d, s), u.borderTop = d, e.setParent(l, s), u.borderBottom = l, a.forEach((h) => {
+    var y;
+    $e(e, n, t, r5, o, i, h);
+    let f = e.node(h), g = f.borderTop ? f.borderTop : h, b = f.borderBottom ? f.borderBottom : h, m = f.borderTop ? r5 : 2 * r5, E = g !== b ? 1 : o - ((y = i[s]) != null ? y : 0) + 1;
+    e.setEdge(d, g, { weight: m, minlen: E, nestingEdge: true }), e.setEdge(b, l, { weight: m, minlen: E, nestingEdge: true });
+  }), e.parent(s) || e.setEdge(n, d, { weight: 0, minlen: o + ((c = i[s]) != null ? c : 0) });
 }
-function Ct(e, n, t, r5) {
-  let o = new p(), i = e.graph(), s = jt(i.nodesep, i.edgesep, r5);
-  return n.forEach((a) => {
-    let d;
-    a.forEach((l) => {
-      let u = t[l];
-      if (u !== void 0) {
-        if (o.setNode(u), d !== void 0) {
-          let c = t[d];
-          if (c !== void 0) {
-            let h = o.edge(c, u);
-            o.setEdge(c, u, Math.max(s(e, l, d), h || 0));
-          }
-        }
-        d = l;
-      }
-    });
-  }), o;
+function ut(e) {
+  let n = {};
+  function t(r5, o) {
+    let i = e.children(r5);
+    i && i.length && i.forEach((s) => t(s, o + 1)), n[r5] = o;
+  }
+  return e.children(_).forEach((r5) => t(r5, 1)), n;
 }
-function Rt(e, n) {
-  return Object.values(n).reduce((t, r5) => {
-    let o = Number.NEGATIVE_INFINITY, i = Number.POSITIVE_INFINITY;
-    Object.entries(r5).forEach(([a, d]) => {
-      let l = St(e, a) / 2;
-      o = Math.max(d + l, o), i = Math.min(d - l, i);
-    });
-    let s = o - i;
-    return s < t[0] && (t = [s, r5]), t;
-  }, [Number.POSITIVE_INFINITY, null])[1];
+function ct(e) {
+  return e.edges().reduce((n, t) => n + e.edge(t).weight, 0);
 }
-function Pt(e, n) {
-  let t = Object.values(n), r5 = L(Math.min, t), o = L(Math.max, t);
-  ["u", "d"].forEach((i) => {
-    ["l", "r"].forEach((s) => {
-      let a = i + s, d = e[a];
-      if (!d || d === n) return;
-      let l = Object.values(d), u = r5 - L(Math.min, l);
-      s !== "l" && (u = o - L(Math.max, l)), u && (e[a] = O(d, (c) => c + u));
-    });
+function Je(e) {
+  let n = e.graph();
+  e.removeNode(n.nestingRoot), delete n.nestingRoot, e.edges().forEach((t) => {
+    e.edge(t).nestingEdge && e.removeEdge(t);
   });
 }
-function Mt(e, n = void 0) {
-  let t = e.ul;
-  return t ? O(t, (r5, o) => {
-    var s, a;
-    if (n) {
-      let d = n.toLowerCase(), l = e[d];
-      if (l && l[o] !== void 0) return l[o];
+var Ze = ft;
+function ft(e) {
+  function n(t) {
+    let r5 = e.children(t), o = e.node(t);
+    if (r5.length && r5.forEach(n), Object.hasOwn(o, "minRank")) {
+      o.borderLeft = [], o.borderRight = [];
+      for (let i = o.minRank, s = o.maxRank + 1; i < s; ++i) Qe(e, "borderLeft", "_bl", t, o, i), Qe(e, "borderRight", "_br", t, o, i);
     }
-    let i = Object.values(e).map((d) => {
-      let l = d[o];
-      return l !== void 0 ? l : 0;
-    }).sort((d, l) => d - l);
-    return (((s = i[1]) != null ? s : 0) + ((a = i[2]) != null ? a : 0)) / 2;
-  }) : {};
+  }
+  e.children(_).forEach(n);
 }
-function ln(e) {
-  let n = N(e), t = Object.assign(vt(e, n), _t(e, n)), r5 = {}, o;
-  ["u", "d"].forEach((s) => {
-    o = s === "u" ? n : Object.values(n).reverse(), ["l", "r"].forEach((a) => {
-      a === "r" && (o = o.map((c) => Object.values(c).reverse()));
-      let l = Ot(e, o, t, (c) => (s === "u" ? e.predecessors(c) : e.successors(c)) || []), u = It(e, o, l.root, l.align, a === "r");
-      a === "r" && (u = O(u, (c) => -c)), r5[s + a] = u;
-    });
-  });
-  let i = Rt(e, r5);
-  return Pt(r5, i), Mt(r5, e.graph().align);
+function Qe(e, n, t, r5, o, i) {
+  let s = { width: 0, height: 0, rank: i, borderType: n }, a = o[n][i - 1], d = w(e, "border", s, t);
+  o[n][i] = d, e.setParent(d, r5), a && e.setEdge(a, d, { weight: 1 });
 }
-function jt(e, n, t) {
-  return (r5, o, i) => {
-    let s = r5.node(o), a = r5.node(i), d = 0, l;
-    if (d += s.width / 2, Object.hasOwn(s, "labelpos")) switch (s.labelpos.toLowerCase()) {
-      case "l":
-        l = -s.width / 2;
-        break;
-      case "r":
-        l = s.width / 2;
-        break;
-    }
-    if (l && (d += t ? l : -l), l = void 0, d += (s.dummy ? n : e) / 2, d += (a.dummy ? n : e) / 2, d += a.width / 2, Object.hasOwn(a, "labelpos")) switch (a.labelpos.toLowerCase()) {
-      case "l":
-        l = a.width / 2;
-        break;
-      case "r":
-        l = -a.width / 2;
-        break;
-    }
-    return l && (d += t ? l : -l), d;
-  };
+function nn(e) {
+  var t;
+  let n = (t = e.graph().rankdir) == null ? void 0 : t.toLowerCase();
+  (n === "lr" || n === "rl") && rn(e);
 }
-function St(e, n) {
-  return e.node(n).width;
+function tn(e) {
+  var t;
+  let n = (t = e.graph().rankdir) == null ? void 0 : t.toLowerCase();
+  (n === "bt" || n === "rl") && bt(e), (n === "lr" || n === "rl") && (gt(e), rn(e));
 }
-function un(e) {
-  e = A(e), Ft(e), Object.entries(ln(e)).forEach(([n, t]) => e.node(n).x = t);
+function rn(e) {
+  e.nodes().forEach((n) => en(e.node(n))), e.edges().forEach((n) => en(e.edge(n)));
 }
-function Ft(e) {
-  let n = N(e), t = e.graph(), r5 = t.ranksep, o = t.rankalign, i = 0;
-  n.forEach((s) => {
-    let a = s.reduce((d, l) => {
-      var c;
-      let u = (c = e.node(l).height) != null ? c : 0;
-      return d > u ? d : u;
-    }, 0);
-    s.forEach((d) => {
-      let l = e.node(d);
-      o === "top" ? l.y = i + l.height / 2 : o === "bottom" ? l.y = i + a - l.height / 2 : l.y = i + a / 2;
-    }), i += a + r5;
+function en(e) {
+  let n = e.width;
+  e.width = e.height, e.height = n;
+}
+function bt(e) {
+  e.nodes().forEach((n) => ne(e.node(n))), e.edges().forEach((n) => {
+    var r5;
+    let t = e.edge(n);
+    (r5 = t.points) == null || r5.forEach(ne), Object.hasOwn(t, "y") && ne(t);
   });
 }
-function he(e, n = {}) {
-  let t = n.debugTiming ? P : M;
-  return t("layout", () => {
-    let r5 = t("  buildLayoutGraph", () => Xt(e));
-    return t("  runLayout", () => Dt(r5, t, n)), t("  updateInputGraph", () => At(e, r5)), r5;
+function ne(e) {
+  e.y = -e.y;
+}
+function gt(e) {
+  e.nodes().forEach((n) => te(e.node(n))), e.edges().forEach((n) => {
+    var r5;
+    let t = e.edge(n);
+    (r5 = t.points) == null || r5.forEach(te), Object.hasOwn(t, "x") && te(t);
   });
 }
-function Dt(e, n, t) {
-  n("    makeSpaceForEdgeLabels", () => Ut(e)), n("    removeSelfEdges", () => rr(e)), n("    acyclic", () => je(e)), n("    nestingGraph.run", () => Ke(e)), n("    rank", () => Xe(A(e))), n("    injectEdgeLabelProxies", () => Kt(e)), n("    removeEmptyRanks", () => Oe(e)), n("    nestingGraph.cleanup", () => Je(e)), n("    normalizeRanks", () => Te(e)), n("    assignRankMinMax", () => $t(e)), n("    removeEdgeLabelProxies", () => Jt(e)), n("    normalize.run", () => Fe(e)), n("    parentDummyChains", () => Ue(e)), n("    addBorderSegments", () => Ze(e)), n("    order", () => B(e, t)), n("    insertSelfEdges", () => or(e)), n("    adjustCoordinateSystem", () => nn(e)), n("    position", () => un(e)), n("    positionSelfEdges", () => ir(e)), n("    removeBorderNodes", () => tr(e)), n("    normalize.undo", () => De(e)), n("    fixupEdgeLabelCoords", () => er(e)), n("    undoCoordinateSystem", () => tn(e)), n("    translateGraph", () => Qt(e)), n("    assignNodeIntersects", () => Zt(e)), n("    reversePoints", () => nr(e)), n("    acyclic.undo", () => Se(e));
+function te(e) {
+  let n = e.x;
+  e.x = e.y, e.y = n;
 }
-function At(e, n) {
-  e.nodes().forEach((t) => {
-    let r5 = e.node(t), o = n.node(t);
-    r5 && (r5.x = o.x, r5.y = o.y, r5.order = o.order, r5.rank = o.rank, n.children(t).length && (r5.width = o.width, r5.height = o.height));
-  }), e.edges().forEach((t) => {
-    let r5 = e.edge(t), o = n.edge(t);
-    r5.points = o.points, Object.hasOwn(o, "x") && (r5.x = o.x, r5.y = o.y);
-  }), e.graph().width = n.graph().width, e.graph().height = n.graph().height;
+function re(e) {
+  let n = {}, t = e.nodes().filter((d) => !e.children(d).length), r5 = t.map((d) => e.node(d).rank), o = L(Math.max, r5), i = k(o + 1).map(() => []);
+  function s(d) {
+    if (n[d]) return;
+    n[d] = true;
+    let l = e.node(d);
+    i[l.rank].push(d);
+    let u = e.successors(d);
+    u && u.forEach(s);
+  }
+  return t.sort((d, l) => e.node(d).rank - e.node(l).rank).forEach(s), i;
 }
-var Vt = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"];
-var Wt = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "TB", rankalign: "center" };
-var Bt = ["acyclicer", "ranker", "rankdir", "align", "rankalign"];
-var Yt = ["width", "height", "rank"];
-var cn = { width: 0, height: 0 };
-var zt = ["minlen", "weight", "width", "height", "labeloffset"];
-var Ht = { minlen: 1, weight: 1, width: 0, height: 0, labeloffset: 10, labelpos: "r" };
-var qt = ["labelpos"];
-function Xt(e) {
-  let n = new p({ multigraph: true, compound: true }), t = ce(e.graph());
-  return n.setGraph(Object.assign({}, Wt, ue(t, Vt), T(t, Bt))), e.nodes().forEach((r5) => {
-    let o = ce(e.node(r5)), i = ue(o, Yt);
-    Object.keys(cn).forEach((a) => {
-      i[a] === void 0 && (i[a] = cn[a]);
-    }), n.setNode(r5, i);
-    let s = e.parent(r5);
-    s !== void 0 && n.setParent(r5, s);
-  }), e.edges().forEach((r5) => {
-    let o = ce(e.edge(r5));
-    n.setEdge(r5, Object.assign({}, Ht, ue(o, zt), T(o, qt)));
-  }), n;
+function oe(e, n) {
+  let t = 0;
+  for (let r5 = 1; r5 < n.length; ++r5) t += mt(e, n[r5 - 1], n[r5]);
+  return t;
 }
-function Ut(e) {
-  let n = e.graph();
-  n.ranksep /= 2, e.edges().forEach((t) => {
-    let r5 = e.edge(t);
-    r5.minlen *= 2, r5.labelpos.toLowerCase() !== "c" && (n.rankdir === "TB" || n.rankdir === "BT" ? r5.width += r5.labeloffset : r5.height += r5.labeloffset);
-  });
+function mt(e, n, t) {
+  let r5 = Re(t, t.map((l, u) => u)), o = n.flatMap((l) => {
+    let u = e.outEdges(l);
+    return u ? u.map((c) => ({ pos: r5[c.w], weight: e.edge(c).weight })).sort((c, h) => c.pos - h.pos) : [];
+  }), i = 1;
+  for (; i < t.length; ) i <<= 1;
+  let s = 2 * i - 1;
+  i -= 1;
+  let a = new Array(s).fill(0), d = 0;
+  return o.forEach((l) => {
+    let u = l.pos + i;
+    a[u] += l.weight;
+    let c = 0;
+    for (; u > 0; ) u % 2 && (c += a[u + 1]), u = u - 1 >> 1, a[u] += l.weight;
+    d += l.weight * c;
+  }), d;
 }
-function Kt(e) {
-  e.edges().forEach((n) => {
-    let t = e.edge(n);
-    if (t.width && t.height) {
-      let r5 = e.node(n.v), i = { rank: (e.node(n.w).rank - r5.rank) / 2 + r5.rank, e: n };
-      w(e, "edge-proxy", i, "_ep");
+function ie(e, n = []) {
+  return n.map((t) => {
+    let r5 = e.inEdges(t);
+    if (!r5 || !r5.length) return { v: t };
+    {
+      let o = r5.reduce((i, s) => {
+        let a = e.edge(s), d = e.node(s.v);
+        return { sum: i.sum + a.weight * d.order, weight: i.weight + a.weight };
+      }, { sum: 0, weight: 0 });
+      return { v: t, barycenter: o.sum / o.weight, weight: o.weight };
     }
   });
 }
-function $t(e) {
-  let n = 0;
-  e.nodes().forEach((t) => {
-    let r5 = e.node(t);
-    r5.borderTop && (r5.minRank = e.node(r5.borderTop).rank, r5.maxRank = e.node(r5.borderBottom).rank, n = Math.max(n, r5.maxRank));
-  }), e.graph().maxRank = n;
-}
-function Jt(e) {
-  e.nodes().forEach((n) => {
-    let t = e.node(n);
-    if (t.dummy === "edge-proxy") {
-      let r5 = t;
-      e.edge(r5.e).labelRank = t.rank, e.removeNode(n);
-    }
+function se(e, n) {
+  let t = {};
+  e.forEach((o, i) => {
+    let s = { indegree: 0, in: [], out: [], vs: [o.v], i };
+    o.barycenter !== void 0 && (s.barycenter = o.barycenter, s.weight = o.weight), t[o.v] = s;
+  }), n.edges().forEach((o) => {
+    let i = t[o.v], s = t[o.w];
+    i !== void 0 && s !== void 0 && (s.indegree++, i.out.push(s));
   });
+  let r5 = Object.values(t).filter((o) => !o.indegree);
+  return Et(r5);
 }
-function Qt(e) {
-  let n = Number.POSITIVE_INFINITY, t = 0, r5 = Number.POSITIVE_INFINITY, o = 0, i = e.graph(), s = i.marginx || 0, a = i.marginy || 0;
-  function d(l) {
-    let u = l.x, c = l.y, h = l.width, f = l.height;
-    n = Math.min(n, u - h / 2), t = Math.max(t, u + h / 2), r5 = Math.min(r5, c - f / 2), o = Math.max(o, c + f / 2);
+function Et(e) {
+  let n = [];
+  function t(o) {
+    return (i) => {
+      i.merged || (i.barycenter === void 0 || o.barycenter === void 0 || i.barycenter >= o.barycenter) && Lt(o, i);
+    };
   }
-  e.nodes().forEach((l) => d(e.node(l))), e.edges().forEach((l) => {
-    let u = e.edge(l);
-    Object.hasOwn(u, "x") && d(u);
-  }), n -= s, r5 -= a, e.nodes().forEach((l) => {
-    let u = e.node(l);
-    u.x -= n, u.y -= r5;
-  }), e.edges().forEach((l) => {
-    let u = e.edge(l);
-    u.points.forEach((c) => {
-      c.x -= n, c.y -= r5;
-    }), Object.hasOwn(u, "x") && (u.x -= n), Object.hasOwn(u, "y") && (u.y -= r5);
-  }), i.width = t - n + s, i.height = o - r5 + a;
+  function r5(o) {
+    return (i) => {
+      i.in.push(o), --i.indegree === 0 && e.push(i);
+    };
+  }
+  for (; e.length; ) {
+    let o = e.pop();
+    n.push(o), o.in.reverse().forEach(t(o)), o.out.forEach(r5(o));
+  }
+  return n.filter((o) => !o.merged).map((o) => T(o, ["vs", "i", "barycenter", "weight"]));
 }
-function Zt(e) {
-  e.edges().forEach((n) => {
-    let t = e.edge(n), r5 = e.node(n.v), o = e.node(n.w), i, s;
-    t.points ? (i = t.points[0], s = t.points[t.points.length - 1]) : (t.points = [], i = o, s = r5), t.points.unshift(H(r5, i)), t.points.push(H(o, s));
-  });
+function Lt(e, n) {
+  let t = 0, r5 = 0;
+  e.weight && (t += e.barycenter * e.weight, r5 += e.weight), n.weight && (t += n.barycenter * n.weight, r5 += n.weight), e.vs = n.vs.concat(e.vs), e.barycenter = t / r5, e.weight = r5, e.i = Math.min(n.i, e.i), n.merged = true;
 }
-function er(e) {
-  e.edges().forEach((n) => {
-    let t = e.edge(n);
-    if (Object.hasOwn(t, "x")) switch ((t.labelpos === "l" || t.labelpos === "r") && (t.width -= t.labeloffset), t.labelpos) {
-      case "l":
-        t.x -= t.width / 2 + t.labeloffset;
-        break;
-      case "r":
-        t.x += t.width / 2 + t.labeloffset;
-        break;
-    }
+function ae(e, n) {
+  let t = Ce(e, (u) => Object.hasOwn(u, "barycenter")), r5 = t.lhs, o = t.rhs.sort((u, c) => c.i - u.i), i = [], s = 0, a = 0, d = 0;
+  r5.sort(yt(!!n)), d = on(i, o, d), r5.forEach((u) => {
+    d += u.vs.length, i.push(u.vs), s += u.barycenter * u.weight, a += u.weight, d = on(i, o, d);
   });
+  let l = { vs: i.flat(1) };
+  return a && (l.barycenter = s / a, l.weight = a), l;
 }
-function nr(e) {
-  e.edges().forEach((n) => {
-    let t = e.edge(n);
-    t.reversed && t.points.reverse();
-  });
+function on(e, n, t) {
+  let r5;
+  for (; n.length && (r5 = n[n.length - 1]).i <= t; ) n.pop(), e.push(r5.vs), t++;
+  return t;
 }
-function tr(e) {
-  e.nodes().forEach((n) => {
-    if (e.children(n).length) {
-      let t = e.node(n), r5 = e.node(t.borderTop), o = e.node(t.borderBottom), i = e.node(t.borderLeft[t.borderLeft.length - 1]), s = e.node(t.borderRight[t.borderRight.length - 1]);
-      t.width = Math.abs(s.x - i.x), t.height = Math.abs(o.y - r5.y), t.x = i.x + t.width / 2, t.y = r5.y + t.height / 2;
-    }
-  }), e.nodes().forEach((n) => {
-    e.node(n).dummy === "border" && e.removeNode(n);
-  });
+function yt(e) {
+  return (n, t) => n.barycenter < t.barycenter ? -1 : n.barycenter > t.barycenter ? 1 : e ? t.i - n.i : n.i - t.i;
 }
-function rr(e) {
-  e.edges().forEach((n) => {
-    if (n.v === n.w) {
-      let t = e.node(n.v);
-      t.selfEdges || (t.selfEdges = []), t.selfEdges.push({ e: n, label: e.edge(n) }), e.removeEdge(n);
+function W(e, n, t, r5) {
+  let o = e.children(n), i = e.node(n), s = i ? i.borderLeft : void 0, a = i ? i.borderRight : void 0, d = {};
+  s && (o = o.filter((h) => h !== s && h !== a));
+  let l = ie(e, o);
+  l.forEach((h) => {
+    if (e.children(h.v).length) {
+      let f = W(e, h.v, t, r5);
+      d[h.v] = f, Object.hasOwn(f, "barycenter") && Nt(h, f);
     }
   });
+  let u = se(l, t);
+  wt(u, d);
+  let c = ae(u, r5);
+  if (s && a) {
+    c.vs = [s, c.vs, a].flat(1);
+    let h = e.predecessors(s);
+    if (h && h.length) {
+      let f = e.node(h[0]), g = e.predecessors(a), b = e.node(g[0]);
+      Object.hasOwn(c, "barycenter") || (c.barycenter = 0, c.weight = 0), c.barycenter = (c.barycenter * c.weight + f.order + b.order) / (c.weight + 2), c.weight += 2;
+    }
+  }
+  return c;
 }
-function or(e) {
-  N(e).forEach((t) => {
-    let r5 = 0;
-    t.forEach((o, i) => {
-      let s = e.node(o);
-      s.order = i + r5, (s.selfEdges || []).forEach((a) => {
-        w(e, "selfedge", { width: a.label.width, height: a.label.height, rank: s.rank, order: i + ++r5, e: a.e, label: a.label }, "_se");
-      }), delete s.selfEdges;
-    });
+function wt(e, n) {
+  e.forEach((t) => {
+    t.vs = t.vs.flatMap((r5) => n[r5] ? n[r5].vs : r5);
   });
 }
-function ir(e) {
-  e.nodes().forEach((n) => {
-    let t = e.node(n);
-    if (t.dummy === "selfedge") {
-      let r5 = t, o = e.node(r5.e.v), i = o.x + o.width / 2, s = o.y, a = t.x - i, d = o.height / 2;
-      e.setEdge(r5.e, r5.label), e.removeNode(n), r5.label.points = [{ x: i + 2 * a / 3, y: s - d }, { x: i + 5 * a / 6, y: s - d }, { x: i + a, y: s }, { x: i + 5 * a / 6, y: s + d }, { x: i + 2 * a / 3, y: s + d }], r5.label.x = t.x, r5.label.y = t.y;
+function Nt(e, n) {
+  e.barycenter !== void 0 ? (e.barycenter = (e.barycenter * e.weight + n.barycenter * n.weight) / (e.weight + n.weight), e.weight += n.weight) : (e.barycenter = n.barycenter, e.weight = n.weight);
+}
+function de(e, n, t, r5) {
+  r5 || (r5 = e.nodes());
+  let o = Gt(e), i = new p({ compound: true }).setGraph({ root: o }).setDefaultNodeLabel((s) => e.node(s));
+  return r5.forEach((s) => {
+    let a = e.node(s), d = e.parent(s);
+    if (a.rank === n || a.minRank <= n && n <= a.maxRank) {
+      i.setNode(s), i.setParent(s, d || o);
+      let l = e[t](s);
+      l && l.forEach((u) => {
+        let c = u.v === s ? u.w : u.v, h = i.edge(c, s), f = h !== void 0 ? h.weight : 0;
+        i.setEdge(c, s, { weight: e.edge(u).weight + f });
+      }), Object.hasOwn(a, "minRank") && i.setNode(s, { borderLeft: a.borderLeft[n], borderRight: a.borderRight[n] });
     }
-  });
+  }), i;
 }
-function ue(e, n) {
-  return O(T(e, n), Number);
+function Gt(e) {
+  let n;
+  for (; e.hasNode(n = j("_root")); ) ;
+  return n;
 }
-function ce(e) {
-  let n = {};
-  return e && Object.entries(e).forEach(([t, r5]) => {
-    typeof t == "string" && (t = t.toLowerCase()), n[t] = r5;
-  }), n;
+function le(e, n, t) {
+  let r5 = {}, o;
+  t.forEach((i) => {
+    let s = e.parent(i), a, d;
+    for (; s; ) {
+      if (a = e.parent(s), a ? (d = r5[a], r5[a] = s) : (d = o, o = s), d && d !== s) {
+        n.setEdge(d, s);
+        return;
+      }
+      s = a;
+    }
+  });
 }
-function fe(e) {
-  let n = N(e), t = new p({ compound: true, multigraph: true }).setGraph({});
-  return e.nodes().forEach((r5) => {
-    t.setNode(r5, { label: r5 }), t.setParent(r5, "layer" + e.node(r5).rank);
-  }), e.edges().forEach((r5) => t.setEdge(r5.v, r5.w, {}, r5.name)), n.forEach((r5, o) => {
-    let i = "layer" + o;
-    t.setNode(i, { rank: "same" }), r5.reduce((s, a) => (t.setEdge(s, a, { style: "invis" }), a));
-  }), t;
+function B(e, n = {}) {
+  if (typeof n.customOrder == "function") {
+    n.customOrder(e, B);
+    return;
+  }
+  let t = X(e), r5 = sn(e, k(1, t + 1), "inEdges"), o = sn(e, k(t - 1, -1, -1), "outEdges"), i = re(e);
+  if (an(e, i), n.disableOptimalOrderHeuristic) return;
+  let s = Number.POSITIVE_INFINITY, a, d = n.constraints || [];
+  for (let l = 0, u = 0; u < 4; ++l, ++u) {
+    kt(l % 2 ? r5 : o, l % 4 >= 2, d), i = N(e);
+    let c = oe(e, i);
+    c < s ? (u = 0, a = Object.assign({}, i), s = c) : c === s && (a = structuredClone(i));
+  }
+  an(e, a);
 }
-var sr = { graphlib: z, version: U, layout: he, debug: fe, util: { time: P, notime: M } };
-var To = sr;
-
-// src/blocks/autoLayout.ts
-function ensureGrid(items, edges, rankdir) {
-  const allPlaced = items.length > 0 && items.every((n) => n.col !== void 0 && n.row !== void 0);
-  if (allPlaced) {
-    return items.map((n) => ({ ...n, col: n.col, row: n.row }));
+function sn(e, n, t) {
+  let r5 = /* @__PURE__ */ new Map(), o = (i, s) => {
+    r5.has(i) || r5.set(i, []), r5.get(i).push(s);
+  };
+  for (let i of e.nodes()) {
+    let s = e.node(i);
+    if (typeof s.rank == "number" && o(s.rank, i), typeof s.minRank == "number" && typeof s.maxRank == "number") for (let a = s.minRank; a <= s.maxRank; a++) a !== s.rank && o(a, i);
   }
-  const grid = autoGrid(
-    items.map((n) => n.id),
-    edges,
-    rankdir
-  );
-  return items.map((n) => {
-    const g = grid.get(n.id) ?? { col: 1, row: 1 };
-    return { ...n, col: g.col, row: g.row };
+  return n.map(function(i) {
+    return de(e, i, t, r5.get(i) || []);
+  });
+}
+function kt(e, n, t) {
+  let r5 = new p();
+  e.forEach(function(o) {
+    t.forEach((a) => r5.setEdge(a.left, a.right));
+    let i = o.graph().root, s = W(o, i, r5, n);
+    s.vs.forEach((a, d) => o.node(a).order = d), le(o, r5, s.vs);
   });
 }
-function autoGrid(ids, edges, rankdir) {
-  const idSet = new Set(ids);
-  const g = new To.graphlib.Graph();
-  g.setGraph({ rankdir, nodesep: 16, ranksep: 16, marginx: 0, marginy: 0 });
-  g.setDefaultEdgeLabel(() => ({}));
-  for (const id of ids) g.setNode(id, { width: 10, height: 10 });
-  for (const e of edges) {
-    if (e.from !== e.to && idSet.has(e.from) && idSet.has(e.to)) g.setEdge(e.from, e.to);
+function an(e, n) {
+  Object.values(n).forEach((t) => t.forEach((r5, o) => e.node(r5).order = o));
+}
+function vt(e, n) {
+  let t = {};
+  function r5(o, i) {
+    let s = 0, a = 0, d = o.length, l = i[i.length - 1];
+    return i.forEach((u, c) => {
+      let h = xt(e, u), f = h ? e.node(h).order : d;
+      (h || u === l) && (i.slice(a, c + 1).forEach((g) => {
+        let b = e.predecessors(g);
+        b && b.forEach((m) => {
+          let E = e.node(m), y = E.order;
+          (y < s || f < y) && !(E.dummy && e.node(g).dummy) && dn(t, m, g);
+        });
+      }), a = c + 1, s = f);
+    }), i;
   }
-  To.layout(g);
-  const pos3 = ids.map((id) => {
-    const n = g.node(id);
-    return { id, x: Math.round(n?.x ?? 0), y: Math.round(n?.y ?? 0) };
-  });
-  const out = /* @__PURE__ */ new Map();
-  if (rankdir === "TB") {
-    const ranks = [...new Set(pos3.map((p2) => p2.y))].sort((a, b) => a - b);
-    ranks.forEach((yv, ri) => {
-      pos3.filter((p2) => p2.y === yv).sort((a, b) => a.x - b.x).forEach((p2, ci) => out.set(p2.id, { col: ci + 1, row: ri + 1 }));
-    });
-  } else {
-    const ranks = [...new Set(pos3.map((p2) => p2.x))].sort((a, b) => a - b);
-    ranks.forEach((xv, ci) => {
-      pos3.filter((p2) => p2.x === xv).sort((a, b) => a.y - b.y).forEach((p2, ri) => out.set(p2.id, { col: ci + 1, row: ri + 1 }));
+  return n.length && n.reduce(r5), t;
+}
+function _t(e, n) {
+  let t = {};
+  function r5(i, s, a, d, l) {
+    k(s, a).forEach((u) => {
+      let c = i[u];
+      if (c !== void 0 && e.node(c).dummy) {
+        let h = e.predecessors(c);
+        h && h.forEach((f) => {
+          if (f === void 0) return;
+          let g = e.node(f);
+          g.dummy && (g.order < d || g.order > l) && dn(t, f, c);
+        });
+      }
     });
   }
-  return out;
+  function o(i, s) {
+    let a = -1, d = -1, l = 0;
+    return s.forEach((u, c) => {
+      if (e.node(u).dummy === "border") {
+        let h = e.predecessors(u);
+        if (h && h.length) {
+          let f = h[0];
+          if (f === void 0) return;
+          d = e.node(f).order, r5(s, l, c, a, d), l = c, a = d;
+        }
+      }
+      r5(s, l, s.length, d, i.length);
+    }), s;
+  }
+  return n.length && n.reduce(o), t;
 }
-
-// src/blocks/flow.ts
-function flowRevealOrder(nodes, edges) {
-  const ids = new Set(nodes.map((n) => n.id));
-  const indeg = /* @__PURE__ */ new Map();
-  const outs = /* @__PURE__ */ new Map();
-  for (const n of nodes) {
-    indeg.set(n.id, 0);
-    outs.set(n.id, []);
+function xt(e, n) {
+  if (e.node(n).dummy) {
+    let t = e.predecessors(n);
+    if (t) return t.find((r5) => e.node(r5).dummy);
   }
-  for (const e of edges) {
-    if (!ids.has(e.from) || !ids.has(e.to) || e.from === e.to) continue;
-    indeg.set(e.to, (indeg.get(e.to) ?? 0) + 1);
-    outs.get(e.from)?.push(e.to);
+}
+function dn(e, n, t) {
+  if (n > t) {
+    let o = n;
+    n = t, t = o;
   }
-  let roots = nodes.filter((n) => n.kind === "start").map((n) => n.id);
-  if (roots.length === 0) roots = nodes.filter((n) => (indeg.get(n.id) ?? 0) === 0).map((n) => n.id);
-  if (roots.length === 0 && nodes[0] !== void 0) roots = [nodes[0].id];
-  const order = /* @__PURE__ */ new Map();
-  const queue = [...roots];
-  while (queue.length > 0) {
-    const id = queue.shift();
-    if (order.has(id)) continue;
-    order.set(id, order.size);
-    for (const to of outs.get(id) ?? []) {
-      const d = (indeg.get(to) ?? 0) - 1;
-      indeg.set(to, d);
-      if (d <= 0 && !order.has(to)) queue.push(to);
-    }
+  let r5 = e[n];
+  r5 || (e[n] = r5 = {}), r5[t] = true;
+}
+function Tt(e, n, t) {
+  if (n > t) {
+    let o = n;
+    n = t, t = o;
   }
-  for (const n of nodes) if (!order.has(n.id)) order.set(n.id, order.size);
-  return order;
+  let r5 = e[n];
+  return r5 !== void 0 && Object.hasOwn(r5, t);
 }
-var ERR_LABEL_RE = /^(no|fail|failed|error|reject|rejected)\b/i;
-var CELL_W = 160;
-var CELL_H = 64;
-var NODE_W = 150;
-var NODE_H = 52;
-function renderFlowSvg(data) {
-  const edges = data.edges ?? [];
-  const groups = data.groups ?? [];
-  const rawNodes = data.nodes ?? [];
-  const quick = !(rawNodes.length > 0 && rawNodes.every((n) => n.col !== void 0 && n.row !== void 0));
-  const nodes = ensureGrid(rawNodes, edges, data.dir ?? "LR");
-  const cellW = CELL_W;
-  const cellH = CELL_H;
-  const gapX = 56;
-  const gapY = 48;
-  const nestPad = nestingPads(groups);
-  const padX = (groups.length > 0 ? GROUP_PADS.padX : 22) + nestPad.padX;
-  const padTop = (groups.length > 0 ? GROUP_PADS.padTop : 22) + nestPad.padTop;
-  const padBot = (groups.length > 0 ? GROUP_PADS.padBot : 18) + nestPad.padBot;
-  const gx = groupExtent(groups);
-  const cols = Math.max(1, ...nodes.map((n) => n.col + ((n.w ?? 1) - 1)), gx.cols);
-  const rows = Math.max(1, ...nodes.map((n) => n.row), gx.rows);
-  const xOf = (c) => padX + (c - 1) * (cellW + gapX);
-  const yOf = (r5) => padTop + (r5 - 1) * (cellH + gapY);
-  const cellFor = (n) => ({
-    x: xOf(n.col),
-    y: yOf(n.row),
-    w: (n.w ?? 1) * cellW + ((n.w ?? 1) - 1) * gapX,
-    h: cellH
-  });
-  const boxFor = (n) => {
-    const c = cellFor(n);
-    if ((n.kind ?? "process") === "decision") return c;
-    const dx = (cellW - NODE_W) / 2;
-    const dy = (cellH - NODE_H) / 2;
-    return { x: c.x + dx, y: c.y + dy, w: c.w - dx * 2, h: NODE_H };
-  };
-  const byId = new Map(nodes.map((n) => [n.id, n]));
-  const width = padX * 2 + cols * cellW + (cols - 1) * gapX;
-  const height = padTop + rows * cellH + (rows - 1) * gapY + padBot;
-  const isErrEdge = (e) => e.kind === "error" || ERR_LABEL_RE.test(e.label ?? "");
-  const errTargets = new Set(edges.filter(isErrEdge).map((e) => e.to));
-  const accentIds = new Set(
-    nodes.filter((n) => n.kind === "end" && !errTargets.has(n.id) && !ERR_LABEL_RE.test(n.label)).map((n) => n.id)
-  );
-  const gridMeta = gridMetaAttrs({ quick, cols, rows, cellW, cellH, gapX, gapY, padX, padTop });
-  const a11y = svgName("Flowchart", data.title, [countPhrase(nodes.length, "step")]);
-  let s = `<svg viewBox="0 0 ${width} ${height}"${a11y.attrs}${gridMeta}>${a11y.title}`;
-  if (groups.length > 0) s += gridGroupsSvg(groups, { xOf, yOf, cellW, cellH, gapX, gapY, skin: true });
-  const used = { plain: false, dashed: false, error: false, accent: false };
-  const pending = [];
-  const lanes = edgeLanes(edges);
-  const order = flowRevealOrder(nodes, edges);
-  const stepOf = (id) => order.get(id) ?? 0;
-  const entries = entryPortOffsets(edges, (id) => {
-    const n = byId.get(id);
-    return n !== void 0 ? boxFor(n) : void 0;
-  });
-  s += `<g${bl("edges")}>`;
-  edges.forEach((e, ei) => {
-    const A2 = byId.get(e.from);
-    const B3 = byId.get(e.to);
-    if (!A2 || !B3) return;
-    const p2 = ortho(boxFor(A2), boxFor(B3), lanes[ei] ?? 0, entries[ei] ?? 0);
-    const isErr = isErrEdge(e);
-    const isAccent = !isErr && accentIds.has(e.to);
-    const isDashed = !isErr && e.kind === "dashed";
-    const stroke = isErr ? "var(--negative)" : isAccent ? "var(--accent)" : "var(--muted)";
-    const marker2 = isErr ? "skErr" : isAccent ? "skAccent" : isDashed ? "skOpen" : "skArrow";
-    const sw = isAccent ? 1.75 : 1.5;
-    const dash = isDashed ? ' stroke-dasharray="5 4"' : "";
-    if (isErr) used.error = true;
-    else if (isAccent) used.accent = true;
-    else if (isDashed) used.dashed = true;
-    else used.plain = true;
-    const reveal = Math.max(stepOf(e.from), stepOf(e.to));
-    s += `<path d="${p2.d}" fill="none" stroke="${stroke}" stroke-width="${sw}"${dash} marker-end="url(#${marker2})"${bp(`edges.${ei}`)}${revealAttr(reveal)}/>`;
-    pending.push({
-      lx: p2.lx,
-      ly: p2.ly,
-      ...e.label !== void 0 ? { label: e.label } : {},
-      err: isErr,
-      accent: isAccent,
-      path: `edges.${ei}`,
-      reveal
+function Ot(e, n, t, r5) {
+  let o = {}, i = {}, s = {};
+  return n.forEach((a) => {
+    a.forEach((d, l) => {
+      o[d] = d, i[d] = d, s[d] = l;
     });
-  });
-  s += `</g>`;
-  const kindsUsed = /* @__PURE__ */ new Set();
-  s += `<g${bl("nodes")}>`;
-  nodes.forEach((n, ni) => {
-    const kind = n.kind ?? "process";
-    kindsUsed.add(kind);
-    const r5 = boxFor(n);
-    const cx = r5.x + r5.w / 2;
-    const cy = r5.y + r5.h / 2;
-    const accent = accentIds.has(n.id);
-    const stroke = accent ? "var(--accent)" : kind === "start" ? "var(--rule-solid)" : "var(--ink)";
-    const sw = accent ? 1.5 : kind === "start" ? 1 : 1.5;
-    const fill = accent ? "var(--accent-tint)" : kind === "start" ? "var(--paper-2)" : "var(--paper)";
-    let shape;
-    if (kind === "decision") {
-      shape = `<polygon points="${cx},${r5.y} ${r5.x + r5.w},${cy} ${cx},${r5.y + r5.h} ${r5.x},${cy}" fill="${fill}" stroke="${stroke}" stroke-width="${sw}" stroke-linejoin="round"/>`;
-    } else if (kind === "start" || kind === "end") {
-      shape = `<rect x="${r5.x}" y="${r5.y}" width="${r5.w}" height="${r5.h}" rx="${r5.h / 2}" fill="${fill}" stroke="${stroke}" stroke-width="${sw}"/>`;
-    } else {
-      shape = `<rect x="${r5.x}" y="${r5.y}" width="${r5.w}" height="${r5.h}" rx="4" fill="${fill}" stroke="${stroke}" stroke-width="${sw}"/>`;
-    }
-    const nl = n.label.indexOf("\n");
-    const name = nl >= 0 ? n.label.slice(0, nl) : n.label;
-    const sub = nl >= 0 ? n.label.slice(nl + 1).replace(/\s+/g, " ").trim() : "";
-    const maxChars = kind === "decision" ? 18 : 20;
-    const lines = sub.length > 0 ? wrapText(name, maxChars, 1) : wrapText(name, maxChars, 2);
-    const tone = accent ? " c-accent" : "";
-    let texts = "";
-    if (sub.length > 0) {
-      texts = `<text x="${cx}" y="${cy - 1}" class="fc-label t-name${tone}">${escapeHtml(lines[0] ?? name)}</text><text x="${cx}" y="${cy + 12}" class="fc-sub t-sub" text-anchor="middle">${escapeHtml(sub)}</text>`;
-    } else {
-      texts = lines.map(
-        (ln2, j2) => `<text x="${cx}" y="${cy + 4.5 - (lines.length - 1) * 7.5 + j2 * 15}" class="fc-label t-name${tone}">${escapeHtml(ln2)}</text>`
-      ).join("");
+  }), n.forEach((a) => {
+    let d = -1;
+    a.forEach((l) => {
+      let u = r5(l);
+      if (u && u.length) {
+        let c = u.sort((f, g) => {
+          let b = s[f], m = s[g];
+          return (b !== void 0 ? b : 0) - (m !== void 0 ? m : 0);
+        }), h = (c.length - 1) / 2;
+        for (let f = Math.floor(h), g = Math.ceil(h); f <= g; ++f) {
+          let b = c[f];
+          if (b === void 0) continue;
+          let m = s[b];
+          if (m !== void 0 && i[l] === l && d < m && !Tt(t, l, b)) {
+            let E = o[b];
+            E !== void 0 && (i[b] = l, i[l] = o[l] = E, d = m);
+          }
+        }
+      }
+    });
+  }), { root: o, align: i };
+}
+function It(e, n, t, r5, o = false) {
+  let i = {}, s = Ct(e, n, t, o), a = o ? "borderLeft" : "borderRight";
+  function d(f, g) {
+    let b = s.nodes().slice(), m = {}, E = b.pop();
+    for (; E; ) {
+      if (m[E]) f(E);
+      else {
+        m[E] = true, b.push(E);
+        for (let y of g(E)) b.push(y);
+      }
+      E = b.pop();
     }
-    s += `<g${bp(`nodes.${ni}`)}${nodeCellAttrs(n.col, n.row, n.w ?? 1)}${revealAttr(stepOf(n.id))}>${shape}${texts}</g>`;
-  });
-  s += `</g>`;
-  const { overlay, legend: steps } = edgeLabelLayer(pending, nodes.map((n) => boxFor(n)), { skin: true });
-  s += overlay;
-  s += `</svg>`;
-  const items = [];
-  if (kindsUsed.has("start")) items.push({ swatch: "node-fill2", label: "start" });
-  if (kindsUsed.has("process")) items.push({ swatch: "node", label: "step" });
-  if (kindsUsed.has("decision")) items.push({ swatch: "node", label: "decision (diamond)" });
-  if (kindsUsed.has("end") && [...accentIds].length < nodes.filter((n) => n.kind === "end").length) {
-    items.push({ swatch: "node", label: "exit" });
   }
-  if (used.plain) items.push({ swatch: "edge", label: "next" });
-  if (used.dashed) items.push({ swatch: "edge-dashed", label: "optional" });
-  if (used.error) items.push({ swatch: "edge-error", label: "error path" });
-  if (accentIds.size > 0) items.push({ swatch: "node-accent", label: "happy path" });
-  return { svg: s + steps, legend: renderLegend(items) };
-}
-function renderFlowFrame(data, tag) {
-  const { svg, legend } = renderFlowSvg(data);
-  return diagramFrame(
-    {
-      tag,
-      ...data.title !== void 0 ? { title: data.title } : {},
-      ...data.description !== void 0 ? { desc: data.description } : {},
-      ...legend.length > 0 ? { legendHtml: legend } : {}
-    },
-    svg
-  );
+  function l(f) {
+    let g = s.inEdges(f);
+    g ? i[f] = g.reduce((b, m) => {
+      var I;
+      let E = (I = i[m.v]) != null ? I : 0, y = s.edge(m);
+      return Math.max(b, E + (y !== void 0 ? y : 0));
+    }, 0) : i[f] = 0;
+  }
+  function u(f) {
+    let g = s.outEdges(f), b = Number.POSITIVE_INFINITY;
+    g && (b = g.reduce((E, y) => {
+      let I = i[y.w], be = s.edge(y);
+      return Math.min(E, (I !== void 0 ? I : 0) - (be !== void 0 ? be : 0));
+    }, Number.POSITIVE_INFINITY));
+    let m = e.node(f);
+    b !== Number.POSITIVE_INFINITY && m.borderType !== a && (i[f] = Math.max(i[f] !== void 0 ? i[f] : 0, b));
+  }
+  function c(f) {
+    return s.predecessors(f) || [];
+  }
+  function h(f) {
+    return s.successors(f) || [];
+  }
+  return d(l, c), d(u, h), Object.keys(r5).forEach((f) => {
+    var b;
+    let g = t[f];
+    g !== void 0 && (i[f] = (b = i[g]) != null ? b : 0);
+  }), i;
 }
-function renderFlow(data) {
-  return renderFlowFrame(data, data.variant === "dag" ? "DAG" : "FLOW");
+function Ct(e, n, t, r5) {
+  let o = new p(), i = e.graph(), s = jt(i.nodesep, i.edgesep, r5);
+  return n.forEach((a) => {
+    let d;
+    a.forEach((l) => {
+      let u = t[l];
+      if (u !== void 0) {
+        if (o.setNode(u), d !== void 0) {
+          let c = t[d];
+          if (c !== void 0) {
+            let h = o.edge(c, u);
+            o.setEdge(c, u, Math.max(s(e, l, d), h || 0));
+          }
+        }
+        d = l;
+      }
+    });
+  }), o;
 }
-
-// src/blocks/state.ts
-var ERR_RE = /\b(error|fail|failed|failure|reject|rejected|cancel|cancelled|canceled|abort|aborted|timeout|timed out|expired|dead)\b/i;
-function nameLines(s) {
-  return wrapText(s.name ?? "", 23, 3);
+function Rt(e, n) {
+  return Object.values(n).reduce((t, r5) => {
+    let o = Number.NEGATIVE_INFINITY, i = Number.POSITIVE_INFINITY;
+    Object.entries(r5).forEach(([a, d]) => {
+      let l = St(e, a) / 2;
+      o = Math.max(d + l, o), i = Math.min(d - l, i);
+    });
+    let s = o - i;
+    return s < t[0] && (t = [s, r5]), t;
+  }, [Number.POSITIVE_INFINITY, null])[1];
 }
-function rectFor(s, cellW, cellH, gapX, gapY, padX, padTop) {
-  const cx = padX + (s.col - 1) * (cellW + gapX) + cellW / 2;
-  const cy = padTop + (s.row - 1) * (cellH + gapY) + cellH / 2;
-  if (s.kind === "start" || s.kind === "terminal") {
-    return { x: cx - 13, y: cy - 13, w: 26, h: 26, cx, cy };
-  }
-  const lines = nameLines(s);
-  const longest2 = Math.max(0, ...lines.map((ln2) => ln2.length));
-  const pw = Math.max(96, Math.min(longest2 * 8 + 26, cellW + gapX - 26));
-  const ph = 46 + (Math.max(1, lines.length) - 1) * 15;
-  return { x: cx - pw / 2, y: cy - ph / 2, w: pw, h: ph, cx, cy };
+function Pt(e, n) {
+  let t = Object.values(n), r5 = L(Math.min, t), o = L(Math.max, t);
+  ["u", "d"].forEach((i) => {
+    ["l", "r"].forEach((s) => {
+      let a = i + s, d = e[a];
+      if (!d || d === n) return;
+      let l = Object.values(d), u = r5 - L(Math.min, l);
+      s !== "l" && (u = o - L(Math.max, l)), u && (e[a] = O(d, (c) => c + u));
+    });
+  });
 }
-function pillCls(kind) {
-  if (kind === "terminal") return "pill pill-end";
-  if (kind === "wait") return "pill pill-wait";
-  if (kind === "start") return "pill pill-init";
-  return "pill pill-active";
+function Mt(e, n = void 0) {
+  let t = e.ul;
+  return t ? O(t, (r5, o) => {
+    var s, a;
+    if (n) {
+      let d = n.toLowerCase(), l = e[d];
+      if (l && l[o] !== void 0) return l[o];
+    }
+    let i = Object.values(e).map((d) => {
+      let l = d[o];
+      return l !== void 0 ? l : 0;
+    }).sort((d, l) => d - l);
+    return (((s = i[1]) != null ? s : 0) + ((a = i[2]) != null ? a : 0)) / 2;
+  }) : {};
 }
-function renderState(data) {
-  const trans = data.transitions ?? [];
-  const rawStates = data.states ?? [];
-  const quick = !(rawStates.length > 0 && rawStates.every((n) => n.col !== void 0 && n.row !== void 0));
-  const states = ensureGrid(rawStates, trans, data.dir ?? "LR");
-  const cellW = 168;
-  const cellH = 64;
-  const gapX = 74;
-  const gapY = 60;
-  const groups = data.groups ?? [];
-  const nestPad = nestingPads(groups);
-  const padX = (groups.length > 0 ? GROUP_PADS.padX : 30) + nestPad.padX;
-  const padTop = (groups.length > 0 ? GROUP_PADS.padTop : 30) + nestPad.padTop;
-  const padBot = (groups.length > 0 ? GROUP_PADS.padBot : 20) + nestPad.padBot;
-  const gx = groupExtent(groups);
-  const cols = Math.max(1, ...states.map((s2) => s2.col), gx.cols);
-  const rows = Math.max(1, ...states.map((s2) => s2.row), gx.rows);
-  const width = padX * 2 + cols * cellW + (cols - 1) * gapX;
-  const height = padTop * 2 + rows * cellH + (rows - 1) * gapY + padBot;
-  const byId = new Map(states.map((s2) => [s2.id, s2]));
-  const isErrTerminal = (s2) => s2 !== void 0 && s2.kind === "terminal" && (ERR_RE.test(s2.name ?? "") || ERR_RE.test(s2.id));
-  const successExits = states.filter((s2) => s2.kind === "terminal" && !isErrTerminal(s2));
-  const accentId = successExits.length === 1 ? successExits[0]?.id : void 0;
-  const gridMeta = gridMetaAttrs({ quick, cols, rows, cellW, cellH, gapX, gapY, padX, padTop });
-  const a11y = svgName("State machine", data.title, [
-    countPhrase(states.length, "state"),
-    countPhrase(trans.length, "transition")
-  ]);
-  let s = `<svg viewBox="0 0 ${width} ${height}"${a11y.attrs}${gridMeta}>${a11y.title}`;
-  if (groups.length > 0) {
-    const xOf = (c) => padX + (c - 1) * (cellW + gapX);
-    const yOf = (r5) => padTop + (r5 - 1) * (cellH + gapY);
-    s += gridGroupsSvg(groups, { xOf, yOf, cellW, cellH, gapX, gapY, skin: true });
-  }
-  const numbered = trans.length >= 4;
-  const labels = [];
-  const used = { plain: false, error: false, accent: false };
-  const lanes = edgeLanes(trans);
-  const avoid = states.map((st2) => {
-    const r5 = rectFor(st2, cellW, cellH, gapX, gapY, padX, padTop);
-    return { x: r5.x, y: r5.y, w: r5.w, h: r5.h };
-  });
-  const entries = entryPortOffsets(trans, (id) => {
-    const n = byId.get(id);
-    return n !== void 0 ? rectFor(n, cellW, cellH, gapX, gapY, padX, padTop) : void 0;
+function ln(e) {
+  let n = N(e), t = Object.assign(vt(e, n), _t(e, n)), r5 = {}, o;
+  ["u", "d"].forEach((s) => {
+    o = s === "u" ? n : Object.values(n).reverse(), ["l", "r"].forEach((a) => {
+      a === "r" && (o = o.map((c) => Object.values(c).reverse()));
+      let l = Ot(e, o, t, (c) => (s === "u" ? e.predecessors(c) : e.successors(c)) || []), u = It(e, o, l.root, l.align, a === "r");
+      a === "r" && (u = O(u, (c) => -c)), r5[s + a] = u;
+    });
   });
-  trans.forEach((t, ti) => {
-    const A2 = byId.get(t.from);
-    const B3 = byId.get(t.to);
-    if (!A2 || !B3) return;
-    const label = t.event + (t.guard !== void 0 ? ` ${t.guard}` : "");
-    const isErr = isErrTerminal(B3);
-    const isAccent = !isErr && accentId !== void 0 && t.to === accentId;
-    const stroke = isErr ? "var(--negative)" : isAccent ? "var(--accent)" : "var(--muted)";
-    const marker2 = isErr ? "skErr" : isAccent ? "skAccent" : "skArrow";
-    const sw = isAccent ? 1.75 : 1.5;
-    const tone = isErr ? "error" : isAccent ? "accent" : "muted";
-    if (isErr) used.error = true;
-    else if (isAccent) used.accent = true;
-    else used.plain = true;
-    const tAttrs = bp(`transitions.${ti}`) + revealAttr(ti);
-    if (t.from === t.to) {
-      const r5 = rectFor(A2, cellW, cellH, gapX, gapY, padX, padTop);
-      s += `<path d="M ${r5.cx - 12} ${r5.y} C ${r5.cx - 30} ${r5.y - 32}, ${r5.cx + 30} ${r5.y - 32}, ${r5.cx + 12} ${r5.y}" fill="none" stroke="${stroke}" stroke-width="${sw}" marker-end="url(#${marker2})"${tAttrs}/>`;
-      const at2 = { lx: r5.cx, ly: r5.y - 28 };
-      const mark2 = numbered ? edgeStep(at2, ti + 1, isErr, true) : edgeMask(at2, label, tone);
-      labels.push(`<g${tAttrs}>${mark2}</g>`);
-      return;
+  let i = Rt(e, r5);
+  return Pt(r5, i), Mt(r5, e.graph().align);
+}
+function jt(e, n, t) {
+  return (r5, o, i) => {
+    let s = r5.node(o), a = r5.node(i), d = 0, l;
+    if (d += s.width / 2, Object.hasOwn(s, "labelpos")) switch (s.labelpos.toLowerCase()) {
+      case "l":
+        l = -s.width / 2;
+        break;
+      case "r":
+        l = s.width / 2;
+        break;
     }
-    const p2 = ortho(
-      rectFor(A2, cellW, cellH, gapX, gapY, padX, padTop),
-      rectFor(B3, cellW, cellH, gapX, gapY, padX, padTop),
-      lanes[ti] ?? 0,
-      entries[ti] ?? 0
-    );
-    s += `<path d="${p2.d}" fill="none" stroke="${stroke}" stroke-width="${sw}" marker-end="url(#${marker2})"${tAttrs}/>`;
-    const mark = numbered ? edgeStep(dodge(p2.lx, p2.ly, avoid), ti + 1, isErr, true) : edgeMask(p2, label, tone);
-    labels.push(`<g${tAttrs}>${mark}</g>`);
+    if (l && (d += t ? l : -l), l = void 0, d += (s.dummy ? n : e) / 2, d += (a.dummy ? n : e) / 2, d += a.width / 2, Object.hasOwn(a, "labelpos")) switch (a.labelpos.toLowerCase()) {
+      case "l":
+        l = a.width / 2;
+        break;
+      case "r":
+        l = -a.width / 2;
+        break;
+    }
+    return l && (d += t ? l : -l), d;
+  };
+}
+function St(e, n) {
+  return e.node(n).width;
+}
+function un(e) {
+  e = A(e), Ft(e), Object.entries(ln(e)).forEach(([n, t]) => e.node(n).x = t);
+}
+function Ft(e) {
+  let n = N(e), t = e.graph(), r5 = t.ranksep, o = t.rankalign, i = 0;
+  n.forEach((s) => {
+    let a = s.reduce((d, l) => {
+      var c;
+      let u = (c = e.node(l).height) != null ? c : 0;
+      return d > u ? d : u;
+    }, 0);
+    s.forEach((d) => {
+      let l = e.node(d);
+      o === "top" ? l.y = i + l.height / 2 : o === "bottom" ? l.y = i + a - l.height / 2 : l.y = i + a / 2;
+    }), i += a + r5;
   });
-  const kinds = { active: false, wait: false, start: false, end: false, errEnd: false };
-  s += `<g${bl("states")}>`;
-  states.forEach((st2, si) => {
-    const r5 = rectFor(st2, cellW, cellH, gapX, gapY, padX, padTop);
-    const place = nodeCellAttrs(st2.col, st2.row);
-    if (st2.kind === "start") {
-      kinds.start = true;
-      s += `<circle cx="${r5.cx}" cy="${r5.cy}" r="10" fill="var(--ink)"${bp(`states.${si}`)}${place}/>`;
-    } else if (st2.kind === "terminal") {
-      const accent = st2.id === accentId;
-      const err = isErrTerminal(st2);
-      if (err) kinds.errEnd = true;
-      else if (!accent) kinds.end = true;
-      const tone = accent ? "var(--accent)" : err ? "var(--negative)" : "var(--ink)";
-      const fill = accent ? "var(--accent-tint)" : err ? "var(--negative-tint)" : "var(--paper)";
-      s += `<g${bp(`states.${si}`)}${place}><circle cx="${r5.cx}" cy="${r5.cy}" r="12" fill="${fill}" stroke="${tone}" stroke-width="1.5"/><circle cx="${r5.cx}" cy="${r5.cy}" r="6" fill="${tone}"/></g>`;
-    } else {
-      const wait = st2.kind === "wait";
-      if (wait) kinds.wait = true;
-      else kinds.active = true;
-      const fill = wait ? "var(--paper-2)" : "var(--paper)";
-      const stroke = wait ? "var(--rule-solid)" : "var(--ink)";
-      const sw = wait ? 1 : 1.5;
-      const lines = nameLines(st2);
-      const nameText = lines.length <= 1 ? `<text x="${r5.cx}" y="${r5.cy + 4.5}" class="t-name" text-anchor="middle"${bp(`states.${si}.name`)}>${escapeHtml(st2.name ?? "")}</text>` : `<g${bp(`states.${si}.name`)}>` + lines.map(
-        (ln2, j2) => `<text x="${r5.cx}" y="${r5.cy + 4.5 - (lines.length - 1) * 7.5 + j2 * 15}" class="t-name" text-anchor="middle">${escapeHtml(ln2)}</text>`
-      ).join("") + `</g>`;
-      s += `<g${bp(`states.${si}`)}${place}><rect x="${r5.x}" y="${r5.y}" width="${r5.w}" height="${r5.h}" rx="23" fill="${fill}" stroke="${stroke}" stroke-width="${sw}"/>` + nameText + `</g>`;
+}
+function he(e, n = {}) {
+  let t = n.debugTiming ? P : M;
+  return t("layout", () => {
+    let r5 = t("  buildLayoutGraph", () => Xt(e));
+    return t("  runLayout", () => Dt(r5, t, n)), t("  updateInputGraph", () => At(e, r5)), r5;
+  });
+}
+function Dt(e, n, t) {
+  n("    makeSpaceForEdgeLabels", () => Ut(e)), n("    removeSelfEdges", () => rr(e)), n("    acyclic", () => je(e)), n("    nestingGraph.run", () => Ke(e)), n("    rank", () => Xe(A(e))), n("    injectEdgeLabelProxies", () => Kt(e)), n("    removeEmptyRanks", () => Oe(e)), n("    nestingGraph.cleanup", () => Je(e)), n("    normalizeRanks", () => Te(e)), n("    assignRankMinMax", () => $t(e)), n("    removeEdgeLabelProxies", () => Jt(e)), n("    normalize.run", () => Fe(e)), n("    parentDummyChains", () => Ue(e)), n("    addBorderSegments", () => Ze(e)), n("    order", () => B(e, t)), n("    insertSelfEdges", () => or(e)), n("    adjustCoordinateSystem", () => nn(e)), n("    position", () => un(e)), n("    positionSelfEdges", () => ir(e)), n("    removeBorderNodes", () => tr(e)), n("    normalize.undo", () => De(e)), n("    fixupEdgeLabelCoords", () => er(e)), n("    undoCoordinateSystem", () => tn(e)), n("    translateGraph", () => Qt(e)), n("    assignNodeIntersects", () => Zt(e)), n("    reversePoints", () => nr(e)), n("    acyclic.undo", () => Se(e));
+}
+function At(e, n) {
+  e.nodes().forEach((t) => {
+    let r5 = e.node(t), o = n.node(t);
+    r5 && (r5.x = o.x, r5.y = o.y, r5.order = o.order, r5.rank = o.rank, n.children(t).length && (r5.width = o.width, r5.height = o.height));
+  }), e.edges().forEach((t) => {
+    let r5 = e.edge(t), o = n.edge(t);
+    r5.points = o.points, Object.hasOwn(o, "x") && (r5.x = o.x, r5.y = o.y);
+  }), e.graph().width = n.graph().width, e.graph().height = n.graph().height;
+}
+var Vt = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"];
+var Wt = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "TB", rankalign: "center" };
+var Bt = ["acyclicer", "ranker", "rankdir", "align", "rankalign"];
+var Yt = ["width", "height", "rank"];
+var cn = { width: 0, height: 0 };
+var zt = ["minlen", "weight", "width", "height", "labeloffset"];
+var Ht = { minlen: 1, weight: 1, width: 0, height: 0, labeloffset: 10, labelpos: "r" };
+var qt = ["labelpos"];
+function Xt(e) {
+  let n = new p({ multigraph: true, compound: true }), t = ce(e.graph());
+  return n.setGraph(Object.assign({}, Wt, ue(t, Vt), T(t, Bt))), e.nodes().forEach((r5) => {
+    let o = ce(e.node(r5)), i = ue(o, Yt);
+    Object.keys(cn).forEach((a) => {
+      i[a] === void 0 && (i[a] = cn[a]);
+    }), n.setNode(r5, i);
+    let s = e.parent(r5);
+    s !== void 0 && n.setParent(r5, s);
+  }), e.edges().forEach((r5) => {
+    let o = ce(e.edge(r5));
+    n.setEdge(r5, Object.assign({}, Ht, ue(o, zt), T(o, qt)));
+  }), n;
+}
+function Ut(e) {
+  let n = e.graph();
+  n.ranksep /= 2, e.edges().forEach((t) => {
+    let r5 = e.edge(t);
+    r5.minlen *= 2, r5.labelpos.toLowerCase() !== "c" && (n.rankdir === "TB" || n.rankdir === "BT" ? r5.width += r5.labeloffset : r5.height += r5.labeloffset);
+  });
+}
+function Kt(e) {
+  e.edges().forEach((n) => {
+    let t = e.edge(n);
+    if (t.width && t.height) {
+      let r5 = e.node(n.v), i = { rank: (e.node(n.w).rank - r5.rank) / 2 + r5.rank, e: n };
+      w(e, "edge-proxy", i, "_ep");
     }
   });
-  s += `</g>`;
-  s += labels.join("");
-  s += `</svg>`;
-  const name = (id) => byId.get(id)?.name ?? id;
-  const numCell = (ti) => numbered ? `<td class="t-num"><span class="edge-step"><b>${ti + 1}</b></span></td>` : "";
-  const rows2 = trans.map(
-    (t, ti) => `<tr${bp(`transitions.${ti}`)}${revealAttr(ti)}>` + numCell(ti) + `<td><span class="${pillCls(byId.get(t.from)?.kind)}">${escapeHtml(name(t.from))}</span></td><td style="font-family:var(--font-mono);font-size:11px"${bp(`transitions.${ti}.event`)}>${escapeHtml(t.event)}</td><td class="c-soft" style="font-size:11px"${bp(`transitions.${ti}.guard`)}>${escapeHtml(t.guard ?? "\u2014")}</td><td><span class="${pillCls(byId.get(t.to)?.kind)}">${escapeHtml(name(t.to))}</span></td></tr>`
-  ).join("");
-  const table = trans.length > 0 ? `<table class="transition-table"><thead><tr>${numbered ? "<th>\u2116</th>" : ""}<th>From</th><th>Event</th><th>Guard</th><th>To</th></tr></thead><tbody${bl("transitions")}>${rows2}</tbody></table>` : "";
-  const items = [];
-  if (kinds.start) items.push({ swatch: "chip", chip: "\u25CF", label: "start" });
-  if (kinds.active) items.push({ swatch: "node", label: "state" });
-  if (kinds.wait) items.push({ swatch: "node-fill2", label: "waiting" });
-  if (kinds.end) items.push({ swatch: "chip", chip: "\u25C9", label: "end" });
-  if (used.plain) items.push({ swatch: "edge", label: "transition" });
-  if (kinds.errEnd) items.push({ swatch: "node-negative", label: "error exit" });
-  if (used.error) items.push({ swatch: "edge-error", label: "error transition" });
-  if (accentId !== void 0) items.push({ swatch: "node-accent", label: "success exit" });
-  const legend = renderLegend(items);
-  return diagramFrame(
-    {
-      tag: "STATE",
-      ...data.title !== void 0 ? { title: data.title } : {},
-      ...data.description !== void 0 ? { desc: data.description } : {},
-      ...legend.length > 0 ? { legendHtml: legend } : {},
-      ...table.length > 0 ? { footerHtml: table } : {}
-    },
-    s
-  );
 }
-
-// src/svg/glyphs.ts
-var GENERIC_BOX = "box";
-var PATHS = {
-  // λ
-  function: "M3 2 H5 L10.5 12 M7.6 7 L3.5 12",
-  // pail: elliptical rim, tapered sides
-  bucket: "M2 3.5 a5 1.6 0 0 0 10 0 a5 1.6 0 0 0 -10 0 M2 3.5 L3.5 12.5 H10.5 L12 3.5",
-  // three message bars
-  queue: "M3 1.5 V12.5 M7 1.5 V12.5 M11 1.5 V12.5",
-  // one in, fan out to three
-  topic: "M1.5 7 H5.5 M5.5 7 L11.5 2.5 M5.5 7 H12 M5.5 7 L11.5 11.5",
-  // stacked memory slabs
-  cache: "M1.5 4.5 L7 2 L12.5 4.5 L7 7 Z M1.5 8 L7 10.5 L12.5 8 M1.5 11 L7 13.5 L12.5 11",
-  // the cylinder
-  db: "M1.5 3 a5.5 2.2 0 0 0 11 0 a5.5 2.2 0 0 0 -11 0 V11 a5.5 2.2 0 0 0 11 0 V3",
-  // cloud
-  cdn: "M3.5 12 a3 3 0 0 1 0.3 -6 a4 4 0 0 1 7.6 1 a2.5 2.5 0 0 1 0.6 5 Z",
-  // splitter: one lane in, three out
-  lb: "M1.5 7 H5 M5 7 L9 3 H12.5 M5 7 H12.5 M5 7 L9 11 H12.5",
-  // double chevron
-  gateway: "M2 1.5 L7 7 L2 12.5 M7.5 1.5 L12.5 7 L7.5 12.5",
-  // hexagon with a core
-  pod: "M7 1.2 L12.2 4.1 V9.9 L7 12.8 L1.8 9.9 V4.1 Z M5.2 7 a1.8 1.8 0 1 0 3.6 0 a1.8 1.8 0 1 0 -3.6 0",
-  // wheel: ring + four spokes
-  cluster: "M1.5 7 a5.5 5.5 0 1 0 11 0 a5.5 5.5 0 1 0 -11 0 M7 1.5 V4.5 M7 9.5 V12.5 M1.5 7 H4.5 M9.5 7 H12.5",
-  // head + shoulders
-  user: "M4.5 4.5 a2.5 2.5 0 1 0 5 0 a2.5 2.5 0 1 0 -5 0 M2.5 13 a4.5 4.5 0 0 1 9 0",
-  // window with a header band
-  browser: "M1.5 2.5 H12.5 V11.5 H1.5 Z M1.5 5.5 H12.5",
-  // phone
-  mobile: "M4 1.5 H10 a1 1 0 0 1 1 1 V11.5 a1 1 0 0 1 -1 1 H4 a1 1 0 0 1 -1 -1 V2.5 a1 1 0 0 1 1 -1 Z M6 11 H8",
-  // clock
-  cron: "M1.5 7 a5.5 5.5 0 1 0 11 0 a5.5 5.5 0 1 0 -11 0 M7 3.5 V7 L9.5 8.5",
-  // four-point spark
-  ml: "M7 1.5 L8.4 5.6 L12.5 7 L8.4 8.4 L7 12.5 L5.6 8.4 L1.5 7 L5.6 5.6 Z",
-  // padlock
-  secret: "M3 6.5 H11 V13 H3 Z M4.5 6.5 V4.5 a2.5 2.5 0 0 1 5 0 V6.5",
-  // three sliders
-  config: "M1.5 3.5 H12.5 M1.5 7 H12.5 M1.5 10.5 H12.5 M4.5 2 V5 M9.5 5.5 V8.5 M6 9 V12",
-  // replica set: two overlapping squares
-  deployment: "M1.5 5 H9 V12.5 H1.5 Z M4 5 V2.5 H11.5 V10 H9",
-  // arrow into a door
-  ingress: "M1.5 7 H8 M5.5 4.5 L8 7 L5.5 9.5 M10 1.5 H12.5 V12.5 H10",
-  // two rack slabs
-  node: "M2 2 H12 V6 H2 Z M2 8 H12 V12 H2 Z M4.5 4 H6.5 M4.5 10 H6.5",
-  // folder tab
-  namespace: "M1.5 3.5 H5.5 L7 5 H12.5 V12 H1.5 Z",
-  box: "M2 2 H12 V12 H2 Z"
-};
-var ALIAS = {
-  function: "function",
-  lambda: "function",
-  bucket: "bucket",
-  s3: "bucket",
-  blob: "bucket",
-  object: "bucket",
-  queue: "queue",
-  sqs: "queue",
-  mq: "queue",
-  broker: "queue",
-  rabbitmq: "queue",
-  topic: "topic",
-  sns: "topic",
-  kafka: "topic",
-  kinesis: "topic",
-  stream: "topic",
-  cache: "cache",
-  redis: "cache",
-  memcached: "cache",
-  db: "db",
-  database: "db",
-  store: "db",
-  postgres: "db",
-  mysql: "db",
-  mongo: "db",
-  mongodb: "db",
-  dynamo: "db",
-  cdn: "cdn",
-  lb: "lb",
-  gateway: "gateway",
-  proxy: "gateway",
-  pod: "pod",
-  cluster: "cluster",
-  user: "user",
-  person: "user",
-  actor: "user",
-  browser: "browser",
-  web: "browser",
-  mobile: "mobile",
-  cron: "cron",
-  scheduler: "cron",
-  job: "cron",
-  cronjob: "cron",
-  ml: "ml",
-  model: "ml",
-  llm: "ml",
-  agent: "ml",
-  ai: "ml",
-  secret: "secret",
-  secrets: "secret",
-  vault: "secret",
-  kms: "secret",
-  config: "config",
-  configmap: "config",
-  settings: "config",
-  deployment: "deployment",
-  ingress: "ingress",
-  node: "node",
-  vm: "node",
-  server: "node",
-  host: "node",
-  namespace: "namespace"
-};
-function glyphNameFor(kind) {
-  return ALIAS[(kind ?? "").trim().toLowerCase()] ?? GENERIC_BOX;
+function $t(e) {
+  let n = 0;
+  e.nodes().forEach((t) => {
+    let r5 = e.node(t);
+    r5.borderTop && (r5.minRank = e.node(r5.borderTop).rank, r5.maxRank = e.node(r5.borderBottom).rank, n = Math.max(n, r5.maxRank));
+  }), e.graph().maxRank = n;
+}
+function Jt(e) {
+  e.nodes().forEach((n) => {
+    let t = e.node(n);
+    if (t.dummy === "edge-proxy") {
+      let r5 = t;
+      e.edge(r5.e).labelRank = t.rank, e.removeNode(n);
+    }
+  });
 }
-function hasGlyph(kind) {
-  return (kind ?? "").trim().toLowerCase() in ALIAS;
+function Qt(e) {
+  let n = Number.POSITIVE_INFINITY, t = 0, r5 = Number.POSITIVE_INFINITY, o = 0, i = e.graph(), s = i.marginx || 0, a = i.marginy || 0;
+  function d(l) {
+    let u = l.x, c = l.y, h = l.width, f = l.height;
+    n = Math.min(n, u - h / 2), t = Math.max(t, u + h / 2), r5 = Math.min(r5, c - f / 2), o = Math.max(o, c + f / 2);
+  }
+  e.nodes().forEach((l) => d(e.node(l))), e.edges().forEach((l) => {
+    let u = e.edge(l);
+    Object.hasOwn(u, "x") && d(u);
+  }), n -= s, r5 -= a, e.nodes().forEach((l) => {
+    let u = e.node(l);
+    u.x -= n, u.y -= r5;
+  }), e.edges().forEach((l) => {
+    let u = e.edge(l);
+    u.points.forEach((c) => {
+      c.x -= n, c.y -= r5;
+    }), Object.hasOwn(u, "x") && (u.x -= n), Object.hasOwn(u, "y") && (u.y -= r5);
+  }), i.width = t - n + s, i.height = o - r5 + a;
 }
-function cloudGlyph(kind, x2, y, c = "var(--muted)") {
-  const d = PATHS[glyphNameFor(kind)];
-  return `<path d="${d}" transform="translate(${x2} ${y})" fill="none" stroke="${c}" stroke-width="1.3" stroke-linecap="round" stroke-linejoin="round"/>`;
+function Zt(e) {
+  e.edges().forEach((n) => {
+    let t = e.edge(n), r5 = e.node(n.v), o = e.node(n.w), i, s;
+    t.points ? (i = t.points[0], s = t.points[t.points.length - 1]) : (t.points = [], i = o, s = r5), t.points.unshift(H(r5, i)), t.points.push(H(o, s));
+  });
 }
-
-// src/svg/blockStyle.ts
-var KNOWN_NODE_KINDS = [
-  "client",
-  "service",
-  "microservice",
-  "compute",
-  "container",
-  "data",
-  "store",
-  "db",
-  "database",
-  "postgres",
-  "mysql",
-  "mongo",
-  "mongodb",
-  "dynamo",
-  "bucket",
-  "blob",
-  "object",
-  "s3",
-  "queue",
-  "mq",
-  "broker",
-  "sqs",
-  "rabbitmq",
-  "cache",
-  "redis",
-  "memcached",
-  "gateway",
-  "lb",
-  "proxy",
-  "function",
-  "lambda",
-  "cdn",
-  "external",
-  "producer",
-  "topic",
-  "consumer",
-  "context",
-  "firewall",
-  "waf",
-  "shield",
-  "dns",
-  "auth",
-  "identity",
-  "idp",
-  "iam",
-  "oauth",
-  "sso",
-  "monitor",
-  "observability",
-  "metrics",
-  "logs",
-  "tracing",
-  "apm",
-  "scheduler",
-  "cron",
-  "job",
-  "stream",
-  "kafka",
-  "kinesis",
-  "warehouse",
-  "lake",
-  "analytics",
-  "bi",
-  "search",
-  "index",
-  "elasticsearch",
-  "opensearch",
-  "registry",
-  "ci",
-  "cicd",
-  "pipeline",
-  "git",
-  "repo",
-  "scm",
-  "device",
-  "iot",
-  "email",
-  "sms",
-  "config",
-  "settings",
-  "ml",
-  "model",
-  "llm",
-  "agent",
-  "ai",
-  "user",
-  "person",
-  "actor",
-  "browser",
-  "web",
-  "mobile",
-  "vm",
-  "server",
-  "host",
-  "secrets",
-  "vault",
-  "kms",
-  "notification",
-  "webhook",
-  "worker",
-  "etl",
-  "shard",
-  "shards",
-  "sharded",
-  "replica",
-  "replicas",
-  "replicaset",
-  "users",
-  "crowd",
-  "region",
-  "geo",
-  "globe",
-  // `preset: k8s` vocabulary (namespaces are groups; these are the node kinds).
-  "deployment",
-  "pod",
-  "ingress",
-  "configmap",
-  "secret",
-  "cronjob",
-  "node",
-  "namespace",
-  "cluster",
-  "sns"
-];
-var SKIN = {};
-var def = (kinds, skin) => {
-  for (const k2 of kinds) SKIN[k2] = skin;
-};
-var primary = (chip3) => ({ chip: chip3, primary: true, fill: "paper", dashed: false });
-var secondary = (chip3) => ({ chip: chip3, primary: false, fill: "paper-2", dashed: false });
-var external = (chip3) => ({ chip: chip3, primary: true, fill: "paper", dashed: true });
-def(["client", "user", "person", "actor", "users", "crowd", "browser", "web", "mobile", "device", "iot"], primary("CLIENT"));
-def(["service", "microservice", "compute", "container", "worker", "etl"], primary("SVC"));
-def(["data"], primary("DATA"));
-def(["store", "db", "database", "postgres", "mysql", "mongo", "mongodb", "dynamo"], secondary("DB"));
-def(["shard", "shards", "sharded", "replica", "replicas", "replicaset"], secondary("DB"));
-def(["bucket", "blob", "object", "s3"], secondary("BUCKET"));
-def(["warehouse", "lake"], secondary("WAREHOUSE"));
-def(["queue", "mq", "broker", "sqs", "rabbitmq"], secondary("QUEUE"));
-def(["topic"], secondary("TOPIC"));
-def(["stream", "kafka", "kinesis"], secondary("BUS"));
-def(["cache", "redis", "memcached"], secondary("CACHE"));
-def(["search", "index", "elasticsearch", "opensearch"], secondary("SEARCH"));
-def(["registry"], secondary("REGISTRY"));
-def(["gateway", "proxy"], primary("GATEWAY"));
-def(["lb"], primary("LB"));
-def(["function", "lambda"], primary("FN"));
-def(["cdn"], external("EDGE"));
-def(["external"], external("EXT"));
-def(["producer"], primary("PRODUCER"));
-def(["consumer"], primary("CONSUMER"));
-def(["context"], primary("CONTEXT"));
-def(["firewall", "waf", "shield"], primary("WAF"));
-def(["dns"], external("DNS"));
-def(["auth", "identity", "idp", "iam", "oauth", "sso"], primary("AUTH"));
-def(["monitor", "observability", "metrics", "logs", "tracing", "apm"], primary("OBS"));
-def(["scheduler", "cron", "job"], primary("CRON"));
-def(["analytics", "bi"], primary("ANALYTICS"));
-def(["ci", "cicd", "pipeline"], primary("CI"));
-def(["git", "repo", "scm"], secondary("GIT"));
-def(["email", "sms"], external("EMAIL"));
-def(["config", "settings"], secondary("CONFIG"));
-def(["ml", "model", "llm", "agent", "ai"], primary("AI"));
-def(["vm", "server", "host"], primary("HOST"));
-def(["secrets", "vault", "kms"], secondary("SECRETS"));
-def(["notification", "webhook"], external("WEBHOOK"));
-def(["region", "geo", "globe"], external("REGION"));
-def(["deployment"], primary("DEPLOY"));
-def(["pod"], primary("POD"));
-def(["ingress"], primary("INGRESS"));
-def(["configmap"], secondary("CONFIG"));
-def(["secret"], secondary("SECRETS"));
-def(["cronjob"], primary("CRON"));
-def(["node"], primary("NODE"));
-def(["namespace"], secondary("NS"));
-def(["cluster"], primary("CLUSTER"));
-def(["sns"], secondary("TOPIC"));
-function nodeSkin(kind) {
-  const k2 = (kind ?? "").trim().toLowerCase();
-  if (k2 === "") return { chip: "", primary: true, fill: "paper", dashed: false };
-  return SKIN[k2] ?? primary(k2.toUpperCase());
+function er(e) {
+  e.edges().forEach((n) => {
+    let t = e.edge(n);
+    if (Object.hasOwn(t, "x")) switch ((t.labelpos === "l" || t.labelpos === "r") && (t.width -= t.labeloffset), t.labelpos) {
+      case "l":
+        t.x -= t.width / 2 + t.labeloffset;
+        break;
+      case "r":
+        t.x += t.width / 2 + t.labeloffset;
+        break;
+    }
+  });
+}
+function nr(e) {
+  e.edges().forEach((n) => {
+    let t = e.edge(n);
+    t.reversed && t.points.reverse();
+  });
+}
+function tr(e) {
+  e.nodes().forEach((n) => {
+    if (e.children(n).length) {
+      let t = e.node(n), r5 = e.node(t.borderTop), o = e.node(t.borderBottom), i = e.node(t.borderLeft[t.borderLeft.length - 1]), s = e.node(t.borderRight[t.borderRight.length - 1]);
+      t.width = Math.abs(s.x - i.x), t.height = Math.abs(o.y - r5.y), t.x = i.x + t.width / 2, t.y = r5.y + t.height / 2;
+    }
+  }), e.nodes().forEach((n) => {
+    e.node(n).dummy === "border" && e.removeNode(n);
+  });
+}
+function rr(e) {
+  e.edges().forEach((n) => {
+    if (n.v === n.w) {
+      let t = e.node(n.v);
+      t.selfEdges || (t.selfEdges = []), t.selfEdges.push({ e: n, label: e.edge(n) }), e.removeEdge(n);
+    }
+  });
+}
+function or(e) {
+  N(e).forEach((t) => {
+    let r5 = 0;
+    t.forEach((o, i) => {
+      let s = e.node(o);
+      s.order = i + r5, (s.selfEdges || []).forEach((a) => {
+        w(e, "selfedge", { width: a.label.width, height: a.label.height, rank: s.rank, order: i + ++r5, e: a.e, label: a.label }, "_se");
+      }), delete s.selfEdges;
+    });
+  });
 }
-function skinFill(sk, accent = false) {
-  if (accent) return "var(--accent-tint)";
-  return sk.fill === "paper-2" ? "var(--paper-2)" : "var(--paper)";
+function ir(e) {
+  e.nodes().forEach((n) => {
+    let t = e.node(n);
+    if (t.dummy === "selfedge") {
+      let r5 = t, o = e.node(r5.e.v), i = o.x + o.width / 2, s = o.y, a = t.x - i, d = o.height / 2;
+      e.setEdge(r5.e, r5.label), e.removeNode(n), r5.label.points = [{ x: i + 2 * a / 3, y: s - d }, { x: i + 5 * a / 6, y: s - d }, { x: i + a, y: s }, { x: i + 5 * a / 6, y: s + d }, { x: i + 2 * a / 3, y: s + d }], r5.label.x = t.x, r5.label.y = t.y;
+    }
+  });
 }
-function nodeGlyph(kind, x2, y, c) {
-  const k2 = (kind ?? "").toLowerCase();
-  if (k2 === "store" || k2 === "db" || k2 === "database" || k2 === "postgres" || k2 === "mysql" || k2 === "mongo" || k2 === "mongodb" || k2 === "dynamo") {
-    return `<g stroke="${c}" stroke-width="1.3" fill="none"><ellipse cx="${x2 + 8}" cy="${y + 3}" rx="7" ry="3"/><path d="M${x2 + 1} ${y + 3} V ${y + 13}"/><path d="M${x2 + 15} ${y + 3} V ${y + 13}"/><path d="M${x2 + 1} ${y + 13} a 7 3 0 0 0 14 0"/></g>`;
-  }
-  if (k2 === "bucket" || k2 === "blob" || k2 === "object" || k2 === "s3") {
-    return `<g stroke="${c}" stroke-width="1.3" fill="none"><ellipse cx="${x2 + 8}" cy="${y + 3}" rx="7" ry="2.5"/><path d="M${x2 + 1.5} ${y + 3} L ${x2 + 3.5} ${y + 14} L ${x2 + 12.5} ${y + 14} L ${x2 + 14.5} ${y + 3}"/></g>`;
-  }
-  if (k2 === "queue" || k2 === "topic" || k2 === "mq" || k2 === "broker" || k2 === "sqs" || k2 === "rabbitmq") {
-    return `<g stroke="${c}" stroke-width="1.6"><path d="M${x2 + 2} ${y + 1} V ${y + 14}"/><path d="M${x2 + 8} ${y + 1} V ${y + 14}"/><path d="M${x2 + 14} ${y + 1} V ${y + 14}"/></g>`;
-  }
-  if (k2 === "firewall" || k2 === "waf" || k2 === "shield") {
-    return `<path d="M${x2 + 8} ${y} L ${x2 + 15} ${y + 3} V ${y + 9} Q ${x2 + 15} ${y + 14} ${x2 + 8} ${y + 16} Q ${x2 + 1} ${y + 14} ${x2 + 1} ${y + 9} V ${y + 3} Z" fill="none" stroke="${c}" stroke-width="1.3"/>`;
-  }
-  if (k2 === "dns") {
-    return `<g stroke="${c}" stroke-width="1.2" fill="none"><circle cx="${x2 + 8}" cy="${y + 8}" r="7"/><ellipse cx="${x2 + 8}" cy="${y + 8}" rx="3" ry="7"/><path d="M${x2 + 1.5} ${y + 8} H ${x2 + 14.5}"/></g>`;
-  }
-  if (k2 === "auth" || k2 === "identity" || k2 === "idp" || k2 === "iam" || k2 === "oauth" || k2 === "sso") {
-    return `<g stroke="${c}" stroke-width="1.4" fill="none"><circle cx="${x2 + 5}" cy="${y + 8}" r="3.5"/><path d="M${x2 + 8.5} ${y + 8} H ${x2 + 15} M${x2 + 12.5} ${y + 8} V ${y + 11.5} M${x2 + 15} ${y + 8} V ${y + 10.5}"/></g>`;
-  }
-  if (k2 === "monitor" || k2 === "observability" || k2 === "metrics" || k2 === "logs" || k2 === "tracing" || k2 === "apm") {
-    return `<path d="M${x2} ${y + 9} H ${x2 + 4} L ${x2 + 6.5} ${y + 3} L ${x2 + 9.5} ${y + 13} L ${x2 + 12} ${y + 9} H ${x2 + 16}" fill="none" stroke="${c}" stroke-width="1.5" stroke-linejoin="round"/>`;
-  }
-  if (k2 === "scheduler" || k2 === "cron" || k2 === "job") {
-    return `<g stroke="${c}" stroke-width="1.3" fill="none"><circle cx="${x2 + 8}" cy="${y + 8}" r="7"/><path d="M${x2 + 8} ${y + 4} V ${y + 8} L ${x2 + 11.5} ${y + 10}"/></g>`;
-  }
-  if (k2 === "stream" || k2 === "kafka" || k2 === "kinesis") {
-    const wave = (dy) => `<path d="M${x2 + 1} ${y + 4 + dy} q 3.5 -3 7 0 t 7 0" fill="none" stroke="${c}" stroke-width="1.4"/>`;
-    return `<g>${wave(0)}${wave(4.5)}${wave(9)}</g>`;
-  }
-  if (k2 === "warehouse" || k2 === "lake") {
-    return `<g stroke="${c}" stroke-width="1.3" fill="none"><ellipse cx="${x2 + 8}" cy="${y + 3}" rx="7" ry="3"/><path d="M${x2 + 1} ${y + 3} V ${y + 13}"/><path d="M${x2 + 15} ${y + 3} V ${y + 13}"/><path d="M${x2 + 1} ${y + 8} a 7 3 0 0 0 14 0"/><path d="M${x2 + 1} ${y + 13} a 7 3 0 0 0 14 0"/></g>`;
-  }
-  if (k2 === "search" || k2 === "index") {
-    return `<g stroke="${c}" stroke-width="1.4" fill="none"><circle cx="${x2 + 6.5}" cy="${y + 6.5}" r="5"/><path d="M${x2 + 10.5} ${y + 10.5} L ${x2 + 15} ${y + 15}"/></g>`;
-  }
-  if (k2 === "ml" || k2 === "model" || k2 === "llm" || k2 === "agent" || k2 === "ai") {
-    return `<path d="M${x2 + 8} ${y + 1} L ${x2 + 9.8} ${y + 6.2} L ${x2 + 15} ${y + 8} L ${x2 + 9.8} ${y + 9.8} L ${x2 + 8} ${y + 15} L ${x2 + 6.2} ${y + 9.8} L ${x2 + 1} ${y + 8} L ${x2 + 6.2} ${y + 6.2} Z" fill="${c}"/>`;
-  }
-  if (k2 === "user" || k2 === "person" || k2 === "actor") {
-    return `<g fill="${c}"><circle cx="${x2 + 8}" cy="${y + 4.5}" r="3.5"/><path d="M ${x2 + 2} ${y + 15} a 6 6.5 0 0 1 12 0 z"/></g>`;
-  }
-  if (k2 === "browser" || k2 === "web") {
-    return `<g stroke="${c}" stroke-width="1.3" fill="none"><rect x="${x2 + 1}" y="${y + 2}" width="14" height="12" rx="2"/><path d="M${x2 + 1} ${y + 6} H ${x2 + 15}"/></g>`;
-  }
-  if (k2 === "mobile") {
-    return `<g stroke="${c}" stroke-width="1.3" fill="none"><rect x="${x2 + 4}" y="${y + 1}" width="8" height="14" rx="2"/><path d="M${x2 + 7} ${y + 12.5} H ${x2 + 9}"/></g>`;
-  }
-  if (k2 === "vm" || k2 === "server" || k2 === "host") {
-    return `<g stroke="${c}" stroke-width="1.3" fill="none"><rect x="${x2 + 2}" y="${y + 2}" width="12" height="5" rx="1.2"/><rect x="${x2 + 2}" y="${y + 9}" width="12" height="5" rx="1.2"/><path d="M${x2 + 4.5} ${y + 4.5} H ${x2 + 7} M${x2 + 4.5} ${y + 11.5} H ${x2 + 7}"/></g>`;
-  }
-  if (k2 === "secrets" || k2 === "vault" || k2 === "kms") {
-    return `<g stroke="${c}" stroke-width="1.3" fill="none"><rect x="${x2 + 3}" y="${y + 7}" width="10" height="8" rx="1.5"/><path d="M${x2 + 5} ${y + 7} V ${y + 5} a 3 3 0 0 1 6 0 V ${y + 7}"/></g>`;
-  }
-  if (k2 === "notification" || k2 === "webhook") {
-    return `<g stroke="${c}" stroke-width="1.3" fill="none"><path d="M${x2 + 3} ${y + 11} a 5 5 0 0 1 1.6 -3.6 V ${y + 5} a 3.4 3.4 0 0 1 6.8 0 v 2.4 a 5 5 0 0 1 1.6 3.6 z"/><path d="M${x2 + 6.5} ${y + 13.5} a 1.5 1.5 0 0 0 3 0"/></g>`;
-  }
-  if (k2 === "email" || k2 === "sms") {
-    return `<g stroke="${c}" stroke-width="1.3" fill="none"><rect x="${x2 + 1}" y="${y + 3}" width="14" height="10" rx="1.5"/><path d="M${x2 + 1.5} ${y + 4} L ${x2 + 8} ${y + 9} L ${x2 + 14.5} ${y + 4}"/></g>`;
-  }
-  if (k2 === "registry") {
-    return `<g stroke="${c}" stroke-width="1.2" fill="none"><rect x="${x2 + 1}" y="${y + 8}" width="6" height="6" rx="1"/><rect x="${x2 + 9}" y="${y + 8}" width="6" height="6" rx="1"/><rect x="${x2 + 5}" y="${y + 1}" width="6" height="6" rx="1"/></g>`;
-  }
-  if (k2 === "ci" || k2 === "cicd" || k2 === "pipeline") {
-    return `<g stroke="${c}" stroke-width="1.3" fill="none"><circle cx="${x2 + 8}" cy="${y + 8}" r="7"/><path d="M${x2 + 6} ${y + 5} L ${x2 + 11.5} ${y + 8} L ${x2 + 6} ${y + 11} Z" fill="${c}" stroke="none"/></g>`;
-  }
-  if (k2 === "git" || k2 === "repo" || k2 === "scm") {
-    return `<g stroke="${c}" stroke-width="1.3" fill="none"><circle cx="${x2 + 4}" cy="${y + 3.5}" r="2.5"/><circle cx="${x2 + 4}" cy="${y + 12.5}" r="2.5"/><circle cx="${x2 + 12}" cy="${y + 6}" r="2.5"/><path d="M${x2 + 4} ${y + 6} V ${y + 10} M${x2 + 4} ${y + 8} q 0 -2 3 -2 h 2.5"/></g>`;
+function ue(e, n) {
+  return O(T(e, n), Number);
+}
+function ce(e) {
+  let n = {};
+  return e && Object.entries(e).forEach(([t, r5]) => {
+    typeof t == "string" && (t = t.toLowerCase()), n[t] = r5;
+  }), n;
+}
+function fe(e) {
+  let n = N(e), t = new p({ compound: true, multigraph: true }).setGraph({});
+  return e.nodes().forEach((r5) => {
+    t.setNode(r5, { label: r5 }), t.setParent(r5, "layer" + e.node(r5).rank);
+  }), e.edges().forEach((r5) => t.setEdge(r5.v, r5.w, {}, r5.name)), n.forEach((r5, o) => {
+    let i = "layer" + o;
+    t.setNode(i, { rank: "same" }), r5.reduce((s, a) => (t.setEdge(s, a, { style: "invis" }), a));
+  }), t;
+}
+var sr = { graphlib: z, version: U, layout: he, debug: fe, util: { time: P, notime: M } };
+var To = sr;
+
+// src/blocks/autoLayout.ts
+function ensureGrid(items, edges, rankdir) {
+  const allPlaced = items.length > 0 && items.every((n) => n.col !== void 0 && n.row !== void 0);
+  if (allPlaced) {
+    return items.map((n) => ({ ...n, col: n.col, row: n.row }));
   }
-  if (k2 === "device" || k2 === "iot") {
-    return `<g stroke="${c}" stroke-width="1.2" fill="none"><rect x="${x2 + 4}" y="${y + 4}" width="8" height="8" rx="1.5"/><path d="M${x2 + 6} ${y + 4} V ${y + 1} M${x2 + 10} ${y + 4} V ${y + 1} M${x2 + 6} ${y + 15} V ${y + 12} M${x2 + 10} ${y + 15} V ${y + 12} M${x2 + 4} ${y + 6} H ${x2 + 1} M${x2 + 4} ${y + 10} H ${x2 + 1} M${x2 + 15} ${y + 6} H ${x2 + 12} M${x2 + 15} ${y + 10} H ${x2 + 12}"/></g>`;
+  const grid = autoGrid(
+    items.map((n) => n.id),
+    edges,
+    rankdir
+  );
+  return items.map((n) => {
+    const g = grid.get(n.id) ?? { col: 1, row: 1 };
+    return { ...n, col: g.col, row: g.row };
+  });
+}
+function autoGrid(ids, edges, rankdir) {
+  const idSet = new Set(ids);
+  const g = new To.graphlib.Graph();
+  g.setGraph({ rankdir, nodesep: 16, ranksep: 16, marginx: 0, marginy: 0 });
+  g.setDefaultEdgeLabel(() => ({}));
+  for (const id of ids) g.setNode(id, { width: 10, height: 10 });
+  for (const e of edges) {
+    if (e.from !== e.to && idSet.has(e.from) && idSet.has(e.to)) g.setEdge(e.from, e.to);
   }
-  if (k2 === "analytics" || k2 === "bi") {
-    return `<g fill="${c}"><rect x="${x2 + 1}" y="${y + 9}" width="3.4" height="6" rx="0.8"/><rect x="${x2 + 6.3}" y="${y + 5}" width="3.4" height="10" rx="0.8"/><rect x="${x2 + 11.6}" y="${y + 1}" width="3.4" height="14" rx="0.8"/></g>`;
+  To.layout(g);
+  const pos3 = ids.map((id) => {
+    const n = g.node(id);
+    return { id, x: Math.round(n?.x ?? 0), y: Math.round(n?.y ?? 0) };
+  });
+  const out = /* @__PURE__ */ new Map();
+  if (rankdir === "TB") {
+    const ranks = [...new Set(pos3.map((p2) => p2.y))].sort((a, b) => a - b);
+    ranks.forEach((yv, ri) => {
+      pos3.filter((p2) => p2.y === yv).sort((a, b) => a.x - b.x).forEach((p2, ci) => out.set(p2.id, { col: ci + 1, row: ri + 1 }));
+    });
+  } else {
+    const ranks = [...new Set(pos3.map((p2) => p2.x))].sort((a, b) => a - b);
+    ranks.forEach((xv, ci) => {
+      pos3.filter((p2) => p2.x === xv).sort((a, b) => a.y - b.y).forEach((p2, ri) => out.set(p2.id, { col: ci + 1, row: ri + 1 }));
+    });
   }
-  if (k2 === "config" || k2 === "settings") {
-    return `<g stroke="${c}" stroke-width="1.3" fill="none"><circle cx="${x2 + 8}" cy="${y + 8}" r="4"/><path d="M${x2 + 8} ${y + 1} V ${y + 3.5} M${x2 + 8} ${y + 12.5} V ${y + 15} M${x2 + 1} ${y + 8} H ${x2 + 3.5} M${x2 + 12.5} ${y + 8} H ${x2 + 15} M${x2 + 3} ${y + 3} L ${x2 + 5} ${y + 5} M${x2 + 11} ${y + 11} L ${x2 + 13} ${y + 13} M${x2 + 13} ${y + 3} L ${x2 + 11} ${y + 5} M${x2 + 5} ${y + 11} L ${x2 + 3} ${y + 13}"/></g>`;
+  return out;
+}
+
+// src/blocks/flow.ts
+var AI_CHIP = {
+  agent: "AGENT",
+  llm: "LLM",
+  tool: "TOOL",
+  human: "HUMAN",
+  memory: "MEMORY"
+};
+function flowRevealOrder(nodes, edges) {
+  const ids = new Set(nodes.map((n) => n.id));
+  const indeg = /* @__PURE__ */ new Map();
+  const outs = /* @__PURE__ */ new Map();
+  for (const n of nodes) {
+    indeg.set(n.id, 0);
+    outs.set(n.id, []);
   }
-  if (k2 === "cache" || k2 === "redis" || k2 === "memcached") {
-    const slab = (dy) => `<path d="M${x2 + 1} ${y + 5 + dy} L${x2 + 8} ${y + 2 + dy} L${x2 + 15} ${y + 5 + dy} L${x2 + 8} ${y + 8 + dy} Z" fill="none" stroke="${c}" stroke-width="1.2"/>`;
-    return `<g>${slab(0)}${slab(3.5)}${slab(7)}</g>`;
+  for (const e of edges) {
+    if (!ids.has(e.from) || !ids.has(e.to) || e.from === e.to) continue;
+    indeg.set(e.to, (indeg.get(e.to) ?? 0) + 1);
+    outs.get(e.from)?.push(e.to);
   }
-  if (k2 === "function" || k2 === "lambda") {
-    return `<text x="${x2 + 7}" y="${y + 14}" font-family="Georgia, serif" font-size="17" font-style="italic" font-weight="700" fill="${c}" text-anchor="middle">\u0192</text>`;
+  let roots = nodes.filter((n) => n.kind === "start").map((n) => n.id);
+  if (roots.length === 0) roots = nodes.filter((n) => (indeg.get(n.id) ?? 0) === 0).map((n) => n.id);
+  if (roots.length === 0 && nodes[0] !== void 0) roots = [nodes[0].id];
+  const order = /* @__PURE__ */ new Map();
+  const queue = [...roots];
+  while (queue.length > 0) {
+    const id = queue.shift();
+    if (order.has(id)) continue;
+    order.set(id, order.size);
+    for (const to of outs.get(id) ?? []) {
+      const d = (indeg.get(to) ?? 0) - 1;
+      indeg.set(to, d);
+      if (d <= 0 && !order.has(to)) queue.push(to);
+    }
   }
-  if (k2 === "cdn" || k2 === "external") {
-    return `<path d="M${x2 + 3} ${y + 13} a 4 4 0 0 1 0.5 -8 a 5 5 0 0 1 9.5 1.2 a 3 3 0 0 1 1 6.8 z" fill="none" stroke="${c}" stroke-width="1.3"/>`;
+  for (const n of nodes) if (!order.has(n.id)) order.set(n.id, order.size);
+  return order;
+}
+var ERR_LABEL_RE = /^(no|fail|failed|error|reject|rejected)\b/i;
+var CELL_W = 160;
+var CELL_H = 64;
+var NODE_W = 150;
+var NODE_H = 52;
+function renderFlowSvg(data) {
+  const edges = data.edges ?? [];
+  const groups = data.groups ?? [];
+  const rawNodes = data.nodes ?? [];
+  const quick = !(rawNodes.length > 0 && rawNodes.every((n) => n.col !== void 0 && n.row !== void 0));
+  const nodes = ensureGrid(rawNodes, edges, data.dir ?? "LR");
+  const cellW = CELL_W;
+  const cellH = CELL_H;
+  const gapX = 56;
+  const gapY = 48;
+  const nestPad = nestingPads(groups);
+  const padX = (groups.length > 0 ? GROUP_PADS.padX : 22) + nestPad.padX;
+  const padTop = (groups.length > 0 ? GROUP_PADS.padTop : 22) + nestPad.padTop;
+  const padBot = (groups.length > 0 ? GROUP_PADS.padBot : 18) + nestPad.padBot;
+  const gx = groupExtent(groups);
+  const cols = Math.max(1, ...nodes.map((n) => n.col + ((n.w ?? 1) - 1)), gx.cols);
+  const rows = Math.max(1, ...nodes.map((n) => n.row), gx.rows);
+  const xOf = (c) => padX + (c - 1) * (cellW + gapX);
+  const yOf = (r5) => padTop + (r5 - 1) * (cellH + gapY);
+  const cellFor = (n) => ({
+    x: xOf(n.col),
+    y: yOf(n.row),
+    w: (n.w ?? 1) * cellW + ((n.w ?? 1) - 1) * gapX,
+    h: cellH
+  });
+  const boxFor = (n) => {
+    const c = cellFor(n);
+    if ((n.kind ?? "process") === "decision") return c;
+    const dx = (cellW - NODE_W) / 2;
+    const dy = (cellH - NODE_H) / 2;
+    return { x: c.x + dx, y: c.y + dy, w: c.w - dx * 2, h: NODE_H };
+  };
+  const byId = new Map(nodes.map((n) => [n.id, n]));
+  const width = padX * 2 + cols * cellW + (cols - 1) * gapX;
+  const height = padTop + rows * cellH + (rows - 1) * gapY + padBot;
+  const isErrEdge = (e) => e.kind === "error" || ERR_LABEL_RE.test(e.label ?? "");
+  const errTargets = new Set(edges.filter(isErrEdge).map((e) => e.to));
+  const accentIds = new Set(
+    nodes.filter((n) => n.kind === "end" && !errTargets.has(n.id) && !ERR_LABEL_RE.test(n.label)).map((n) => n.id)
+  );
+  const gridMeta = gridMetaAttrs({ quick, cols, rows, cellW, cellH, gapX, gapY, padX, padTop });
+  const a11y = svgName("Flowchart", data.title, [countPhrase(nodes.length, "step")]);
+  let s = `<svg viewBox="0 0 ${width} ${height}"${a11y.attrs}${gridMeta}>${a11y.title}`;
+  if (groups.length > 0) s += gridGroupsSvg(groups, { xOf, yOf, cellW, cellH, gapX, gapY, skin: true });
+  const used = { plain: false, dashed: false, error: false, accent: false };
+  const pending = [];
+  const lanes = edgeLanes(edges);
+  const order = flowRevealOrder(nodes, edges);
+  const stepOf = (id) => order.get(id) ?? 0;
+  const entries = entryPortOffsets(edges, (id) => {
+    const n = byId.get(id);
+    return n !== void 0 ? boxFor(n) : void 0;
+  });
+  s += `<g${bl("edges")}>`;
+  edges.forEach((e, ei) => {
+    const A2 = byId.get(e.from);
+    const B3 = byId.get(e.to);
+    if (!A2 || !B3) return;
+    const p2 = ortho(boxFor(A2), boxFor(B3), lanes[ei] ?? 0, entries[ei] ?? 0);
+    const isErr = isErrEdge(e);
+    const isAccent = !isErr && accentIds.has(e.to);
+    const isDashed = !isErr && e.kind === "dashed";
+    const stroke = isErr ? "var(--negative)" : isAccent ? "var(--accent)" : "var(--muted)";
+    const marker2 = isErr ? "skErr" : isAccent ? "skAccent" : isDashed ? "skOpen" : "skArrow";
+    const sw = isAccent ? 1.75 : 1.5;
+    const dash = isDashed ? ' stroke-dasharray="5 4"' : "";
+    if (isErr) used.error = true;
+    else if (isAccent) used.accent = true;
+    else if (isDashed) used.dashed = true;
+    else used.plain = true;
+    const reveal = Math.max(stepOf(e.from), stepOf(e.to));
+    s += `<path d="${p2.d}" fill="none" stroke="${stroke}" stroke-width="${sw}"${dash} marker-end="url(#${marker2})"${bp(`edges.${ei}`)}${revealAttr(reveal)}/>`;
+    pending.push({
+      lx: p2.lx,
+      ly: p2.ly,
+      ...e.label !== void 0 ? { label: e.label } : {},
+      err: isErr,
+      accent: isAccent,
+      path: `edges.${ei}`,
+      reveal
+    });
+  });
+  s += `</g>`;
+  const kindsUsed = /* @__PURE__ */ new Set();
+  s += `<g${bl("nodes")}>`;
+  nodes.forEach((n, ni) => {
+    const kind = n.kind ?? "process";
+    kindsUsed.add(kind);
+    const r5 = boxFor(n);
+    const cx = r5.x + r5.w / 2;
+    const cy = r5.y + r5.h / 2;
+    const accent = accentIds.has(n.id);
+    const chip3 = AI_CHIP[kind];
+    const secondary2 = kind === "start" || kind === "memory";
+    const stroke = accent ? "var(--accent)" : secondary2 ? "var(--rule-solid)" : "var(--ink)";
+    const sw = accent ? 1.5 : secondary2 ? 1 : 1.5;
+    const fill = accent ? "var(--accent-tint)" : secondary2 ? "var(--paper-2)" : "var(--paper)";
+    const dash = kind === "human" ? ' stroke-dasharray="4 3"' : "";
+    let shape;
+    if (kind === "decision") {
+      shape = `<polygon points="${cx},${r5.y} ${r5.x + r5.w},${cy} ${cx},${r5.y + r5.h} ${r5.x},${cy}" fill="${fill}" stroke="${stroke}" stroke-width="${sw}" stroke-linejoin="round"/>`;
+    } else if (kind === "start" || kind === "end") {
+      shape = `<rect x="${r5.x}" y="${r5.y}" width="${r5.w}" height="${r5.h}" rx="${r5.h / 2}" fill="${fill}" stroke="${stroke}" stroke-width="${sw}"/>`;
+    } else {
+      shape = `<rect x="${r5.x}" y="${r5.y}" width="${r5.w}" height="${r5.h}" rx="4" fill="${fill}" stroke="${stroke}" stroke-width="${sw}"${dash}/>`;
+    }
+    if (chip3 !== void 0) {
+      shape += `<text x="${r5.x + 8}" y="${r5.y + 11}" class="blk-chip t-sub">${chip3}</text>`;
+    }
+    const nl = n.label.indexOf("\n");
+    const name = nl >= 0 ? n.label.slice(0, nl) : n.label;
+    const sub = nl >= 0 ? n.label.slice(nl + 1).replace(/\s+/g, " ").trim() : "";
+    const maxChars = kind === "decision" ? 18 : 20;
+    const lines = sub.length > 0 ? wrapText(name, maxChars, 1) : wrapText(name, maxChars, 2);
+    const tone = accent ? " c-accent" : "";
+    const dy = chip3 !== void 0 ? 4 : 0;
+    let texts = "";
+    if (kind === "agent" || kind === "llm") {
+      const nm = wrapText(name, 17, 1)[0] ?? name;
+      texts = nodeGlyph("agent", r5.x + 10, r5.y + 19, accent ? "var(--accent)" : "var(--ink)");
+      texts += `<text x="${r5.x + 30}" y="${r5.y + 30}" class="al-name${tone}">${escapeHtml(nm)}</text>`;
+      if (sub.length > 0) {
+        const chipW = Math.min(r5.w - 20, 12 + sub.length * 5.6);
+        texts += `<rect x="${r5.x + 10}" y="${r5.y + 36}" width="${chipW.toFixed(1)}" height="13" rx="3" fill="var(--paper)" stroke="var(--rule-solid)" stroke-width="1"/><text x="${(r5.x + 10 + chipW / 2).toFixed(1)}" y="${r5.y + 45.5}" text-anchor="middle" class="al-chip">${escapeHtml(sub)}</text>`;
+      }
+    } else if (sub.length > 0) {
+      texts = `<text x="${cx}" y="${cy - 1 + dy}" class="fc-label t-name${tone}">${escapeHtml(lines[0] ?? name)}</text><text x="${cx}" y="${cy + 12 + dy}" class="fc-sub t-sub" text-anchor="middle">${escapeHtml(sub)}</text>`;
+    } else {
+      texts = lines.map(
+        (ln2, j2) => `<text x="${cx}" y="${cy + 4.5 + dy - (lines.length - 1) * 7.5 + j2 * 15}" class="fc-label t-name${tone}">${escapeHtml(ln2)}</text>`
+      ).join("");
+    }
+    s += `<g${bp(`nodes.${ni}`)}${nodeCellAttrs(n.col, n.row, n.w ?? 1)}${revealAttr(stepOf(n.id))}>${shape}${texts}</g>`;
+  });
+  s += `</g>`;
+  const { overlay, legend: steps } = edgeLabelLayer(pending, nodes.map((n) => boxFor(n)), { skin: true });
+  s += overlay;
+  s += `</svg>`;
+  const items = [];
+  if (kindsUsed.has("start")) items.push({ swatch: "node-fill2", label: "start" });
+  if (kindsUsed.has("process")) items.push({ swatch: "node", label: "step" });
+  if (kindsUsed.has("decision")) items.push({ swatch: "node", label: "decision (diamond)" });
+  if (kindsUsed.has("agent")) items.push({ swatch: "node", label: "AGENT \xB7 autonomous step" });
+  if (kindsUsed.has("llm")) items.push({ swatch: "node", label: "LLM \xB7 model call" });
+  if (kindsUsed.has("tool")) items.push({ swatch: "node", label: "TOOL \xB7 retrieval / API / code" });
+  if (kindsUsed.has("human")) items.push({ swatch: "node-dashed", label: "HUMAN \xB7 review gate" });
+  if (kindsUsed.has("memory")) items.push({ swatch: "node-fill2", label: "MEMORY \xB7 store" });
+  if (kindsUsed.has("end") && [...accentIds].length < nodes.filter((n) => n.kind === "end").length) {
+    items.push({ swatch: "node", label: "exit" });
   }
-  if (k2 === "gateway" || k2 === "lb" || k2 === "proxy") {
-    return `<g stroke="${c}" stroke-width="1.5" fill="none"><path d="M${x2 + 2} ${y + 1} L ${x2 + 8} ${y + 7} L ${x2 + 2} ${y + 13}"/><path d="M${x2 + 8} ${y + 1} L ${x2 + 14} ${y + 7} L ${x2 + 8} ${y + 13}"/></g>`;
+  if (used.plain) items.push({ swatch: "edge", label: "next" });
+  if (used.dashed) items.push({ swatch: "edge-dashed", label: "optional" });
+  if (used.error) items.push({ swatch: "edge-error", label: "error path" });
+  if (accentIds.size > 0) items.push({ swatch: "node-accent", label: "happy path" });
+  return { svg: s + steps, legend: renderLegend(items) };
+}
+function renderFlowFrame(data, tag) {
+  const { svg, legend } = renderFlowSvg(data);
+  return diagramFrame(
+    {
+      tag,
+      ...data.title !== void 0 ? { title: data.title } : {},
+      ...data.description !== void 0 ? { desc: data.description } : {},
+      ...legend.length > 0 ? { legendHtml: legend } : {}
+    },
+    svg
+  );
+}
+function renderFlow(data) {
+  return renderFlowFrame(data, data.variant === "dag" ? "DAG" : "FLOW");
+}
+
+// src/blocks/state.ts
+var ERR_RE = /\b(error|fail|failed|failure|reject|rejected|cancel|cancelled|canceled|abort|aborted|timeout|timed out|expired|dead)\b/i;
+function nameLines(s) {
+  return wrapText(s.name ?? "", 23, 3);
+}
+function rectFor(s, cellW, cellH, gapX, gapY, padX, padTop) {
+  const cx = padX + (s.col - 1) * (cellW + gapX) + cellW / 2;
+  const cy = padTop + (s.row - 1) * (cellH + gapY) + cellH / 2;
+  if (s.kind === "start" || s.kind === "terminal") {
+    return { x: cx - 13, y: cy - 13, w: 26, h: 26, cx, cy };
   }
-  if (k2 === "service" || k2 === "microservice" || k2 === "compute" || k2 === "container" || k2 === "worker" || k2 === "etl") {
-    return `<g stroke="${c}" stroke-width="1.3"><rect x="${x2 + 4}" y="${y + 1}" width="11" height="11" rx="1.5" fill="none"/><rect x="${x2 + 1}" y="${y + 4}" width="11" height="11" rx="1.5" fill="var(--paper)"/></g>`;
+  const lines = nameLines(s);
+  const longest2 = Math.max(0, ...lines.map((ln2) => ln2.length));
+  const pw = Math.max(96, Math.min(longest2 * 8 + 26, cellW + gapX - 26));
+  const ph = 46 + (Math.max(1, lines.length) - 1) * 15;
+  return { x: cx - pw / 2, y: cy - ph / 2, w: pw, h: ph, cx, cy };
+}
+function pillCls(kind) {
+  if (kind === "terminal") return "pill pill-end";
+  if (kind === "wait") return "pill pill-wait";
+  if (kind === "start") return "pill pill-init";
+  return "pill pill-active";
+}
+function renderState(data) {
+  const trans = data.transitions ?? [];
+  const rawStates = data.states ?? [];
+  const quick = !(rawStates.length > 0 && rawStates.every((n) => n.col !== void 0 && n.row !== void 0));
+  const states = ensureGrid(rawStates, trans, data.dir ?? "LR");
+  const cellW = 168;
+  const cellH = 64;
+  const gapX = 74;
+  const gapY = 60;
+  const groups = data.groups ?? [];
+  const nestPad = nestingPads(groups);
+  const padX = (groups.length > 0 ? GROUP_PADS.padX : 30) + nestPad.padX;
+  const padTop = (groups.length > 0 ? GROUP_PADS.padTop : 30) + nestPad.padTop;
+  const padBot = (groups.length > 0 ? GROUP_PADS.padBot : 20) + nestPad.padBot;
+  const gx = groupExtent(groups);
+  const cols = Math.max(1, ...states.map((s2) => s2.col), gx.cols);
+  const rows = Math.max(1, ...states.map((s2) => s2.row), gx.rows);
+  const width = padX * 2 + cols * cellW + (cols - 1) * gapX;
+  const height = padTop * 2 + rows * cellH + (rows - 1) * gapY + padBot;
+  const byId = new Map(states.map((s2) => [s2.id, s2]));
+  const isErrTerminal = (s2) => s2 !== void 0 && s2.kind === "terminal" && (ERR_RE.test(s2.name ?? "") || ERR_RE.test(s2.id));
+  const successExits = states.filter((s2) => s2.kind === "terminal" && !isErrTerminal(s2));
+  const accentId = successExits.length === 1 ? successExits[0]?.id : void 0;
+  const gridMeta = gridMetaAttrs({ quick, cols, rows, cellW, cellH, gapX, gapY, padX, padTop });
+  const a11y = svgName("State machine", data.title, [
+    countPhrase(states.length, "state"),
+    countPhrase(trans.length, "transition")
+  ]);
+  let s = `<svg viewBox="0 0 ${width} ${height}"${a11y.attrs}${gridMeta}>${a11y.title}`;
+  if (groups.length > 0) {
+    const xOf = (c) => padX + (c - 1) * (cellW + gapX);
+    const yOf = (r5) => padTop + (r5 - 1) * (cellH + gapY);
+    s += gridGroupsSvg(groups, { xOf, yOf, cellW, cellH, gapX, gapY, skin: true });
   }
-  return hasGlyph(k2) ? cloudGlyph(k2, x2, y, c) : "";
+  const numbered = trans.length >= 4;
+  const labels = [];
+  const used = { plain: false, error: false, accent: false };
+  const lanes = edgeLanes(trans);
+  const avoid = states.map((st2) => {
+    const r5 = rectFor(st2, cellW, cellH, gapX, gapY, padX, padTop);
+    return { x: r5.x, y: r5.y, w: r5.w, h: r5.h };
+  });
+  const entries = entryPortOffsets(trans, (id) => {
+    const n = byId.get(id);
+    return n !== void 0 ? rectFor(n, cellW, cellH, gapX, gapY, padX, padTop) : void 0;
+  });
+  trans.forEach((t, ti) => {
+    const A2 = byId.get(t.from);
+    const B3 = byId.get(t.to);
+    if (!A2 || !B3) return;
+    const label = t.event + (t.guard !== void 0 ? ` ${t.guard}` : "");
+    const isErr = isErrTerminal(B3);
+    const isAccent = !isErr && accentId !== void 0 && t.to === accentId;
+    const stroke = isErr ? "var(--negative)" : isAccent ? "var(--accent)" : "var(--muted)";
+    const marker2 = isErr ? "skErr" : isAccent ? "skAccent" : "skArrow";
+    const sw = isAccent ? 1.75 : 1.5;
+    const tone = isErr ? "error" : isAccent ? "accent" : "muted";
+    if (isErr) used.error = true;
+    else if (isAccent) used.accent = true;
+    else used.plain = true;
+    const tAttrs = bp(`transitions.${ti}`) + revealAttr(ti);
+    if (t.from === t.to) {
+      const r5 = rectFor(A2, cellW, cellH, gapX, gapY, padX, padTop);
+      s += `<path d="M ${r5.cx - 12} ${r5.y} C ${r5.cx - 30} ${r5.y - 32}, ${r5.cx + 30} ${r5.y - 32}, ${r5.cx + 12} ${r5.y}" fill="none" stroke="${stroke}" stroke-width="${sw}" marker-end="url(#${marker2})"${tAttrs}/>`;
+      const at2 = { lx: r5.cx, ly: r5.y - 28 };
+      const mark2 = numbered ? edgeStep(at2, ti + 1, isErr, true) : edgeMask(at2, label, tone);
+      labels.push(`<g${tAttrs}>${mark2}</g>`);
+      return;
+    }
+    const p2 = ortho(
+      rectFor(A2, cellW, cellH, gapX, gapY, padX, padTop),
+      rectFor(B3, cellW, cellH, gapX, gapY, padX, padTop),
+      lanes[ti] ?? 0,
+      entries[ti] ?? 0
+    );
+    s += `<path d="${p2.d}" fill="none" stroke="${stroke}" stroke-width="${sw}" marker-end="url(#${marker2})"${tAttrs}/>`;
+    const mark = numbered ? edgeStep(dodge(p2.lx, p2.ly, avoid), ti + 1, isErr, true) : edgeMask(p2, label, tone);
+    labels.push(`<g${tAttrs}>${mark}</g>`);
+  });
+  const kinds = { active: false, wait: false, start: false, end: false, errEnd: false };
+  s += `<g${bl("states")}>`;
+  states.forEach((st2, si) => {
+    const r5 = rectFor(st2, cellW, cellH, gapX, gapY, padX, padTop);
+    const place = nodeCellAttrs(st2.col, st2.row);
+    if (st2.kind === "start") {
+      kinds.start = true;
+      s += `<circle cx="${r5.cx}" cy="${r5.cy}" r="10" fill="var(--ink)"${bp(`states.${si}`)}${place}/>`;
+    } else if (st2.kind === "terminal") {
+      const accent = st2.id === accentId;
+      const err = isErrTerminal(st2);
+      if (err) kinds.errEnd = true;
+      else if (!accent) kinds.end = true;
+      const tone = accent ? "var(--accent)" : err ? "var(--negative)" : "var(--ink)";
+      const fill = accent ? "var(--accent-tint)" : err ? "var(--negative-tint)" : "var(--paper)";
+      s += `<g${bp(`states.${si}`)}${place}><circle cx="${r5.cx}" cy="${r5.cy}" r="12" fill="${fill}" stroke="${tone}" stroke-width="1.5"/><circle cx="${r5.cx}" cy="${r5.cy}" r="6" fill="${tone}"/></g>`;
+    } else {
+      const wait = st2.kind === "wait";
+      if (wait) kinds.wait = true;
+      else kinds.active = true;
+      const fill = wait ? "var(--paper-2)" : "var(--paper)";
+      const stroke = wait ? "var(--rule-solid)" : "var(--ink)";
+      const sw = wait ? 1 : 1.5;
+      const lines = nameLines(st2);
+      const nameText = lines.length <= 1 ? `<text x="${r5.cx}" y="${r5.cy + 4.5}" class="t-name" text-anchor="middle"${bp(`states.${si}.name`)}>${escapeHtml(st2.name ?? "")}</text>` : `<g${bp(`states.${si}.name`)}>` + lines.map(
+        (ln2, j2) => `<text x="${r5.cx}" y="${r5.cy + 4.5 - (lines.length - 1) * 7.5 + j2 * 15}" class="t-name" text-anchor="middle">${escapeHtml(ln2)}</text>`
+      ).join("") + `</g>`;
+      s += `<g${bp(`states.${si}`)}${place}><rect x="${r5.x}" y="${r5.y}" width="${r5.w}" height="${r5.h}" rx="23" fill="${fill}" stroke="${stroke}" stroke-width="${sw}"/>` + nameText + `</g>`;
+    }
+  });
+  s += `</g>`;
+  s += labels.join("");
+  s += `</svg>`;
+  const name = (id) => byId.get(id)?.name ?? id;
+  const numCell = (ti) => numbered ? `<td class="t-num"><span class="edge-step"><b>${ti + 1}</b></span></td>` : "";
+  const rows2 = trans.map(
+    (t, ti) => `<tr${bp(`transitions.${ti}`)}${revealAttr(ti)}>` + numCell(ti) + `<td><span class="${pillCls(byId.get(t.from)?.kind)}">${escapeHtml(name(t.from))}</span></td><td style="font-family:var(--font-mono);font-size:11px"${bp(`transitions.${ti}.event`)}>${escapeHtml(t.event)}</td><td class="c-soft" style="font-size:11px"${bp(`transitions.${ti}.guard`)}>${escapeHtml(t.guard ?? "\u2014")}</td><td><span class="${pillCls(byId.get(t.to)?.kind)}">${escapeHtml(name(t.to))}</span></td></tr>`
+  ).join("");
+  const table = trans.length > 0 ? `<table class="transition-table"><thead><tr>${numbered ? "<th>\u2116</th>" : ""}<th>From</th><th>Event</th><th>Guard</th><th>To</th></tr></thead><tbody${bl("transitions")}>${rows2}</tbody></table>` : "";
+  const items = [];
+  if (kinds.start) items.push({ swatch: "chip", chip: "\u25CF", label: "start" });
+  if (kinds.active) items.push({ swatch: "node", label: "state" });
+  if (kinds.wait) items.push({ swatch: "node-fill2", label: "waiting" });
+  if (kinds.end) items.push({ swatch: "chip", chip: "\u25C9", label: "end" });
+  if (used.plain) items.push({ swatch: "edge", label: "transition" });
+  if (kinds.errEnd) items.push({ swatch: "node-negative", label: "error exit" });
+  if (used.error) items.push({ swatch: "edge-error", label: "error transition" });
+  if (accentId !== void 0) items.push({ swatch: "node-accent", label: "success exit" });
+  const legend = renderLegend(items);
+  return diagramFrame(
+    {
+      tag: "STATE",
+      ...data.title !== void 0 ? { title: data.title } : {},
+      ...data.description !== void 0 ? { desc: data.description } : {},
+      ...legend.length > 0 ? { legendHtml: legend } : {},
+      ...table.length > 0 ? { footerHtml: table } : {}
+    },
+    s
+  );
 }
-var SKIN_EDGE = {
-  solid: { stroke: "var(--muted)", sw: 1.5, dash: "", marker: "skArrow", err: false },
-  dashed: { stroke: "var(--muted)", sw: 1.5, dash: "5 4", marker: "skOpen", err: false },
-  forbidden: { stroke: "var(--negative)", sw: 1.5, dash: "4 3", marker: "skErr", err: true },
-  error: { stroke: "var(--negative)", sw: 1.5, dash: "", marker: "skErr", err: true }
-};
 
 // src/svg/dfdShapes.ts
 function dfdKindOf(kind) {