@knowvah/dot-engine 1.2.3 → 1.2.5

package/dist/index.js

@@ -10105,12 +10105,15 @@ function parseAttrs(raw) {
   }
   return out;
 }
+function normalizeTag(tag) {
+  return tag === "TH" ? "TR" : tag;
+}
 function parseCloseToken(inner) {
   const body = inner.slice(1).trim();
   const sp = body.search(/\s/);
   const tag = (sp === -1 ? body : body.slice(0, sp)).toUpperCase();
   checkTag(tag);
-  return { type: "close", tag };
+  return { type: "close", tag: normalizeTag(tag) };
 }
 function cleanText(raw) {
   const isKeep = (c) => c === " " || c === "	" || c === "\n" || c === "\r";
@@ -10144,12 +10147,13 @@ function scanTag(src, start, tokens) {
 function parseOpenToken(inner) {
   const sp = inner.search(/\s/);
   if (sp === -1) {
-    checkTag(inner.toUpperCase());
-    return { type: "open", tag: inner.toUpperCase(), attrs: parseAttrs("") };
+    const tag2 = inner.toUpperCase();
+    checkTag(tag2);
+    return { type: "open", tag: normalizeTag(tag2), attrs: parseAttrs("") };
   }
   const tag = inner.slice(0, sp).toUpperCase();
   checkTag(tag);
-  return { type: "open", tag, attrs: parseAttrs(inner.slice(sp + 1)) };
+  return { type: "open", tag: normalizeTag(tag), attrs: parseAttrs(inner.slice(sp + 1)) };
 }
 function tokenize(src) {
   const tokens = [];
@@ -10374,7 +10378,7 @@ var buildCell = (content, a) => ({
 });
 var parseCell = (s, attrs, fontStack) => buildCell(parseCellContent(s, attrs, fontStack), attrs);
 var processRowToken = (s, t, cells, fontStack) => {
-  if (t.type === "open" && (t.tag === "TD" || t.tag === "TH")) {
+  if (t.type === "open" && t.tag === "TD") {
     consume(s);
     cells.push(parseCell(s, t.attrs, fontStack));
     return;
@@ -16880,1504 +16884,241 @@ function assembleResult(p, dimen, grown, fixedshape) {
   };
 }
 
-// src/common/record.ts
-var HASTEXT = 1;
-var HASPORT = 2;
-var HASTABLE = 4;
-var INTEXT = 8;
-var INPORT = 16;
-var BOTTOM2 = 1;
-var RIGHT2 = 2;
-var TOP2 = 4;
-var LEFT2 = 8;
-var PAD_X = 16;
-var PAD_Y = 8;
-function makeField() {
-  return {
-    size: { x: 0, y: 0 },
-    b: { ll: { x: 0, y: 0 }, ur: { x: 0, y: 0 } },
-    n_flds: 0,
-    lp: null,
-    fld: null,
-    id: null,
-    LR: 0,
-    sides: 0
-  };
+// src/layout/dot/fastgr.ts
+var VIRTUAL = 1;
+var NORMAL = 0;
+var FLATORDER = 4;
+var REVERSED = 3;
+var MC_SCALE = 256;
+function elistAppend(el, e) {
+  el.list[el.size++] = e;
 }
-function recIsEscapedDelim(s, j) {
-  if (s[j] !== "\\") return false;
-  const nx = s[j + 1];
-  return nx === "{" || nx === "}" || nx === "|" || nx === "\\";
+function zapinlist(el, e) {
+  let i = 0;
+  while (i < el.size && el.list[i] !== e) i++;
+  if (i < el.size) {
+    el.list[i] = el.list[--el.size];
+    el.list[el.size] = void 0;
+  }
 }
-function recCountFields(p) {
-  let maxf = 1;
-  let cnt = 0;
-  for (let j = p.i; j < p.s.length; j++) {
-    if (recIsEscapedDelim(p.s, j)) {
-      j++;
-      continue;
+function deleteFastEdge(e) {
+  if (e.tail.info.out) zapinlist(e.tail.info.out, e);
+  if (e.head.info.in) zapinlist(e.head.info.in, e);
+}
+function fastEdge(e) {
+  if (!e.tail.info.out) e.tail.info.out = { list: [], size: 0 };
+  if (!e.head.info.in) e.head.info.in = { list: [], size: 0 };
+  elistAppend(e.tail.info.out, e);
+  elistAppend(e.head.info.in, e);
+}
+function findFastEdge(u, v) {
+  const uOut = u.info.out;
+  const vIn = v.info.in;
+  if (uOut === void 0 || vIn === void 0) return void 0;
+  if (uOut.size <= vIn.size) {
+    for (let i = 0; i < uOut.size; i++) {
+      if (uOut.list[i].head === v) return uOut.list[i];
+    }
+  } else {
+    for (let i = 0; i < vIn.size; i++) {
+      if (vIn.list[i].tail === u) return vIn.list[i];
     }
-    const c = p.s[j];
-    if (c === "{") cnt++;
-    else if (c === "}") cnt--;
-    else if (c === "|" && cnt === 0) maxf++;
-    if (cnt < 0) break;
   }
-  return maxf;
+  return void 0;
 }
-function recOpenPort(p, st) {
-  if (st.mode & (HASTABLE | HASPORT)) return -1;
-  st.mode |= HASPORT | INPORT;
-  p.i++;
-  st.pbuf = [];
-  st.hspIdx = 0;
-  return 0;
+function copyPort(p) {
+  const bp = p.bp !== null ? { ll: { x: p.bp.ll.x, y: p.bp.ll.y }, ur: { x: p.bp.ur.x, y: p.bp.ur.y } } : null;
+  return { p: { x: p.p.x, y: p.p.y }, theta: p.theta, bp, defined: p.defined, constrained: p.constrained, clip: p.clip, dyna: p.dyna, order: p.order, side: p.side, name: p.name };
 }
-function recClosePort(p, st) {
-  if (!(st.mode & INPORT)) return -1;
-  const t = st.pbuf;
-  if (t.length > 1 && st.hspIdx !== t.length - 1 && t[t.length - 1] === " ") t.pop();
-  st.tmpport = t.join("");
-  st.mode &= ~INPORT;
-  p.i++;
-  return 0;
+function copyVirtualPorts(e, orig) {
+  if (e.tail === orig.tail) e.info.tail_port = copyPort(orig.info.tail_port);
+  else if (e.tail === orig.head) e.info.tail_port = copyPort(orig.info.head_port);
+  if (e.head === orig.head) e.info.head_port = copyPort(orig.info.head_port);
+  else if (e.head === orig.tail) e.info.head_port = copyPort(orig.info.tail_port);
 }
-function recOpenTable(p, st, LR) {
-  p.i++;
-  if (st.mode !== 0 || p.i >= p.s.length) return -1;
-  st.mode = HASTABLE;
-  const sub = parseReclbl(p, LR ? 0 : 1, false);
-  if (sub === null) return -1;
-  st.rv.fld[st.fi++] = sub;
-  st.fp = sub;
-  return 0;
+function copyVirtualEdgeInfo(e, orig) {
+  e.info.count = orig.info.count;
+  e.info.xpenalty = orig.info.xpenalty;
+  e.info.weight = orig.info.weight;
+  e.info.minlen = orig.info.minlen;
+  copyVirtualPorts(e, orig);
+  e.info.label = orig.info.label;
+  e.info.head_label = orig.info.head_label;
+  e.info.tail_label = orig.info.tail_label;
+  e.info.xlabel = orig.info.xlabel;
+  if (orig.info.to_virt === void 0) orig.info.to_virt = e;
+  e.info.to_orig = orig;
+  e.seq = orig.seq;
 }
-function recFlushText(p, st) {
-  if (!(st.mode & (HASTEXT | HASTABLE))) {
-    st.mode |= HASTEXT;
-    st.tbuf.push(" ");
-  }
-  if (st.mode & HASTEXT) {
-    const t = st.tbuf;
-    if (t.length > 1 && st.hstIdx !== t.length - 1 && t[t.length - 1] === " ") t.pop();
-    st.fp.lp = makeAnyLabel(
-      t.join(""),
-      false,
-      { fontname: p.lbl.fontname, fontsize: p.lbl.fontsize, fontcolor: p.lbl.fontcolor },
-      p.measurer,
-      p.obj
-    );
-    st.fp.LR = 1;
-    st.tbuf = [];
-    st.hstIdx = 0;
+function newVirtualEdge(u, v, orig) {
+  const e = new Edge(u, v, "");
+  e.info.edge_type = VIRTUAL;
+  if (orig) {
+    copyVirtualEdgeInfo(e, orig);
+  } else {
+    e.info.weight = 1;
+    e.info.xpenalty = 1;
+    e.info.count = 1;
+    e.info.minlen = 1;
   }
+  return e;
 }
-function recEndField(p, st, flag) {
-  const c = p.i < p.s.length ? p.s[p.i] : "";
-  if (c === "" && !flag || st.mode & INPORT) return -1;
-  if (!(st.mode & HASTABLE)) {
-    st.fp = makeField();
-    st.rv.fld[st.fi++] = st.fp;
-  }
-  if (st.tmpport !== null) {
-    st.fp.id = st.tmpport;
-    st.tmpport = null;
-  }
-  recFlushText(p, st);
-  if (c !== "") {
-    if (c === "}") {
-      p.i++;
-      st.rv.n_flds = st.fi;
-      return 1;
-    }
-    st.mode = 0;
-    p.i++;
-    return 0;
-  }
-  st.rv.n_flds = st.fi;
-  return 1;
+function virtualEdge(u, v, orig) {
+  const e = newVirtualEdge(u, v, orig);
+  fastEdge(e);
+  return e;
 }
-function recBackslash(p, st) {
-  const nx = p.s[p.i + 1];
-  if (nx !== void 0) {
-    if (nx < " ") {
-    } else if (nx === " " && !p.lbl.html) {
-      st.ishardspace = true;
-    } else {
-      st.tbuf.push("\\");
-      st.mode |= INTEXT | HASTEXT;
-    }
-    p.i++;
-  }
+function mergeWeightsInto(f, ew, em, ex) {
+  f.info.weight = (f.info.weight ?? 0) + ew;
+  f.info.minlen = Math.max(f.info.minlen ?? 1, em);
+  f.info.count = (f.info.count ?? 1) + 1;
+  f.info.xpenalty = (f.info.xpenalty ?? 0) + ex;
 }
-function recPushText(st, c, html) {
-  const afterSpace = st.tbuf[st.tbuf.length - 1] === " ";
-  if (!(c === " " && !st.ishardspace && afterSpace && !html)) st.tbuf.push(c);
-  if (st.ishardspace) st.hstIdx = st.tbuf.length - 1;
+function basicMerge(e, rep) {
+  const ew = e.info.weight ?? 1;
+  const em = e.info.minlen ?? 1;
+  const ex = e.info.xpenalty ?? 0;
+  for (let f = rep; f !== void 0; f = f.info.to_virt) {
+    mergeWeightsInto(f, ew, em, ex);
+  }
 }
-function recPushPort(st, c) {
-  const atStartOrSpace = st.pbuf.length === 0 || st.pbuf[st.pbuf.length - 1] === " ";
-  if (!(c === " " && !st.ishardspace && atStartOrSpace)) st.pbuf.push(c);
-  if (st.ishardspace) st.hspIdx = st.pbuf.length - 1;
+function mergeOneway(e, rep) {
+  if (e.info.to_virt !== void 0) return;
+  e.info.to_virt = rep;
+  basicMerge(e, rep);
 }
-function recTextChar(p, st, c) {
-  if (st.mode & HASTABLE && c !== " ") return -1;
-  if (!(st.mode & (INTEXT | INPORT)) && c !== " ") st.mode |= INTEXT | HASTEXT;
-  if (st.mode & INTEXT) recPushText(st, c, p.lbl.html);
-  else if (st.mode & INPORT) recPushPort(st, c);
-  p.i++;
-  return 0;
+function deleteFlatEdge(e) {
+  e.info.to_virt = void 0;
+  if (e.tail.info.flat_out) zapinlist(e.tail.info.flat_out, e);
+  if (e.head.info.flat_in) zapinlist(e.head.info.flat_in, e);
 }
-function recDispatch(p, st, LR, flag) {
-  const c = p.s[p.i];
-  switch (c) {
-    case "<":
-      if (p.lbl.html) return recTextChar(p, st, c);
-      return recOpenPort(p, st);
-    case ">":
-      if (p.lbl.html) return recTextChar(p, st, c);
-      return recClosePort(p, st);
-    case "{":
-      return recOpenTable(p, st, LR);
-    case "}":
-    case "|":
-    case void 0:
-      return recEndField(p, st, flag);
-    case "\\":
-      recBackslash(p, st);
-      return recTextChar(p, st, p.s[p.i]);
-    default:
-      return recTextChar(p, st, c);
-  }
+function flatEdge(g, e) {
+  if (!e.tail.info.flat_out) e.tail.info.flat_out = { list: [], size: 0 };
+  if (!e.head.info.flat_in) e.head.info.flat_in = { list: [], size: 0 };
+  elistAppend(e.tail.info.flat_out, e);
+  elistAppend(e.head.info.flat_in, e);
+  g.info.has_flat_edges = true;
 }
-function parseReclbl(p, LR, flag) {
-  const rv = makeField();
-  rv.fld = new Array(recCountFields(p));
-  rv.LR = LR;
-  const st = {
-    rv,
-    fi: 0,
-    mode: 0,
-    tbuf: [],
-    hstIdx: 0,
-    pbuf: [],
-    hspIdx: 0,
-    tmpport: null,
-    ishardspace: false,
-    fp: null
-  };
-  for (; ; ) {
-    if (p.i < p.s.length && p.s[p.i] < " " && p.s[p.i] !== "") {
-      p.i++;
-      continue;
+function findFlatEdge(u, v) {
+  const uOut = u.info.flat_out;
+  const vIn = v.info.flat_in;
+  if (uOut === void 0 || vIn === void 0) return void 0;
+  if (uOut.size <= vIn.size) {
+    for (let i = 0; i < uOut.size; i++) {
+      if (uOut.list[i].head === v) return uOut.list[i];
     }
-    const r = recDispatch(p, st, LR, flag);
-    if (r === -1) return null;
-    if (r === 1) break;
-    if (p.i > p.s.length) break;
-  }
-  rv.n_flds = st.fi;
-  return rv;
-}
-function recLabelDimen(n, g, f) {
-  const dimen = { x: f.lp.dimen.x, y: f.lp.dimen.y };
-  if (dimen.x > 0 || dimen.y > 0) {
-    const m = nodeAttr(n, g, "margin");
-    const parts = m !== void 0 ? m.split(",").map(parseFloat) : [];
-    if (parts.length > 0 && !Number.isNaN(parts[0])) {
-      dimen.x += 2 * parts[0] * 72;
-      dimen.y += 2 * (parts.length > 1 && !Number.isNaN(parts[1]) ? parts[1] : parts[0]) * 72;
-    } else {
-      dimen.x += PAD_X;
-      dimen.y += PAD_Y;
+  } else {
+    for (let i = 0; i < vIn.size; i++) {
+      if (vIn.list[i].tail === u) return vIn.list[i];
     }
   }
-  return dimen;
+  return void 0;
 }
-function sizeReclbl(n, g, f) {
-  let d;
-  if (f.lp) {
-    d = recLabelDimen(n, g, f);
+function reverseEdge(e) {
+  deleteFastEdge(e);
+  e.info.reversed = true;
+  const f = findFastEdge(e.head, e.tail);
+  if (f !== void 0) {
+    mergeOneway(e, f);
   } else {
-    d = { x: 0, y: 0 };
-    for (let i = 0; i < f.n_flds; i++) {
-      const d0 = sizeReclbl(n, g, f.fld[i]);
-      if (f.LR) {
-        d.x += d0.x;
-        d.y = Math.max(d.y, d0.y);
-      } else {
-        d.y += d0.y;
-        d.x = Math.max(d.x, d0.x);
-      }
-    }
+    virtualEdge(e.head, e.tail, e);
   }
-  f.size = d;
-  return d;
 }
-function resizeReclbl(f, sz, nojustify) {
-  const d = { x: sz.x - f.size.x, y: sz.y - f.size.y };
-  f.size = sz;
-  if (f.lp && !nojustify) {
-    f.lp.space.x += d.x;
-    f.lp.space.y += d.y;
-  }
-  if (f.n_flds) {
-    const inc2 = f.LR ? d.x / f.n_flds : d.y / f.n_flds;
-    for (let i = 0; i < f.n_flds; i++) {
-      const sf = f.fld[i];
-      const amt = Math.trunc((i + 1) * inc2) - Math.trunc(i * inc2);
-      const newsz = f.LR ? { x: sf.size.x + amt, y: sz.y } : { x: sz.x, y: sf.size.y + amt };
-      resizeReclbl(sf, newsz, nojustify);
-    }
-  }
+function fastNode(g, n) {
+  n.info.next = g.info.nlist;
+  if (g.info.nlist !== void 0) g.info.nlist.info.prev = n;
+  n.info.prev = void 0;
+  g.info.nlist = n;
 }
-function recSideMask(f, i, last) {
-  if (f.LR) {
-    if (i === 0) return i === last ? TOP2 | BOTTOM2 | RIGHT2 | LEFT2 : TOP2 | BOTTOM2 | LEFT2;
-    return i === last ? TOP2 | BOTTOM2 | RIGHT2 : TOP2 | BOTTOM2;
-  }
-  if (i === 0) return i === last ? TOP2 | BOTTOM2 | RIGHT2 | LEFT2 : TOP2 | RIGHT2 | LEFT2;
-  return i === last ? LEFT2 | BOTTOM2 | RIGHT2 : LEFT2 | RIGHT2;
+function deleteFastNode(g, n) {
+  if (n.info.prev !== void 0) n.info.prev.info.next = n.info.next;
+  else g.info.nlist = n.info.next;
+  if (n.info.next !== void 0) n.info.next.info.prev = n.info.prev;
 }
-function posReclbl(f, ul, sides) {
-  f.sides = sides;
-  f.b = {
-    ll: { x: ul.x, y: ul.y - f.size.y },
-    ur: { x: ul.x + f.size.x, y: ul.y }
-  };
-  const last = f.n_flds - 1;
-  const pos = { x: ul.x, y: ul.y };
-  for (let i = 0; i <= last; i++) {
-    const mask = sides ? recSideMask(f, i, last) : 0;
-    posReclbl(f.fld[i], { x: pos.x, y: pos.y }, sides & mask);
-    if (f.LR) pos.x += f.fld[i].size.x;
-    else pos.y -= f.fld[i].size.y;
+function removeFromRank(g, n) {
+  const r = n.info.rank !== void 0 ? n.info.rank : 0;
+  const rank3 = g.info.rank;
+  if (rank3 === void 0) return;
+  const rk = rank3[r];
+  for (let j = 0; j < rk.n; j++) {
+    const v = rk.v[j];
+    if (v === n) {
+      for (j++; j < rk.n; j++) {
+        rk.v[j - 1] = rk.v[j];
+      }
+      rk.n--;
+      break;
+    }
   }
 }
-function attrBool(n, g, key) {
-  const s = nodeAttr(n, g, key);
-  if (!s || s.toLowerCase() === "false" || s.toLowerCase() === "no") return false;
-  if (s.toLowerCase() === "true" || s.toLowerCase() === "yes") return true;
-  return parseInt(s, 10) !== 0;
+function virtualNode(g) {
+  const n = new Node(0, "", g.root);
+  n.info.node_type = VIRTUAL;
+  n.info.lw = 1;
+  n.info.rw = 1;
+  n.info.ht = 1;
+  n.info.UF_size = 1;
+  n.info.in = { list: [], size: 0 };
+  n.info.out = { list: [], size: 0 };
+  fastNode(g, n);
+  return n;
 }
-function recAttrSize(n, g) {
-  const w = nodeAttr(n, g, "width");
-  const h = nodeAttr(n, g, "height");
-  return {
-    x: (w !== void 0 ? parseFloat(w) : 0.75) * 72,
-    y: (h !== void 0 ? parseFloat(h) : 0.5) * 72
-  };
+function otherEdge(e) {
+  if (!e.tail.info.other) e.tail.info.other = { list: [], size: 0 };
+  elistAppend(e.tail.info.other, e);
 }
-function recParseOrFallback(lbl, measurer, flip, obj) {
-  const p = { s: lbl.text, i: 0, lbl, measurer, obj };
-  const info = parseReclbl(p, flip, true);
-  if (info !== null) return info;
-  const fb = { s: "\\N", i: 0, lbl, measurer, obj };
-  return parseReclbl(fb, flip, true);
+
+// src/common/splines-geom.ts
+function approxEqPt(p, q, tol) {
+  const dx = p.x - q.x;
+  const dy = p.y - q.y;
+  return dx * dx + dy * dy < tol * tol;
 }
-function recordInit(n, g, measurer) {
-  const lbl = n.info.label;
-  const flip = ((g.root.info.rankdir ?? 0) >> 2 & 1) === 1 ? 0 : 1;
-  const info = recParseOrFallback(lbl, measurer, flip, n);
-  sizeReclbl(n, g, info);
-  const sz = recAttrSize(n, g);
-  if (!attrBool(n, g, "fixedsize")) {
-    sz.x = Math.max(info.size.x, sz.x);
-    sz.y = Math.max(info.size.y, sz.y);
+function evalBezier(sp, t, left, right) {
+  const ab = { x: sp[0].x + t * (sp[1].x - sp[0].x), y: sp[0].y + t * (sp[1].y - sp[0].y) };
+  const bc = { x: sp[1].x + t * (sp[2].x - sp[1].x), y: sp[1].y + t * (sp[2].y - sp[1].y) };
+  const cd = { x: sp[2].x + t * (sp[3].x - sp[2].x), y: sp[2].y + t * (sp[3].y - sp[2].y) };
+  const abbc = { x: ab.x + t * (bc.x - ab.x), y: ab.y + t * (bc.y - ab.y) };
+  const bccd = { x: bc.x + t * (cd.x - bc.x), y: bc.y + t * (cd.y - bc.y) };
+  const pt = { x: abbc.x + t * (bccd.x - abbc.x), y: abbc.y + t * (bccd.y - abbc.y) };
+  if (left !== null) {
+    left[0] = sp[0];
+    left[1] = ab;
+    left[2] = abbc;
+    left[3] = pt;
   }
-  resizeReclbl(info, sz, attrBool(n, g, "nojustify"));
-  posReclbl(info, { x: -sz.x / 2, y: sz.y / 2 }, BOTTOM2 | RIGHT2 | TOP2 | LEFT2);
-  n.info.width = info.size.x / 72;
-  n.info.height = (info.size.y + 1) / 72;
-  const ns = gvNodesize(info.size.x, info.size.y + 1, g.root.info.flip === true);
-  n.info.lw = ns.lw;
-  n.info.rw = ns.rw;
-  n.info.ht = ns.ht;
-  n.info.shape_info = info;
+  if (right !== null) {
+    right[0] = pt;
+    right[1] = bccd;
+    right[2] = cd;
+    right[3] = sp[3];
+  }
+  return pt;
 }
-function recordMakeLabel(n, g, measurer) {
-  const labelText = nodeAttr(n, g, "label") ?? n.name;
-  const { fontname, fontsize, fontcolor } = readFontAttrs(n, g);
-  n.info.label = makeLabel(labelText, fontname, fontsize, fontcolor, measurer);
+var HW = 2;
+var SMALL = 1e-10;
+function ptToLine2(a, b, p) {
+  const dx = b.x - a.x;
+  const dy = b.y - a.y;
+  let a2 = (p.y - a.y) * dx - (p.x - a.x) * dy;
+  a2 *= a2;
+  if (a2 < SMALL) return 0;
+  return a2 / (dx * dx + dy * dy);
 }
-function recordNodeInit(n, g, measurer) {
-  recordMakeLabel(n, g, measurer);
-  recordInit(n, g, measurer);
+function checkControlPoints(cp) {
+  const dis1 = ptToLine2(cp[0], cp[3], cp[1]);
+  const dis2 = ptToLine2(cp[0], cp[3], cp[2]);
+  return dis1 < HW * HW && dis2 < HW * HW;
 }
-function genFields(job, n, f) {
-  const renderer = job.renderer;
-  const coord = n.info.coord ?? { x: 0, y: 0 };
-  if (f.lp) {
-    const mid = {
-      x: (f.b.ll.x + f.b.ur.x) / 2 + coord.x,
-      y: (f.b.ll.y + f.b.ur.y) / 2 + coord.y
-    };
-    renderLabel(f.lp, mid, renderer, job);
-  }
-  for (let i = 0; i < f.n_flds; i++) {
-    if (i > 0) genFieldSeparator(job, coord, f, f.fld[i]);
-    genFields(job, n, f.fld[i]);
-  }
-}
-function genFieldSeparator(job, coord, f, child) {
-  const a = { x: 0, y: 0 };
-  const b = { x: 0, y: 0 };
-  if (f.LR) {
-    a.x = child.b.ll.x;
-    a.y = child.b.ll.y;
-    b.x = a.x;
-    b.y = child.b.ur.y;
-  } else {
-    b.x = child.b.ur.x;
-    b.y = child.b.ur.y;
-    a.x = child.b.ll.x;
-    a.y = b.y;
-  }
-  const pts = [
-    transformPoint({ x: a.x + coord.x, y: a.y + coord.y }, job),
-    transformPoint({ x: b.x + coord.x, y: b.y + coord.y }, job)
-  ];
-  job.renderer.polyline(pts, job);
-}
-function recordGencode(rawJob, rawNode) {
-  const job = rawJob;
-  const n = rawNode;
-  if (!job.renderer) return;
-  const f = n.info.shape_info;
-  if (!f) return;
-  const coord = n.info.coord ?? { x: 0, y: 0 };
-  const ll = { x: f.b.ll.x + coord.x, y: f.b.ll.y + coord.y };
-  const ur = { x: f.b.ur.x + coord.x, y: f.b.ur.y + coord.y };
-  const filled = job.obj !== null && applyNodeStyle(job.obj, n, job);
-  drawRecordBox(job, n, ll, ur, filled);
-  genFields(job, n, f);
-}
-function drawRecordBox(job, n, ll, ur, filled) {
-  const isMrecord = nodeAttr(n, n.root, "shape") === "Mrecord";
-  const rounded = isMrecord || parseStyleFlags(nodeAttr(n, n.root, "style")).rounded;
-  if (rounded) {
-    const af = [{ x: ll.x, y: ll.y }, { x: ur.x, y: ll.y }, { x: ur.x, y: ur.y }, { x: ll.x, y: ur.y }];
-    emitRoundedBezier(af, { x: 0, y: 0 }, filled, { renderer: job.renderer, job });
-    return;
-  }
-  const pts = [{ x: ll.x, y: ll.y }, { x: ll.x, y: ur.y }, { x: ur.x, y: ur.y }, { x: ur.x, y: ll.y }].map((q) => transformPoint(q, job));
-  job.renderer.polygon(pts, filled, job);
-}
-
-// src/common/poly-init.ts
-var DEFAULT_LW = 27;
-var DEFAULT_RW = 27;
-var DEFAULT_HT = 36;
-function nodeAttr(n, g, key) {
-  const own = n.attrs.get(key);
-  if (own !== void 0) return own;
-  if (n.nodeDefaultsSnapshot !== void 0) return n.nodeDefaultsSnapshot.get(key);
-  return g.nodeDefaults.get(key) ?? (g !== g.root ? g.root.nodeDefaults.get(key) : void 0);
-}
-function readFontAttrs(n, g) {
-  return {
-    fontname: nodeAttr(n, g, "fontname") ?? DEFAULT_FONTNAME,
-    fontsize: parseFloat(nodeAttr(n, g, "fontsize") ?? String(DEFAULT_FONTSIZE2)),
-    fontcolor: nodeAttr(n, g, "fontcolor") ?? DEFAULT_COLOR2
-  };
-}
-function assignShapeInfo(n, polyDesc) {
-  const w = n.info.width !== void 0 ? n.info.width * 72 : (n.info.lw || DEFAULT_LW) + (n.info.rw || DEFAULT_RW);
-  const h = n.info.height !== void 0 ? n.info.height * 72 : n.info.ht || DEFAULT_HT;
-  const base = n.info.base_width !== void 0 && n.info.base_height !== void 0 ? { w: n.info.base_width * 72, h: n.info.base_height * 72 } : void 0;
-  n.info.shape_info = {
-    ...polyDesc,
-    vertices: computeVertices(polyDesc, w, h, base)
-  };
-}
-function buildNodeLabel(n, g, measurer) {
-  if (n.info.label !== void 0) return;
-  const labelAttr = nodeAttr(n, g, "label");
-  const font = readFontAttrs(n, g);
-  const isHtml = labelAttr !== void 0 && isHtmlValue(labelAttr);
-  const content = isHtml ? htmlValueContent(labelAttr) : labelAttr ?? n.name;
-  n.info.label = makeAnyLabel(content, isHtml, font, measurer, n);
-}
-function polyInit(n, g, measurer) {
-  const shapeName = nodeAttr(n, g, "shape") ?? "ellipse";
-  const shapefile = nodeAttr(n, g, "shapefile");
-  n.info.shape = bindShape(shapeName, shapefile);
-  if (shapefile !== void 0 && shapefile !== "" && shapeName !== "epsf") {
-    console.error(`Warning: No or improper shapefile="${shapefile}" for node "${n.name}"`);
-  }
-  if (n.info.shape.kind === 2 /* SH_RECORD */) {
-    if (n.info.shape_info === void 0) recordNodeInit(n, g, measurer);
-    return;
-  }
-  buildNodeLabel(n, g, measurer);
-  if (n.info.shape_info !== void 0) return;
-  const polyDesc = n.info.shape.polygon;
-  if (polyDesc !== null) assignShapeInfo(n, polyDesc);
-}
-
-// src/render/svg-multicolor.ts
-var THIN_LINE = 0.5;
-function rationalFunction(x, c) {
-  return (x * (x * c[0] + c[1]) + c[2]) / (x + c[3]);
-}
-var COEFFS3LOW = [
-  [
-    [3.85268, -21.229, -0.330434, 0.0127842],
-    [-1.61486, 0.706564, 0.225945, 0.263682],
-    [-0.910164, 0.388383, 551445e-8, 671814e-8],
-    [-0.630184, 0.192402, 98871e-7, 0.0102527]
-  ],
-  [
-    [-0.162211, 9.94329, 0.13723, 0.0124084],
-    [-0.253135, 187735e-8, 0.0230286, 0.01264],
-    [-0.0695069, -0.0437594, 0.0120636, 0.0163087],
-    [-0.0328856, -926032e-8, -173573e-8, 527385e-8]
-  ]
-];
-var COEFFS3HIGH = [
-  [
-    [0.0899116, -19.2349, -4.11711, 0.183362],
-    [0.138148, -1.45804, 1.32044, 1.38474],
-    [0.230903, -0.450262, 0.219963, 0.414038],
-    [0.0590565, -0.101062, 0.0430592, 0.0204699]
-  ],
-  [
-    [0.0164649, 9.89394, 0.0919496, 760802e-8],
-    [0.0191603, -0.0322058, 0.0134667, -0.0825018],
-    [0.0156192, -0.017535, 326508e-8, -0.228157],
-    [-0.0236752, 0.0405821, -0.0173086, 0.176187]
-  ]
-];
-var SAFETY3 = [1e-3, 4.98, 0.207, 67e-4];
-function estimateError(a, b, etaA, etaB) {
-  const eta = 0.5 * (etaA + etaB);
-  const x = b / a;
-  const dEta = etaB - etaA;
-  const cos2 = Math.cos(2 * eta);
-  const cos4 = Math.cos(4 * eta);
-  const cos6 = Math.cos(6 * eta);
-  const c = x < 0.25 ? COEFFS3LOW : COEFFS3HIGH;
-  const c0 = rationalFunction(x, c[0][0]) + cos2 * rationalFunction(x, c[0][1]) + cos4 * rationalFunction(x, c[0][2]) + cos6 * rationalFunction(x, c[0][3]);
-  const c1 = rationalFunction(x, c[1][0]) + cos2 * rationalFunction(x, c[1][1]) + cos4 * rationalFunction(x, c[1][2]) + cos6 * rationalFunction(x, c[1][3]);
-  return rationalFunction(x, SAFETY3) * a * Math.exp(c0 + c1 * dEta);
-}
-function allSubdivsBelowThreshold(a, b, eta1, n, dEta) {
-  let etaA = eta1;
-  for (let i = 0; i < n; i++) {
-    if (estimateError(a, b, etaA, etaA + dEta) > 1e-5) return false;
-    etaA += dEta;
-  }
-  return true;
-}
-function numSubdivisions(a, b, eta1, eta2) {
-  let n = 1;
-  while (n < 1024) {
-    const dEta = (eta2 - eta1) / n;
-    if (dEta <= 0.5 * Math.PI && allSubdivsBelowThreshold(a, b, eta1, n, dEta)) break;
-    n <<= 1;
-  }
-  return n;
-}
-function initArcPath(pts, e, eta1) {
-  const cosE = Math.cos(eta1);
-  const sinE = Math.sin(eta1);
-  const xB = e.cx + e.xsemi * cosE;
-  const yB = e.cy + e.ysemi * sinE;
-  pts.push(
-    { x: e.cx, y: e.cy },
-    { x: e.cx, y: e.cy },
-    { x: xB, y: yB },
-    { x: xB, y: yB }
-  );
-  return { xB, yB, xBDot: -e.xsemi * sinE, yBDot: e.ysemi * cosE };
-}
-function stepBezier(pts, state3, e, sp) {
-  const xA = state3.xB;
-  const yA = state3.yB;
-  const xADot = state3.xBDot;
-  const yADot = state3.yBDot;
-  const newEta = sp.etaB + sp.dEta;
-  const cosE = Math.cos(newEta);
-  const sinE = Math.sin(newEta);
-  state3.xB = e.cx + e.xsemi * cosE;
-  state3.yB = e.cy + e.ysemi * sinE;
-  state3.xBDot = -e.xsemi * sinE;
-  state3.yBDot = e.ysemi * cosE;
-  pts.push({ x: xA + sp.alpha * xADot, y: yA + sp.alpha * yADot });
-  pts.push({ x: state3.xB - sp.alpha * state3.xBDot, y: state3.yB - sp.alpha * state3.yBDot });
-  pts.push({ x: state3.xB, y: state3.yB });
-  return newEta;
-}
-function ellipticWedge(e, angle0, angle1) {
-  const TWOPI2 = 2 * Math.PI;
-  const eta1 = Math.atan2(Math.sin(angle0) / e.ysemi, Math.cos(angle0) / e.xsemi);
-  let eta2 = Math.atan2(Math.sin(angle1) / e.ysemi, Math.cos(angle1) / e.xsemi);
-  eta2 -= TWOPI2 * Math.floor((eta2 - eta1) / TWOPI2);
-  if (angle1 - angle0 > Math.PI && eta2 - eta1 < Math.PI) eta2 += TWOPI2;
-  const n = numSubdivisions(e.xsemi, e.ysemi, eta1, eta2);
-  const dEta = (eta2 - eta1) / n;
-  const t = Math.tan(0.5 * dEta);
-  const alpha = Math.sin(dEta) * (Math.sqrt(4 + 3 * t * t) - 1) / 3;
-  const pts = [];
-  const state3 = initArcPath(pts, e, eta1);
-  let sp = { etaB: eta1, dEta, alpha };
-  for (let i = 0; i < n; i++) sp = { ...sp, etaB: stepBezier(pts, state3, e, sp) };
-  pts.push({ x: state3.xB, y: state3.yB }, { x: e.cx, y: e.cy }, { x: e.cx, y: e.cy });
-  return pts;
-}
-function drawWedge(seg2, e, ctx) {
-  const TWOPI2 = 2 * Math.PI;
-  const angle1 = seg2.isLast ? TWOPI2 : seg2.angle0 + TWOPI2 * seg2.t;
-  const obj = ctx.job.obj;
-  if (obj !== null) obj.fillColor = resolveRenderColor(seg2.color);
-  const ptsUp = ellipticWedge(e, seg2.angle0, angle1);
-  ctx.renderer.bezier(ptsUp.map((p) => ({ x: p.x, y: -p.y })), true, ctx.job);
-  return angle1;
-}
-function wedgedEllipse(job, pf, clrs, renderer) {
-  const { segs, error } = parseSegs(clrs);
-  if (error === 1 || error === 2) return error;
-  const ctrX = (pf[0].x + pf[1].x) / 2;
-  const ctrY = (pf[0].y + pf[1].y) / 2;
-  const e = {
-    cx: ctrX,
-    cy: -ctrY,
-    xsemi: pf[1].x - ctrX,
-    ysemi: Math.abs(pf[1].y - ctrY)
-  };
-  const ctx = { job, renderer };
-  const obj = job.obj;
-  const saved = obj !== null ? obj.penWidth : 1;
-  if (obj !== null && saved > THIN_LINE) obj.penWidth = THIN_LINE;
-  let angle0 = 0;
-  for (let i = 0; i < segs.length; i++) {
-    const s = segs[i];
-    if (s.color === null) break;
-    if (s.t > 0) {
-      angle0 = drawWedge({ angle0, t: s.t, isLast: i + 1 === segs.length, color: s.color }, e, ctx);
-    }
-  }
-  if (obj !== null && saved > THIN_LINE) obj.penWidth = saved;
-  return error;
-}
-function drawBand(p, seg2, ctx) {
-  const obj = ctx.job.obj;
-  if (obj !== null) obj.fillColor = resolveRenderColor(seg2.color);
-  p[1].x = p[2].x = seg2.isLast ? seg2.lastx : p[0].x + seg2.segWidth;
-  ctx.renderer.polygon([...p], true, ctx.job);
-  p[0].x = p[3].x = p[1].x;
-}
-function stripedBox(job, pts, clrs, rotate, renderer) {
-  const { segs, error } = parseSegs(clrs);
-  if (error === 1 || error === 2) return error;
-  const p = rotate ? [{ ...pts[2] }, { ...pts[3] }, { ...pts[0] }, { ...pts[1] }] : [{ ...pts[0] }, { ...pts[1] }, { ...pts[2] }, { ...pts[3] }];
-  const lastx = p[1].x;
-  const xdelta = p[1].x - p[0].x;
-  p[1].x = p[2].x = p[0].x;
-  const ctx = { job, renderer };
-  const obj = job.obj;
-  const saved = obj !== null ? obj.penWidth : 1;
-  if (obj !== null && saved > THIN_LINE) obj.penWidth = THIN_LINE;
-  for (let i = 0; i < segs.length; i++) {
-    const s = segs[i];
-    if (s.color === null) break;
-    if (s.t > 0) {
-      drawBand(p, { color: s.color, isLast: i + 1 === segs.length, segWidth: xdelta * s.t, lastx }, ctx);
-    }
-  }
-  if (obj !== null && saved > THIN_LINE) obj.penWidth = saved;
-  return error;
-}
-
-// src/render/xml-escape.ts
-var RE_DQUOTE = new RegExp('"', "g");
-var RE_SQUOTE = new RegExp("'", "g");
-var RE_AMP_NONENTITY = /&(?![A-Za-z]+;|#[0-9]+;|#x[0-9A-Fa-f]+;)/g;
-function escapeXml(s) {
-  let r = s.replace(RE_AMP_NONENTITY, "&amp;");
-  r = r.replace(/</g, "&lt;");
-  r = r.replace(/>/g, "&gt;");
-  r = r.replace(RE_DQUOTE, "&quot;");
-  r = r.replace(RE_SQUOTE, "&#39;");
-  return r;
-}
-function escapeXmlTitle(s) {
-  let r = escapeXml(s);
-  r = r.replace(/-/g, "&#45;");
-  r = r.replace(/ {2,}/g, (m) => " " + "&#160;".repeat(m.length - 1));
-  return r;
-}
-function escapeXmlText(s) {
-  let r = escapeXml(s);
-  r = r.replace(/-/g, "&#45;");
-  r = r.replace(/\n/g, "&#10;");
-  r = r.replace(/\r/g, "&#13;");
-  r = r.replace(/ {2,}/g, (m) => " " + "&#160;".repeat(m.length - 1));
-  return r;
-}
-
-// src/gvc/device-cluster.ts
-function applyClusterGradient(obj, fill) {
-  obj.fill = fill.kind === "radial" ? 3 /* Radial */ : 2 /* Linear */;
-  obj.fillColor = resolveRenderColor(fill.fillColor);
-  obj.stopColor = resolveRenderColor(fill.stopColor);
-  obj.gradientFrac = fill.frac;
-  obj.gradientAngle = fill.angle;
-}
-function clusterAttr(sg, key) {
-  for (let g = sg; g !== null; g = g.parent) {
-    const v = g.attrs.get(key);
-    if (v !== void 0) return v;
-  }
-  return void 0;
-}
-function clusterStyle(sg) {
-  return clusterAttr(sg, "style");
-}
-function clusterPeripheries(sg) {
-  const raw = clusterAttr(sg, "peripheries");
-  if (raw === void 0 || raw.length === 0) return 1;
-  const v = parseInt(raw, 10);
-  if (Number.isNaN(v)) return 1;
-  return v < 0 ? 0 : v;
-}
-function applyClusterPenState(obj, sg) {
-  const flags = parseStyleFlags(clusterStyle(sg));
-  const pen = clusterAttr(sg, "pencolor") ?? clusterAttr(sg, "color");
-  obj.penColor = clusterPeripheries(sg) === 0 ? resolveRenderColor("transparent") : resolveRenderColor(resolvePenColor(pen));
-  obj.penWidth = resolvePenWidth(flags, clusterAttr(sg, "penwidth"));
-  obj.pen = resolvePenType(flags);
-}
-function clusterAttrsOf(sg) {
-  return {
-    style: clusterStyle(sg),
-    color: clusterAttr(sg, "color"),
-    pencolor: clusterAttr(sg, "pencolor"),
-    fillcolor: clusterAttr(sg, "fillcolor"),
-    bgcolor: clusterAttr(sg, "bgcolor"),
-    penwidth: clusterAttr(sg, "penwidth"),
-    gradientangle: clusterAttr(sg, "gradientangle")
-  };
-}
-function applyClusterObjState(sg, job) {
-  const fillRes = resolveClusterFillEx(clusterAttrsOf(sg));
-  if (job.obj === null) return false;
-  const obj = job.obj;
-  return withColorScheme(clusterAttr(sg, "colorscheme"), () => {
-    applyClusterPenState(obj, sg);
-    if (fillRes.kind === "none") {
-      obj.fill = 0 /* None */;
-      return false;
-    }
-    if (fillRes.kind === "solid") {
-      obj.fill = 1 /* Solid */;
-      obj.fillColor = resolveRenderColor(fillRes.color);
-      return true;
-    }
-    applyClusterGradient(obj, fillRes);
-    return true;
-  });
-}
-
-// src/render/svg-id.ts
-function svgClass(kind, classAttr) {
-  return classAttr !== void 0 && classAttr.length > 0 ? 'class="' + kind + " " + escapeXmlTitle(classAttr) + '"' : 'class="' + kind + '"';
-}
-function svgNodeId(n, job) {
-  return job.objId(n.attrs.get("id"), "node" + (n.id + 1));
-}
-function svgEdgeId(e, job) {
-  return job.objId(e.attrs.get("id"), "edge" + e.graphSeq);
-}
-function svgClusterId(sg, job) {
-  return job.objId(sg.attrs.get("id"), "clust" + sg.seq);
-}
-function svgGraphId(g, job) {
-  return job.objId(g.attrs.get("id"), "graph0", true);
-}
-function svgNodeClass(n) {
-  return svgClass("node", nodeAttr(n, n.root, "class"));
-}
-function svgEdgeClass(e) {
-  return svgClass("edge", e.attrs.get("class"));
-}
-function svgClusterClass(sg) {
-  return svgClass("cluster", clusterAttr(sg, "class"));
-}
-function svgGraphClass(g) {
-  return svgClass("graph", g.attrs.get("class"));
-}
-
-// src/common/poly-gencode.ts
-function isMulticolor(fillcolor) {
-  return fillcolor.includes(":");
-}
-function renderEllipse(ring, coord, renderer, job, filled) {
-  const rx = Math.abs((ring[1].x - ring[0].x) / 2);
-  const ry = Math.abs((ring[1].y - ring[0].y) / 2);
-  const center = transformPoint(coord, job);
-  renderer.ellipse(center, rx, ry, filled, job);
-}
-function renderPolygon(ring, coord, renderer, job, filled) {
-  const pts = ring.map((v) => transformPoint({ x: v.x + coord.x, y: v.y + coord.y }, job));
-  renderer.polygon(pts, filled, job);
-}
-function renderEllipseRing(ring, coord, filled, j, ctx) {
-  if (ctx.style.wedged && j === 0 && isMulticolor(ctx.fillcolor)) {
-    const pf = ring.map(
-      (v) => transformPoint({ x: v.x + coord.x, y: v.y + coord.y }, ctx.job)
-    );
-    wedgedEllipse(ctx.job, pf, ctx.fillcolor, ctx.renderer);
-    renderEllipse(ring, coord, ctx.renderer, ctx.job, false);
-  } else {
-    renderEllipse(ring, coord, ctx.renderer, ctx.job, filled);
-  }
-  if (ctx.diagonals) mcircleHack(ring, coord, ctx);
-}
-function renderStripedRing(ring, coord, ctx) {
-  const af = ring.map((v) => transformPoint({ x: v.x + coord.x, y: v.y + coord.y }, ctx.job));
-  stripedBox(ctx.job, af, ctx.fillcolor, true, ctx.renderer);
-  renderPolygon(ring, coord, ctx.renderer, ctx.job, false);
-}
-function renderPolyRing(ring, coord, filled, j, ctx) {
-  if (ctx.style.striped && j === 0) renderStripedRing(ring, coord, ctx);
-  else if (ctx.underline) underlineDraw(ring, coord, filled, ctx);
-  else if (ctx.shape !== 0 && ctx.shape !== STAR || ctx.diagonals || ctx.rounded) {
-    drawRoundCorners(ring, coord, filled, ctx);
-  } else renderPolygon(ring, coord, ctx.renderer, ctx.job, filled);
-}
-function renderPeripheries(poly, coord, filled, ctx) {
-  const sides = poly.sides <= 2 ? 2 : poly.sides;
-  const verts = poly.vertices;
-  for (let j = 0; j < poly.peripheries; j++) {
-    const ring = verts.slice(j * sides, (j + 1) * sides);
-    if (ring.length < sides) break;
-    const ringFilled = j === 0 ? filled : false;
-    if (poly.sides <= 2) {
-      renderEllipseRing(ring, coord, ringFilled, j, ctx);
-    } else {
-      renderPolyRing(ring, coord, ringFilled, j, ctx);
-    }
-  }
-}
-function renderLabel(label, coord, renderer, job) {
-  if (label.u.kind !== "txt" || label.u.nspans < 1) return;
-  label.pos = coord;
-  label.set = true;
-  const VALIGN_TOP2 = "t".charCodeAt(0);
-  const VALIGN_BOTTOM2 = "b".charCodeAt(0);
-  let py = label.valign === VALIGN_TOP2 ? coord.y + label.space.y / 2 - label.fontsize : label.valign === VALIGN_BOTTOM2 ? coord.y - label.space.y / 2 + label.dimen.y - label.fontsize : coord.y + label.dimen.y / 2 - label.fontsize;
-  for (let i = 0; i < label.u.nspans; i++) {
-    const span = label.u.span[i];
-    const px = span.just === "l" ? coord.x - label.space.x / 2 : span.just === "r" ? coord.x + label.space.x / 2 : coord.x;
-    gvrenderTextspan(renderer, { x: px, y: py }, span, job);
-    py -= span.size.y;
-  }
-}
-function renderNodeLabel(n, coord, renderer, job) {
-  const label = n.info.label;
-  if (label === void 0) return;
-  if (label.html && label.u.kind === "html") {
-    label.pos = coord;
-    label.set = true;
-    const html = label.u.html;
-    withLabelEmitState(job, () => emitHtmlLabel(html, coord, renderer, job));
-  } else {
-    renderLabel(label, coord, renderer, job);
-  }
-}
-function anchorAttr2(n, key) {
-  const v = nodeAttr(n, n.root, key);
-  return v !== void 0 && v !== "" ? v : void 0;
-}
-function resolveTooltip(n, tooltip) {
-  if (tooltip !== void 0) return substObjAnchor(interpretCRNL(tooltip), n);
-  const label = n.info.label;
-  return label?.text ?? "";
-}
-function beginNodeAnchor(n, renderer, job) {
-  const url = anchorAttr2(n, "href") ?? anchorAttr2(n, "URL");
-  const tooltip = anchorAttr2(n, "tooltip");
-  if (url === void 0 && tooltip === void 0) return false;
-  renderer.beginAnchor?.(
-    url !== void 0 ? substObjAnchor(url, n) : "",
-    resolveTooltip(n, tooltip),
-    anchorAttr2(n, "target") ?? "",
-    svgNodeId(n, job),
-    job
-  );
-  return true;
-}
-function applyGradientFields(obj, fill) {
-  obj.fill = fill.kind === "radial" ? 3 /* Radial */ : 2 /* Linear */;
-  obj.fillColor = resolveRenderColor(fill.fillColor);
-  obj.stopColor = resolveRenderColor(fill.stopColor);
-  obj.gradientFrac = fill.frac;
-  obj.gradientAngle = fill.angle;
-}
-function isPointNode(n) {
-  return n.info.shape?.kind === 3 /* SH_POINT */;
-}
-function findFillDflt(n) {
-  const fillcolor = nodeAttr(n, n.root, "fillcolor");
-  if (fillcolor !== void 0 && fillcolor !== "") return fillcolor;
-  const color = nodeAttr(n, n.root, "color");
-  if (color !== void 0 && color !== "") return color;
-  return "black";
-}
-function applyFillState(obj, n, job) {
-  obj.id = svgNodeId(n, job);
-  if (isPointNode(n)) {
-    obj.fill = 1 /* Solid */;
-    obj.fillColor = resolveRenderColor(findFillDflt(n));
-    return true;
-  }
-  const fillRes = resolveNodeFillEx({
-    style: nodeAttr(n, n.root, "style"),
-    fillcolor: nodeAttr(n, n.root, "fillcolor"),
-    color: nodeAttr(n, n.root, "color"),
-    gradientangle: nodeAttr(n, n.root, "gradientangle")
-  });
-  if (fillRes.kind === "none") {
-    obj.fill = 0 /* None */;
-    return false;
-  }
-  if (fillRes.kind === "solid") {
-    obj.fill = 1 /* Solid */;
-    obj.fillColor = resolveRenderColor(fillRes.color);
-    return true;
-  }
-  applyGradientFields(obj, fillRes);
-  return true;
-}
-function applyPenState(obj, styleAttr, colorAttr, penwidthAttr) {
-  const flags = parseStyleFlags(styleAttr);
-  obj.penColor = resolveRenderColor(resolvePenColor(colorAttr));
-  obj.pen = resolvePenType(flags);
-  obj.penWidth = resolvePenWidth(flags, penwidthAttr);
-  obj.rawStyle = styleTokens(styleAttr);
-}
-function applyNodeStyle(obj, n, job) {
-  const styleAttr = nodeAttr(n, n.root, "style");
-  const colorAttr = nodeAttr(n, n.root, "color");
-  const filled = applyFillState(obj, n, job);
-  applyPenState(obj, styleAttr, colorAttr, nodeAttr(n, n.root, "penwidth"));
-  return filled;
-}
-function prepareDrawPoly(poly, filled, obj) {
-  if (poly.peripheries !== 0 || !filled) return poly;
-  obj.penColor = { type: "string", s: "transparent" };
-  return { ...poly, peripheries: 1 };
-}
-function vertexScale(n, poly) {
-  const info = n.info;
-  if (poly.vertices == null || info.width === void 0 || info.height === void 0) {
-    return poly;
-  }
-  const xsize = (info.lw + info.rw) / (info.width * 72);
-  const ysize = info.ht / (info.height * 72);
-  if (Math.abs(xsize - 1) < 1e-9 && Math.abs(ysize - 1) < 1e-9) return poly;
-  return {
-    ...poly,
-    vertices: poly.vertices.map((v) => ({ x: v.x * xsize, y: v.y * ysize }))
-  };
-}
-function resolveNodeDrawCtx(job, n) {
-  const rawPoly = n.info.shape_info;
-  if (rawPoly === void 0 || rawPoly.vertices === void 0) return null;
-  const poly = vertexScale(n, rawPoly);
-  const coord = n.info.coord ?? { x: 0, y: 0 };
-  const obj = job.obj;
-  const filled = obj !== null && applyNodeStyle(obj, n, job);
-  const drawPoly = obj !== null ? prepareDrawPoly(poly, filled, obj) : poly;
-  const styleFlags = parseStyleFlags(nodeAttr(n, n.root, "style"));
-  const ringCtx = {
-    renderer: job.renderer,
-    job,
-    style: styleFlags,
-    fillcolor: nodeAttr(n, n.root, "fillcolor") ?? "",
-    ...specialCornerFlags(drawPoly.option, styleFlags)
-  };
-  return { poly: drawPoly, coord, filled, ringCtx };
-}
-function specialCornerFlags(opt, style) {
-  return {
-    shape: opt.shape,
-    diagonals: opt.diagonals || style.diagonals,
-    rounded: opt.rounded || style.rounded,
-    underline: opt.underline || style.underline
-  };
-}
-function polyGencode(rawJob, rawNode) {
-  const job = rawJob;
-  const n = rawNode;
-  const renderer = job.renderer;
-  if (!renderer) return;
-  const ctx = resolveNodeDrawCtx(job, n);
-  if (ctx === null) return;
-  const clustersLast = (job.flags & EMIT_CLUSTERS_LAST) !== 0;
-  const savedShape = job.obj?.urlMapShape;
-  const savedPts = job.obj?.urlMapPts;
-  let inAnchor = clustersLast ? false : beginNodeAnchor(n, renderer, job);
-  renderPeripheries(ctx.poly, ctx.coord, ctx.filled, ctx.ringCtx);
-  if (!isPointNode(n)) renderNodeLabel(n, ctx.coord, renderer, job);
-  if (clustersLast) {
-    if (job.obj && savedPts !== void 0 && savedShape !== void 0) {
-      job.obj.urlMapShape = savedShape;
-      job.obj.urlMapPts = savedPts;
-    }
-    inAnchor = beginNodeAnchor(n, renderer, job);
-  }
-  if (inAnchor) renderer.endAnchor?.(job);
-}
-
-// src/common/poly-inside.ts
-function sameSide(p0, p1, L0, L1) {
-  const a = -(L1.y - L0.y);
-  const b = L1.x - L0.x;
-  const c = a * L0.x + b * L0.y;
-  const s0 = a * p0.x + b * p0.y - c >= 0;
-  const s1 = a * p1.x + b * p1.y - c >= 0;
-  return s0 === s1;
-}
-function fixedShapeSize(poly) {
-  let xmax = 0;
-  let ymax = 0;
-  for (const v of poly.vertices ?? []) {
-    xmax = Math.max(xmax, Math.abs(v.x));
-    ymax = Math.max(ymax, Math.abs(v.y));
-  }
-  return { w: 2 * xmax, h: 2 * ymax };
-}
-function insideDims(n, xsize, ysize) {
-  const w = 72 * (n.info.width || xsize / 72);
-  const h = 72 * (n.info.height || ysize / 72);
-  return { w, h, ow: 72 * n.info.outline_width || w, oh: 72 * n.info.outline_height || h };
-}
-function insideScale(n, poly) {
-  const flip = n.root.info.flip === true;
-  if (poly.option.fixedshape) {
-    const { w: w2, h: h2 } = fixedShapeSize(poly);
-    const xsize2 = flip ? h2 : w2;
-    const ysize2 = flip ? w2 : h2;
-    return {
-      scalex: xsize2 !== 0 ? w2 / xsize2 : w2,
-      scaley: ysize2 !== 0 ? h2 / ysize2 : h2,
-      boxURx: w2 / 2,
-      boxURy: h2 / 2
-    };
-  }
-  const lwrw = n.info.lw + n.info.rw;
-  const xsize = flip ? n.info.ht : lwrw;
-  const ysize = flip ? lwrw : n.info.ht;
-  const { w, h, ow, oh } = insideDims(n, xsize, ysize);
-  return {
-    scalex: xsize !== 0 ? w / xsize : w,
-    scaley: ysize !== 0 ? h / ysize : h,
-    boxURx: ow / 2,
-    boxURy: oh / 2
-  };
-}
-function polygonWalk(P, vertex, sides) {
-  const O = { x: 0, y: 0 };
-  let i = 0;
-  let i1 = 1 % sides;
-  const Q = vertex[i];
-  const R2 = vertex[i1];
-  if (!sameSide(P, O, Q, R2)) return false;
-  const s = sameSide(P, Q, R2, O);
-  if (s && sameSide(P, R2, O, Q)) return true;
-  for (let j = 1; j < sides; j++) {
-    if (s) {
-      i = i1;
-      i1 = (i + 1) % sides;
-    } else {
-      i1 = i;
-      i = (i + sides - 1) % sides;
-    }
-    if (!sameSide(P, O, vertex[i], vertex[i1])) return false;
-  }
-  return true;
-}
-function insideShape(n, poly, p) {
-  const sc = insideScale(n, poly);
-  const P = { x: p.x * sc.scalex, y: p.y * sc.scaley };
-  if (Math.abs(P.x) > sc.boxURx || Math.abs(P.y) > sc.boxURy) return false;
-  if (poly.sides <= 2) {
-    return Math.hypot(P.x / sc.boxURx, P.y / sc.boxURy) < 1;
-  }
-  const outerStart = (Math.max(poly.peripheries, 1) - 1) * poly.sides;
-  const outer = poly.vertices.slice(outerStart, outerStart + poly.sides);
-  const ring = polygonOutlineRing(outer, poly.sides, poly.penwidth ?? 1);
-  return polygonWalk(P, ring, poly.sides);
-}
-function polyInside(ctx, p) {
-  const n = ctx.node;
-  if (n === void 0) return false;
-  const rankdir = (n.root.info.rankdir ?? 0) & 3;
-  const P = rankdir === 0 ? p : ccwrotatepf(p, rankdir * 90);
-  if (ctx.bp) {
-    const b = ctx.bp;
-    return P.x >= b.ll.x && P.x <= b.ur.x && P.y >= b.ll.y && P.y <= b.ur.y;
-  }
-  const poly = n.info.shape_info;
-  if (poly === void 0 || poly.vertices === null) return false;
-  return insideShape(n, poly, P);
-}
-function starInside(ctx, p) {
-  const n = ctx.node;
-  if (n === void 0) return false;
-  const rankdir = (n.root.info.rankdir ?? 0) & 3;
-  const P = rankdir === 0 ? p : ccwrotatepf(p, rankdir * 90);
-  if (ctx.bp) {
-    const b = ctx.bp;
-    return P.x >= b.ll.x && P.x <= b.ur.x && P.y >= b.ll.y && P.y <= b.ur.y;
-  }
-  const poly = n.info.shape_info;
-  if (poly === void 0 || poly.vertices === null) return false;
-  const sides = poly.sides;
-  const outerStart = (Math.max(poly.peripheries, 1) - 1) * sides;
-  const outer = poly.vertices.slice(outerStart, outerStart + sides);
-  const ring = polygonOutlineRing(outer, sides, poly.penwidth ?? 1);
-  const O = { x: 0, y: 0 };
-  let outcnt = 0;
-  for (let i = 0; i < sides; i += 2) {
-    const Q = ring[i];
-    const R2 = ring[(i + 4) % sides];
-    if (!sameSide(P, O, Q, R2)) outcnt++;
-    if (outcnt === 2) return false;
-  }
-  return true;
-}
-function recordInside(ctx, p) {
-  const n = ctx.node;
-  if (n === void 0) return false;
-  const rankdir = (n.root.info.rankdir ?? 0) & 3;
-  const P = rankdir === 0 ? p : ccwrotatepf(p, rankdir * 90);
-  let bb;
-  if (ctx.bp) {
-    bb = ctx.bp;
-  } else {
-    const fld = n.info.shape_info;
-    if (!fld?.b) return false;
-    bb = fld.b;
-  }
-  const pw = 0.5;
-  return P.x >= bb.ll.x - pw && P.x <= bb.ur.x + pw && P.y >= bb.ll.y - pw && P.y <= bb.ur.y + pw;
-}
-
-// src/layout/dot/fastgr.ts
-var VIRTUAL = 1;
-var NORMAL = 0;
-var FLATORDER = 4;
-var REVERSED = 3;
-var MC_SCALE = 256;
-function elistAppend(el, e) {
-  el.list[el.size++] = e;
-}
-function zapinlist(el, e) {
-  let i = 0;
-  while (i < el.size && el.list[i] !== e) i++;
-  if (i < el.size) {
-    el.list[i] = el.list[--el.size];
-    el.list[el.size] = void 0;
-  }
-}
-function deleteFastEdge(e) {
-  if (e.tail.info.out) zapinlist(e.tail.info.out, e);
-  if (e.head.info.in) zapinlist(e.head.info.in, e);
-}
-function fastEdge(e) {
-  if (!e.tail.info.out) e.tail.info.out = { list: [], size: 0 };
-  if (!e.head.info.in) e.head.info.in = { list: [], size: 0 };
-  elistAppend(e.tail.info.out, e);
-  elistAppend(e.head.info.in, e);
-}
-function findFastEdge(u, v) {
-  const uOut = u.info.out;
-  const vIn = v.info.in;
-  if (uOut === void 0 || vIn === void 0) return void 0;
-  if (uOut.size <= vIn.size) {
-    for (let i = 0; i < uOut.size; i++) {
-      if (uOut.list[i].head === v) return uOut.list[i];
-    }
-  } else {
-    for (let i = 0; i < vIn.size; i++) {
-      if (vIn.list[i].tail === u) return vIn.list[i];
-    }
-  }
-  return void 0;
-}
-function copyPort(p) {
-  const bp = p.bp !== null ? { ll: { x: p.bp.ll.x, y: p.bp.ll.y }, ur: { x: p.bp.ur.x, y: p.bp.ur.y } } : null;
-  return { p: { x: p.p.x, y: p.p.y }, theta: p.theta, bp, defined: p.defined, constrained: p.constrained, clip: p.clip, dyna: p.dyna, order: p.order, side: p.side, name: p.name };
-}
-function copyVirtualPorts(e, orig) {
-  if (e.tail === orig.tail) e.info.tail_port = copyPort(orig.info.tail_port);
-  else if (e.tail === orig.head) e.info.tail_port = copyPort(orig.info.head_port);
-  if (e.head === orig.head) e.info.head_port = copyPort(orig.info.head_port);
-  else if (e.head === orig.tail) e.info.head_port = copyPort(orig.info.tail_port);
-}
-function copyVirtualEdgeInfo(e, orig) {
-  e.info.count = orig.info.count;
-  e.info.xpenalty = orig.info.xpenalty;
-  e.info.weight = orig.info.weight;
-  e.info.minlen = orig.info.minlen;
-  copyVirtualPorts(e, orig);
-  e.info.label = orig.info.label;
-  e.info.head_label = orig.info.head_label;
-  e.info.tail_label = orig.info.tail_label;
-  e.info.xlabel = orig.info.xlabel;
-  if (orig.info.to_virt === void 0) orig.info.to_virt = e;
-  e.info.to_orig = orig;
-  e.seq = orig.seq;
-}
-function newVirtualEdge(u, v, orig) {
-  const e = new Edge(u, v, "");
-  e.info.edge_type = VIRTUAL;
-  if (orig) {
-    copyVirtualEdgeInfo(e, orig);
-  } else {
-    e.info.weight = 1;
-    e.info.xpenalty = 1;
-    e.info.count = 1;
-    e.info.minlen = 1;
-  }
-  return e;
-}
-function virtualEdge(u, v, orig) {
-  const e = newVirtualEdge(u, v, orig);
-  fastEdge(e);
-  return e;
-}
-function mergeWeightsInto(f, ew, em, ex) {
-  f.info.weight = (f.info.weight ?? 0) + ew;
-  f.info.minlen = Math.max(f.info.minlen ?? 1, em);
-  f.info.count = (f.info.count ?? 1) + 1;
-  f.info.xpenalty = (f.info.xpenalty ?? 0) + ex;
-}
-function basicMerge(e, rep) {
-  const ew = e.info.weight ?? 1;
-  const em = e.info.minlen ?? 1;
-  const ex = e.info.xpenalty ?? 0;
-  for (let f = rep; f !== void 0; f = f.info.to_virt) {
-    mergeWeightsInto(f, ew, em, ex);
-  }
-}
-function mergeOneway(e, rep) {
-  if (e.info.to_virt !== void 0) return;
-  e.info.to_virt = rep;
-  basicMerge(e, rep);
-}
-function deleteFlatEdge(e) {
-  e.info.to_virt = void 0;
-  if (e.tail.info.flat_out) zapinlist(e.tail.info.flat_out, e);
-  if (e.head.info.flat_in) zapinlist(e.head.info.flat_in, e);
-}
-function flatEdge(g, e) {
-  if (!e.tail.info.flat_out) e.tail.info.flat_out = { list: [], size: 0 };
-  if (!e.head.info.flat_in) e.head.info.flat_in = { list: [], size: 0 };
-  elistAppend(e.tail.info.flat_out, e);
-  elistAppend(e.head.info.flat_in, e);
-  g.info.has_flat_edges = true;
-}
-function findFlatEdge(u, v) {
-  const uOut = u.info.flat_out;
-  const vIn = v.info.flat_in;
-  if (uOut === void 0 || vIn === void 0) return void 0;
-  if (uOut.size <= vIn.size) {
-    for (let i = 0; i < uOut.size; i++) {
-      if (uOut.list[i].head === v) return uOut.list[i];
-    }
-  } else {
-    for (let i = 0; i < vIn.size; i++) {
-      if (vIn.list[i].tail === u) return vIn.list[i];
-    }
-  }
-  return void 0;
-}
-function reverseEdge(e) {
-  deleteFastEdge(e);
-  e.info.reversed = true;
-  const f = findFastEdge(e.head, e.tail);
-  if (f !== void 0) {
-    mergeOneway(e, f);
-  } else {
-    virtualEdge(e.head, e.tail, e);
-  }
-}
-function fastNode(g, n) {
-  n.info.next = g.info.nlist;
-  if (g.info.nlist !== void 0) g.info.nlist.info.prev = n;
-  n.info.prev = void 0;
-  g.info.nlist = n;
-}
-function deleteFastNode(g, n) {
-  if (n.info.prev !== void 0) n.info.prev.info.next = n.info.next;
-  else g.info.nlist = n.info.next;
-  if (n.info.next !== void 0) n.info.next.info.prev = n.info.prev;
-}
-function removeFromRank(g, n) {
-  const r = n.info.rank !== void 0 ? n.info.rank : 0;
-  const rank3 = g.info.rank;
-  if (rank3 === void 0) return;
-  const rk = rank3[r];
-  for (let j = 0; j < rk.n; j++) {
-    const v = rk.v[j];
-    if (v === n) {
-      for (j++; j < rk.n; j++) {
-        rk.v[j - 1] = rk.v[j];
-      }
-      rk.n--;
-      break;
-    }
-  }
-}
-function virtualNode(g) {
-  const n = new Node(0, "", g.root);
-  n.info.node_type = VIRTUAL;
-  n.info.lw = 1;
-  n.info.rw = 1;
-  n.info.ht = 1;
-  n.info.UF_size = 1;
-  n.info.in = { list: [], size: 0 };
-  n.info.out = { list: [], size: 0 };
-  fastNode(g, n);
-  return n;
-}
-function otherEdge(e) {
-  if (!e.tail.info.other) e.tail.info.other = { list: [], size: 0 };
-  elistAppend(e.tail.info.other, e);
-}
-
-// src/layout/dot/decomp.ts
-function nodesInSeq(g) {
-  return [...g.nodes.values()].sort((a, b) => a.id - b.id);
-}
-function ufFind(n) {
-  while (n.info.UF_parent !== void 0 && n.info.UF_parent !== n) {
-    const gp = n.info.UF_parent.info.UF_parent;
-    if (gp !== void 0) n.info.UF_parent = gp;
-    n = n.info.UF_parent;
-  }
-  return n;
-}
-function ufUnion(u, v) {
-  if (u === v) return u;
-  if (u.info.UF_parent === void 0) {
-    u.info.UF_parent = u;
-    u.info.UF_size = 1;
-  } else u = ufFind(u);
-  if (v.info.UF_parent === void 0) {
-    v.info.UF_parent = v;
-    v.info.UF_size = 1;
-  } else v = ufFind(v);
-  if (u === v) return u;
-  const us = u.info.UF_size ?? 0;
-  const vs = v.info.UF_size ?? 0;
-  v.info.UF_parent = u;
-  u.info.UF_size = us + vs;
-  return u;
-}
-function ufSingleton(u) {
-  u.info.UF_size = 1;
-  u.info.UF_parent = void 0;
-  u.info.ranktype = 0;
-}
-function ufSetname(u, v) {
-  u.info.UF_parent = v;
-  v.info.UF_size = (v.info.UF_size ?? 0) + (u.info.UF_size ?? 0);
-}
-function decompPushNeighbors(stk, el, n, cmark) {
-  if (!el || el.size === 0) return;
-  for (let i = el.size - 1; i >= 0; i--) {
-    const e = el.list[i];
-    const other = e.head === n ? e.tail : e.head;
-    if (other.info.mark !== cmark && other === ufFind(other)) {
-      other.info.mark = cmark + 1;
-      stk.push(other);
-    }
-  }
-}
-function decompSearch(g, start, cmark) {
-  const stk = [];
-  let lastNode;
-  start.info.mark = cmark + 1;
-  stk.push(start);
-  g.info.nlist = void 0;
-  let top;
-  while ((top = stk.pop()) !== void 0) {
-    if (top.info.mark === cmark) continue;
-    top.info.mark = cmark;
-    if (lastNode !== void 0) {
-      top.info.prev = lastNode;
-      lastNode.info.next = top;
-    } else {
-      top.info.prev = void 0;
-      g.info.nlist = top;
-    }
-    lastNode = top;
-    top.info.next = void 0;
-    decompPushNeighbors(stk, top.info.flat_in, top, cmark);
-    decompPushNeighbors(stk, top.info.flat_out, top, cmark);
-    decompPushNeighbors(stk, top.info.in, top, cmark);
-    decompPushNeighbors(stk, top.info.out, top, cmark);
-  }
-}
-var _dc = { cmark: 0 };
-function resolveNode(n, pass) {
-  if (pass > 0) {
-    const subg = n.info.clust;
-    if (subg) return subg.info.rankleader?.[n.info.rank ?? 0];
-  }
-  return n === ufFind(n) ? n : void 0;
-}
-function decompose(g, pass) {
-  if (++_dc.cmark === 0) _dc.cmark = 1;
-  const cmark = _dc.cmark;
-  g.info.comp = [];
-  for (const n of nodesInSeq(g)) {
-    const v = resolveNode(n, pass);
-    if (v !== void 0 && v.info.mark !== cmark) {
-      decompSearch(g, v, cmark);
-      g.info.comp.push(g.info.nlist);
-    }
-  }
-}
-
-// src/layout/dot/mincross-utils.ts
-var CONVERGENCE = 0.995;
-function matrixGet(m, row, col) {
-  if (row >= m.nrows || col >= m.ncols) return false;
-  const idx = row * m.ncols + col;
-  return (m.data[idx >> 3] >> (idx & 7) & 1) === 1;
-}
-function matrixSet(m, row, col) {
-  if (row >= m.nrows || col >= m.ncols) matrixExpand(m, row, col);
-  const idx = row * m.ncols + col;
-  m.data[idx >> 3] |= 1 << (idx & 7);
-}
-function matrixCopyBits(m, data, ncols) {
-  for (let r = 0; r < m.nrows; r++) {
-    for (let c = 0; c < m.ncols; c++) {
-      if (!matrixGet(m, r, c)) continue;
-      const idx = r * ncols + c;
-      data[idx >> 3] |= 1 << (idx & 7);
-    }
-  }
-}
-function matrixExpand(m, row, col) {
-  const nrows = Math.max(m.nrows, row + 1);
-  const ncols = Math.max(m.ncols, col + 1);
-  const bits = nrows * ncols;
-  const bytes = (bits >> 3) + (bits & 7 ? 1 : 0);
-  const data = new Uint8Array(bytes);
-  matrixCopyBits(m, data, ncols);
-  m.nrows = nrows;
-  m.ncols = ncols;
-  m.data = data;
-}
-function newMatrix(rows, cols) {
-  const bits = rows * cols;
-  const bytes = (bits >> 3) + (bits & 7 ? 1 : 0);
-  return { nrows: rows, ncols: cols, data: new Uint8Array(bytes) };
-}
-function dotRoot(g) {
-  return g.info.dotroot ?? g.root;
-}
-function agContainsNode(g, n) {
-  return g.nodes.get(n.name) === n;
-}
-function agContainsEdge(g, e) {
-  return g.edges.includes(e);
-}
-function rankGet(rank3, i) {
-  return rank3.v[(rank3.vStart ?? 0) + i];
-}
-function rankSet(rank3, i, n) {
-  rank3.v[(rank3.vStart ?? 0) + i] = n;
-}
-function isNormalNodeOf(g, v) {
-  return v.info.node_type === NORMAL && agContainsNode(g, v);
-}
-function isVnodeOfEdgeOf(g, v) {
-  if (v.info.node_type !== VIRTUAL) return false;
-  const inSz = v.info.in ? v.info.in.size : 0;
-  const outSz = v.info.out ? v.info.out.size : 0;
-  if (inSz !== 1 || outSz !== 1) return false;
-  let e = v.info.out.list[0];
-  while (e.info.edge_type !== NORMAL && e.info.to_orig) e = e.info.to_orig;
-  return agContainsEdge(g, e);
-}
-function insideCluster(g, v) {
-  return isNormalNodeOf(g, v) || isVnodeOfEdgeOf(g, v);
-}
-function neighborNode(ctx, v, dir) {
-  const rk = ctx.root.info.rank?.[v.info.rank ?? 0];
-  if (!rk) return void 0;
-  const order = v.info.order ?? 0;
-  return (dir < 0 ? order > 0 ? rk.v[order - 1] : void 0 : rk.v[order + 1]) ?? void 0;
-}
-function furthestNode(ctx, g, v, dir) {
-  let rv = v;
-  let u = v;
-  while ((u = neighborNode(ctx, u, dir)) !== void 0) {
-    if (isNormalNodeOf(g, u) || isVnodeOfEdgeOf(g, u)) rv = u;
-  }
-  return rv;
-}
-
-// src/common/splines-geom.ts
-function approxEqPt(p, q, tol) {
-  const dx = p.x - q.x;
-  const dy = p.y - q.y;
-  return dx * dx + dy * dy < tol * tol;
-}
-function evalBezier(sp, t, left, right) {
-  const ab = { x: sp[0].x + t * (sp[1].x - sp[0].x), y: sp[0].y + t * (sp[1].y - sp[0].y) };
-  const bc = { x: sp[1].x + t * (sp[2].x - sp[1].x), y: sp[1].y + t * (sp[2].y - sp[1].y) };
-  const cd = { x: sp[2].x + t * (sp[3].x - sp[2].x), y: sp[2].y + t * (sp[3].y - sp[2].y) };
-  const abbc = { x: ab.x + t * (bc.x - ab.x), y: ab.y + t * (bc.y - ab.y) };
-  const bccd = { x: bc.x + t * (cd.x - bc.x), y: bc.y + t * (cd.y - bc.y) };
-  const pt = { x: abbc.x + t * (bccd.x - abbc.x), y: abbc.y + t * (bccd.y - abbc.y) };
-  if (left !== null) {
-    left[0] = sp[0];
-    left[1] = ab;
-    left[2] = abbc;
-    left[3] = pt;
-  }
-  if (right !== null) {
-    right[0] = pt;
-    right[1] = bccd;
-    right[2] = cd;
-    right[3] = sp[3];
-  }
-  return pt;
-}
-var HW = 2;
-var SMALL = 1e-10;
-function ptToLine2(a, b, p) {
-  const dx = b.x - a.x;
-  const dy = b.y - a.y;
-  let a2 = (p.y - a.y) * dx - (p.x - a.x) * dy;
-  a2 *= a2;
-  if (a2 < SMALL) return 0;
-  return a2 / (dx * dx + dy * dy);
-}
-function checkControlPoints(cp) {
-  const dis1 = ptToLine2(cp[0], cp[3], cp[1]);
-  const dis2 = ptToLine2(cp[0], cp[3], cp[2]);
-  return dis1 < HW * HW && dis2 < HW * HW;
-}
-function anyOutside(bb, cp) {
-  return cp.some((p) => p.x > bb.ur.x || p.x < bb.ll.x || p.y > bb.ur.y || p.y < bb.ll.y);
-}
-function expandByPoints(bb, cp) {
-  for (const p of cp) {
-    if (p.x > bb.ur.x) bb.ur.x = p.x;
-    else if (p.x < bb.ll.x) bb.ll.x = p.x;
-    if (p.y > bb.ur.y) bb.ur.y = p.y;
-    else if (p.y < bb.ll.y) bb.ll.y = p.y;
+function anyOutside(bb, cp) {
+  return cp.some((p) => p.x > bb.ur.x || p.x < bb.ll.x || p.y > bb.ur.y || p.y < bb.ll.y);
+}
+function expandByPoints(bb, cp) {
+  for (const p of cp) {
+    if (p.x > bb.ur.x) bb.ur.x = p.x;
+    else if (p.x < bb.ll.x) bb.ll.x = p.x;
+    if (p.y > bb.ur.y) bb.ur.y = p.y;
+    else if (p.y < bb.ll.y) bb.ll.y = p.y;
   }
 }
 function updateBbBz(bb, cp) {
@@ -19686,7 +18427,23 @@ function clipAndInstall(fe, hn, ps, pn, info) {
   };
   SplineClipHelper.arrowClip(fe, hn, ps, bounds, newspl, info);
   SplineClipHelper.copyToBezier(newspl, ps, bounds.start, bounds.end, g.info.bb);
+  if (clipDump) {
+    let cur = fe;
+    while (cur.info.to_orig != null && cur.info.edge_type !== 0) cur = cur.info.to_orig;
+    clipDump("S5_CLIP", cur.tail.name, cur.head.name, {
+      inputPn: pn,
+      bounds: { start: bounds.start, end: bounds.end },
+      sflag: newspl.sflag,
+      eflag: newspl.eflag,
+      sp: { ...newspl.sp },
+      ep: { ...newspl.ep },
+      size: newspl.size,
+      // emit reads bz.size, not list.length (memory: bezier-emit-size-not-length)
+      list: newspl.list.slice(0, newspl.size).map((p) => ({ ...p }))
+    });
+  }
 }
+var clipDump = null;
 
 // src/common/splines-selfedge.ts
 var SIDE_VERTICES = [12, 4, 6, 2, 3, 1, 9, 8];
@@ -20284,6 +19041,101 @@ function doGraphLabel(sg, measurer) {
   applyLabelBorder(sg, { x: label.dimen.x + 4 * GAP2, y: label.dimen.y + 2 * GAP2 });
 }
 
+// src/layout/dot/decomp.ts
+function nodesInSeq(g) {
+  return [...g.nodes.values()].sort((a, b) => a.id - b.id);
+}
+function ufFind(n) {
+  while (n.info.UF_parent !== void 0 && n.info.UF_parent !== n) {
+    const gp = n.info.UF_parent.info.UF_parent;
+    if (gp !== void 0) n.info.UF_parent = gp;
+    n = n.info.UF_parent;
+  }
+  return n;
+}
+function ufUnion(u, v) {
+  if (u === v) return u;
+  if (u.info.UF_parent === void 0) {
+    u.info.UF_parent = u;
+    u.info.UF_size = 1;
+  } else u = ufFind(u);
+  if (v.info.UF_parent === void 0) {
+    v.info.UF_parent = v;
+    v.info.UF_size = 1;
+  } else v = ufFind(v);
+  if (u === v) return u;
+  const us = u.info.UF_size ?? 0;
+  const vs = v.info.UF_size ?? 0;
+  v.info.UF_parent = u;
+  u.info.UF_size = us + vs;
+  return u;
+}
+function ufSingleton(u) {
+  u.info.UF_size = 1;
+  u.info.UF_parent = void 0;
+  u.info.ranktype = 0;
+}
+function ufSetname(u, v) {
+  u.info.UF_parent = v;
+  v.info.UF_size = (v.info.UF_size ?? 0) + (u.info.UF_size ?? 0);
+}
+function decompPushNeighbors(stk, el, n, cmark) {
+  if (!el || el.size === 0) return;
+  for (let i = el.size - 1; i >= 0; i--) {
+    const e = el.list[i];
+    const other = e.head === n ? e.tail : e.head;
+    if (other.info.mark !== cmark && other === ufFind(other)) {
+      other.info.mark = cmark + 1;
+      stk.push(other);
+    }
+  }
+}
+function decompSearch(g, start, cmark) {
+  const stk = [];
+  let lastNode;
+  start.info.mark = cmark + 1;
+  stk.push(start);
+  g.info.nlist = void 0;
+  let top;
+  while ((top = stk.pop()) !== void 0) {
+    if (top.info.mark === cmark) continue;
+    top.info.mark = cmark;
+    if (lastNode !== void 0) {
+      top.info.prev = lastNode;
+      lastNode.info.next = top;
+    } else {
+      top.info.prev = void 0;
+      g.info.nlist = top;
+    }
+    lastNode = top;
+    top.info.next = void 0;
+    decompPushNeighbors(stk, top.info.flat_in, top, cmark);
+    decompPushNeighbors(stk, top.info.flat_out, top, cmark);
+    decompPushNeighbors(stk, top.info.in, top, cmark);
+    decompPushNeighbors(stk, top.info.out, top, cmark);
+  }
+}
+var _dc = { cmark: 0 };
+function resolveNode(n, pass) {
+  if (pass > 0) {
+    const subg = n.info.clust;
+    if (subg) return subg.info.rankleader?.[n.info.rank ?? 0];
+  }
+  return n === ufFind(n) ? n : void 0;
+}
+function decompose(g, pass) {
+  if (++_dc.cmark === 0) _dc.cmark = 1;
+  const cmark = _dc.cmark;
+  g.info.comp = [];
+  for (const n of nodesInSeq(g)) {
+    const v = resolveNode(n, pass);
+    if (v !== void 0 && v.info.mark !== cmark) {
+      decompSearch(g, v, cmark);
+      g.info.comp.push(g.info.nlist);
+    }
+  }
+}
+
 // src/layout/dot/acyclic.ts
 function dfsStep(stack) {
   const f = stack[stack.length - 1];
@@ -21826,6 +20678,216 @@ function dot2Rank(g) {
   readoutLevels(g, Xg, ncc);
 }
 
+// src/layout/dot/mincross-utils.ts
+var CONVERGENCE = 0.995;
+function matrixGet(m, row, col) {
+  if (row >= m.nrows || col >= m.ncols) return false;
+  const idx = row * m.ncols + col;
+  return (m.data[idx >> 3] >> (idx & 7) & 1) === 1;
+}
+function matrixSet(m, row, col) {
+  if (row >= m.nrows || col >= m.ncols) matrixExpand(m, row, col);
+  const idx = row * m.ncols + col;
+  m.data[idx >> 3] |= 1 << (idx & 7);
+}
+function matrixCopyBits(m, data, ncols) {
+  for (let r = 0; r < m.nrows; r++) {
+    for (let c = 0; c < m.ncols; c++) {
+      if (!matrixGet(m, r, c)) continue;
+      const idx = r * ncols + c;
+      data[idx >> 3] |= 1 << (idx & 7);
+    }
+  }
+}
+function matrixExpand(m, row, col) {
+  const nrows = Math.max(m.nrows, row + 1);
+  const ncols = Math.max(m.ncols, col + 1);
+  const bits = nrows * ncols;
+  const bytes = (bits >> 3) + (bits & 7 ? 1 : 0);
+  const data = new Uint8Array(bytes);
+  matrixCopyBits(m, data, ncols);
+  m.nrows = nrows;
+  m.ncols = ncols;
+  m.data = data;
+}
+function newMatrix(rows, cols) {
+  const bits = rows * cols;
+  const bytes = (bits >> 3) + (bits & 7 ? 1 : 0);
+  return { nrows: rows, ncols: cols, data: new Uint8Array(bytes) };
+}
+function dotRoot(g) {
+  return g.info.dotroot ?? g.root;
+}
+function agContainsNode(g, n) {
+  return g.nodes.get(n.name) === n;
+}
+function agContainsEdge(g, e) {
+  return g.edges.includes(e);
+}
+function rankGet(rank3, i) {
+  return rank3.v[(rank3.vStart ?? 0) + i];
+}
+function rankSet(rank3, i, n) {
+  rank3.v[(rank3.vStart ?? 0) + i] = n;
+}
+function isNormalNodeOf(g, v) {
+  return v.info.node_type === NORMAL && agContainsNode(g, v);
+}
+function isVnodeOfEdgeOf(g, v) {
+  if (v.info.node_type !== VIRTUAL) return false;
+  const inSz = v.info.in ? v.info.in.size : 0;
+  const outSz = v.info.out ? v.info.out.size : 0;
+  if (inSz !== 1 || outSz !== 1) return false;
+  let e = v.info.out.list[0];
+  while (e.info.edge_type !== NORMAL && e.info.to_orig) e = e.info.to_orig;
+  return agContainsEdge(g, e);
+}
+function insideCluster(g, v) {
+  return isNormalNodeOf(g, v) || isVnodeOfEdgeOf(g, v);
+}
+function neighborNode(ctx, v, dir) {
+  const rk = ctx.root.info.rank?.[v.info.rank ?? 0];
+  if (!rk) return void 0;
+  const order = v.info.order ?? 0;
+  return (dir < 0 ? order > 0 ? rk.v[order - 1] : void 0 : rk.v[order + 1]) ?? void 0;
+}
+function furthestNode(ctx, g, v, dir) {
+  let rv = v;
+  let u = v;
+  while ((u = neighborNode(ctx, u, dir)) !== void 0) {
+    if (isNormalNodeOf(g, u) || isVnodeOfEdgeOf(g, u)) rv = u;
+  }
+  return rv;
+}
+
+// src/layout/dot/cluster-path.ts
+var CLUSTER_EDGE = 5;
+function mapInterclustNode(n) {
+  const clust = n.info.clust;
+  if (clust === void 0 || clust.info.expanded) return n;
+  return clust.info.rankleader[n.info.rank ?? 0];
+}
+function makeSlotsContract(root, r, pos, d) {
+  const rk = root.info.rank[r];
+  for (let i = pos - d + 1; i < rk.n; i++) {
+    const v = rk.v[i];
+    v.info.order = i + d - 1;
+    rk.v[v.info.order] = v;
+  }
+  for (let i = rk.n + d - 1; i < rk.n; i++) rk.v[i] = null;
+}
+function makeSlotsExpand(root, r, pos, d) {
+  const rk = root.info.rank[r];
+  for (let i = rk.n - 1; i > pos; i--) {
+    const v = rk.v[i];
+    v.info.order = i + d - 1;
+    rk.v[v.info.order] = v;
+  }
+  for (let i = pos + 1; i < pos + d; i++) rk.v[i] = null;
+}
+function makeSlots(root, r, pos, d) {
+  if (d <= 0) makeSlotsContract(root, r, pos, d);
+  else makeSlotsExpand(root, r, pos, d);
+  root.info.rank[r].n += d - 1;
+}
+function cloneVn(g, vn) {
+  const r = vn.info.rank ?? 0;
+  makeSlots(g, r, vn.info.order, 2);
+  const rv = virtualNode(g);
+  rv.info.lw = vn.info.lw;
+  rv.info.rw = vn.info.rw;
+  rv.info.rank = r;
+  rv.info.order = (vn.info.order ?? 0) + 1;
+  g.info.rank[r].v[rv.info.order] = rv;
+  return rv;
+}
+function safeOtherEdge(e) {
+  if (!e.tail.info.other) e.tail.info.other = { list: [], size: 0 };
+  const other = e.tail.info.other;
+  for (let i = 0; i < other.size; i++) if (other.list[i] === e) return;
+  other.list[other.size++] = e;
+}
+function portsEqSimple(orig, e) {
+  const hp = orig.info.head_port;
+  const tp = orig.info.tail_port;
+  const ehp = e.info.head_port;
+  const etp = e.info.tail_port;
+  return hp.defined === ehp.defined && tp.defined === etp.defined && (!hp.defined || hp.p.x === ehp.p.x && hp.p.y === ehp.p.y) && (!tp.defined || tp.p.x === etp.p.x && tp.p.y === etp.p.y);
+}
+function mapPathAdjacentMulti(from, to, orig, ve, type) {
+  const root = dotRoot(from.root);
+  let u = from;
+  for (let r = from.info.rank ?? 0; r < (to.info.rank ?? 0); r++) {
+    const v = r < (to.info.rank ?? 0) - 1 ? cloneVn(root, ve.head) : to;
+    const e = virtualEdge(u, v, orig);
+    e.info.edge_type = type;
+    u = v;
+    ve.info.count = (ve.info.count ?? 1) - 1;
+    ve = ve.head.info.out.list[0];
+  }
+}
+function mapPathAdjacentSingle(from, to, orig, ve, type) {
+  const existing = findFastEdge(from, to);
+  if (existing !== void 0 && portsEqSimple(orig, existing)) {
+    orig.info.to_virt = existing;
+    existing.info.edge_type = type;
+    existing.info.count = (existing.info.count ?? 1) + 1;
+    if (from.info.node_type === NORMAL && to.info.node_type === NORMAL)
+      safeOtherEdge(orig);
+  } else {
+    orig.info.to_virt = void 0;
+    const e = virtualEdge(from, to, orig);
+    e.info.edge_type = type;
+    ve.info.count = (ve.info.count ?? 1) - 1;
+  }
+}
+function mapPathLongSingle(from, to, orig, ve, type) {
+  let e;
+  if (ve.tail !== from) {
+    orig.info.to_virt = void 0;
+    e = orig.info.to_virt = virtualEdge(from, ve.head, orig);
+    deleteFastEdge(ve);
+  } else {
+    e = ve;
+  }
+  while ((e.head.info.rank ?? 0) !== (to.info.rank ?? 0))
+    e = e.head.info.out.list[0];
+  if (e.head !== to) {
+    const old = e;
+    e = virtualEdge(e.tail, to, orig);
+    e.info.edge_type = type;
+    deleteFastEdge(old);
+  }
+}
+function mapPathMultiEdge(from, to, orig, ve, type) {
+  orig.info.to_virt = void 0;
+  const span = (to.info.rank ?? 0) - (from.info.rank ?? 0);
+  if (span === 1) {
+    const ex = findFastEdge(from, to);
+    if (ex !== void 0 && portsEqSimple(orig, ex)) {
+      mergeOneway(orig, ex);
+      if (from.info.node_type === NORMAL && to.info.node_type === NORMAL)
+        safeOtherEdge(orig);
+      return;
+    }
+  }
+  mapPathAdjacentMulti(from, to, orig, ve, type);
+}
+function mapPath(from, to, orig, ve, type) {
+  if (ve.tail === from && ve.head === to) return;
+  const span = (to.info.rank ?? 0) - (from.info.rank ?? 0);
+  const cnt = ve.info.count ?? 1;
+  if (cnt > 1) mapPathMultiEdge(from, to, orig, ve, type);
+  else if (span === 1) mapPathAdjacentSingle(from, to, orig, ve, type);
+  else mapPathLongSingle(from, to, orig, ve, type);
+}
+function makeInterclustChain(from, to, orig) {
+  const u = mapInterclustNode(from);
+  const v = mapInterclustNode(to);
+  const type = u === from && v === to ? VIRTUAL : CLUSTER_EDGE;
+  mapPath(u, v, orig, orig.info.to_virt, type);
+}
+
 // src/layout/dot/mincross-cross.ts
 var reMincross = false;
 function setReMincross(b) {
@@ -22476,134 +21538,6 @@ function orderedEdges(ctx, g) {
   doOrderingForNodes(ctx, g);
 }
 
-// src/layout/dot/cluster-path.ts
-var CLUSTER_EDGE = 5;
-function mapInterclustNode(n) {
-  const clust = n.info.clust;
-  if (clust === void 0 || clust.info.expanded) return n;
-  return clust.info.rankleader[n.info.rank ?? 0];
-}
-function makeSlotsContract(root, r, pos, d) {
-  const rk = root.info.rank[r];
-  for (let i = pos - d + 1; i < rk.n; i++) {
-    const v = rk.v[i];
-    v.info.order = i + d - 1;
-    rk.v[v.info.order] = v;
-  }
-  for (let i = rk.n + d - 1; i < rk.n; i++) rk.v[i] = null;
-}
-function makeSlotsExpand(root, r, pos, d) {
-  const rk = root.info.rank[r];
-  for (let i = rk.n - 1; i > pos; i--) {
-    const v = rk.v[i];
-    v.info.order = i + d - 1;
-    rk.v[v.info.order] = v;
-  }
-  for (let i = pos + 1; i < pos + d; i++) rk.v[i] = null;
-}
-function makeSlots(root, r, pos, d) {
-  if (d <= 0) makeSlotsContract(root, r, pos, d);
-  else makeSlotsExpand(root, r, pos, d);
-  root.info.rank[r].n += d - 1;
-}
-function cloneVn(g, vn) {
-  const r = vn.info.rank ?? 0;
-  makeSlots(g, r, vn.info.order, 2);
-  const rv = virtualNode(g);
-  rv.info.lw = vn.info.lw;
-  rv.info.rw = vn.info.rw;
-  rv.info.rank = r;
-  rv.info.order = (vn.info.order ?? 0) + 1;
-  g.info.rank[r].v[rv.info.order] = rv;
-  return rv;
-}
-function safeOtherEdge(e) {
-  if (!e.tail.info.other) e.tail.info.other = { list: [], size: 0 };
-  const other = e.tail.info.other;
-  for (let i = 0; i < other.size; i++) if (other.list[i] === e) return;
-  other.list[other.size++] = e;
-}
-function portsEqSimple(orig, e) {
-  const hp = orig.info.head_port;
-  const tp = orig.info.tail_port;
-  const ehp = e.info.head_port;
-  const etp = e.info.tail_port;
-  return hp.defined === ehp.defined && tp.defined === etp.defined && (!hp.defined || hp.p.x === ehp.p.x && hp.p.y === ehp.p.y) && (!tp.defined || tp.p.x === etp.p.x && tp.p.y === etp.p.y);
-}
-function mapPathAdjacentMulti(from, to, orig, ve, type) {
-  const root = dotRoot(from.root);
-  let u = from;
-  for (let r = from.info.rank ?? 0; r < (to.info.rank ?? 0); r++) {
-    const v = r < (to.info.rank ?? 0) - 1 ? cloneVn(root, ve.head) : to;
-    const e = virtualEdge(u, v, orig);
-    e.info.edge_type = type;
-    u = v;
-    ve.info.count = (ve.info.count ?? 1) - 1;
-    ve = ve.head.info.out.list[0];
-  }
-}
-function mapPathAdjacentSingle(from, to, orig, ve, type) {
-  const existing = findFastEdge(from, to);
-  if (existing !== void 0 && portsEqSimple(orig, existing)) {
-    orig.info.to_virt = existing;
-    existing.info.edge_type = type;
-    existing.info.count = (existing.info.count ?? 1) + 1;
-    if (from.info.node_type === NORMAL && to.info.node_type === NORMAL)
-      safeOtherEdge(orig);
-  } else {
-    orig.info.to_virt = void 0;
-    const e = virtualEdge(from, to, orig);
-    e.info.edge_type = type;
-    ve.info.count = (ve.info.count ?? 1) - 1;
-  }
-}
-function mapPathLongSingle(from, to, orig, ve, type) {
-  let e;
-  if (ve.tail !== from) {
-    orig.info.to_virt = void 0;
-    e = orig.info.to_virt = virtualEdge(from, ve.head, orig);
-    deleteFastEdge(ve);
-  } else {
-    e = ve;
-  }
-  while ((e.head.info.rank ?? 0) !== (to.info.rank ?? 0))
-    e = e.head.info.out.list[0];
-  if (e.head !== to) {
-    const old = e;
-    e = virtualEdge(e.tail, to, orig);
-    e.info.edge_type = type;
-    deleteFastEdge(old);
-  }
-}
-function mapPathMultiEdge(from, to, orig, ve, type) {
-  orig.info.to_virt = void 0;
-  const span = (to.info.rank ?? 0) - (from.info.rank ?? 0);
-  if (span === 1) {
-    const ex = findFastEdge(from, to);
-    if (ex !== void 0 && portsEqSimple(orig, ex)) {
-      mergeOneway(orig, ex);
-      if (from.info.node_type === NORMAL && to.info.node_type === NORMAL)
-        safeOtherEdge(orig);
-      return;
-    }
-  }
-  mapPathAdjacentMulti(from, to, orig, ve, type);
-}
-function mapPath(from, to, orig, ve, type) {
-  if (ve.tail === from && ve.head === to) return;
-  const span = (to.info.rank ?? 0) - (from.info.rank ?? 0);
-  const cnt = ve.info.count ?? 1;
-  if (cnt > 1) mapPathMultiEdge(from, to, orig, ve, type);
-  else if (span === 1) mapPathAdjacentSingle(from, to, orig, ve, type);
-  else mapPathLongSingle(from, to, orig, ve, type);
-}
-function makeInterclustChain(from, to, orig) {
-  const u = mapInterclustNode(from);
-  const v = mapInterclustNode(to);
-  const type = u === from && v === to ? VIRTUAL : CLUSTER_EDGE;
-  mapPath(u, v, orig, orig.info.to_virt, type);
-}
-
 // src/layout/dot/cluster.ts
 function interclexpMergeable(prev, e) {
   if (!prev) return false;
@@ -22883,15 +21817,325 @@ function markLowclusterBasic(g) {
   for (let c = 1; c <= nClust; c++) markLowclusterBasic(g.info.clust[c - 1]);
   const outByTail = outEdgesByTail(g.edges);
   for (const n of nodesInSeq(g)) {
-    if (n.info.clust === void 0) n.info.clust = g;
-    const oes = outByTail.get(n);
-    if (oes === void 0) continue;
-    for (const orig of oes) markLowclusterChain(orig, g);
+    if (n.info.clust === void 0) n.info.clust = g;
+    const oes = outByTail.get(n);
+    if (oes === void 0) continue;
+    for (const orig of oes) markLowclusterChain(orig, g);
+  }
+}
+function markLowclusters(root) {
+  markLowclustersZap(root);
+  markLowclusterBasic(root);
+}
+
+// src/layout/dot/classify.ts
+function portsEq(e, f) {
+  const ehp = e.info.head_port;
+  const fhp = f.info.head_port;
+  const etp = e.info.tail_port;
+  const ftp = f.info.tail_port;
+  const headMatch = ehp.p.x === fhp.p.x && ehp.p.y === fhp.p.y || !ehp.defined;
+  const tailMatch = etp.p.x === ftp.p.x && etp.p.y === ftp.p.y || !etp.defined;
+  return ehp.defined === fhp.defined && headMatch && tailMatch;
+}
+function nonconstraintEdge(e) {
+  return e.info.constraint === false;
+}
+var WNODE_ORDINARY = 0;
+var WNODE_SINGLETON = 1;
+var WNODE_VIRTUAL = 2;
+var CLASSIFY_WEIGHT_TABLE = [[1, 1, 1], [1, 2, 2], [1, 2, 4]];
+function epClass(n) {
+  if (n.info.node_type === VIRTUAL) return WNODE_VIRTUAL;
+  if ((n.info.weight_class ?? 2) <= 1) return WNODE_SINGLETON;
+  return WNODE_ORDINARY;
+}
+function applyVirtualWeight(e) {
+  const t = CLASSIFY_WEIGHT_TABLE[epClass(e.tail)][epClass(e.head)];
+  e.info.weight = (e.info.weight ?? 1) * t;
+}
+function interclust1TRank(e) {
+  const clust = e.tail.info.clust;
+  return clust ? (e.tail.info.rank ?? 0) - (clust.info.leader?.info.rank ?? 0) : 0;
+}
+function interclust1HRank(e) {
+  const clust = e.head.info.clust;
+  return clust ? (e.head.info.rank ?? 0) - (clust.info.leader?.info.rank ?? 0) : 0;
+}
+function interclust1Lengths(e) {
+  const offset = (e.info.minlen ?? 1) + interclust1TRank(e) - interclust1HRank(e);
+  return offset > 0 ? [0, offset] : [-offset, 0];
+}
+function interclust1(g, t, h, e) {
+  const [tLen, hLen] = interclust1Lengths(e);
+  const v = virtualNode(g);
+  v.info.node_type = SLACKNODE;
+  const t0 = ufFind(t);
+  const h0 = ufFind(h);
+  const w = e.info.weight ?? 1;
+  const rt = makeAuxEdge(v, t0, tLen, CL_BACK * w);
+  const rh = makeAuxEdge(v, h0, hLen, w);
+  rt.info.to_orig = e;
+  rh.info.to_orig = e;
+}
+function class1Edge(g, e) {
+  if (e.info.to_virt !== void 0) return;
+  if (nonconstraintEdge(e)) return;
+  const t = ufFind(e.tail);
+  const h = ufFind(e.head);
+  if (t === h) return;
+  if (t.info.clust || h.info.clust) {
+    interclust1(g, e.tail, e.head, e);
+    return;
+  }
+  const rep = findFastEdge(t, h);
+  if (rep !== void 0) mergeOneway(e, rep);
+  else virtualEdge(t, h, e);
+}
+function class1(g) {
+  markClusters(g);
+  for (const n of nodesInSeq(g)) {
+    for (const e of n.outEdges(g)) class1Edge(g, e);
+  }
+}
+function labelVnodeDimen(orig) {
+  const lbl = orig.info.label;
+  return lbl?.dimen;
+}
+function labelVnode(g, orig) {
+  const dimen = labelVnodeDimen(orig);
+  const v = virtualNode(g);
+  v.info.label = orig.info.label;
+  v.info.lw = dotRoot(g).info.nodesep ?? 0;
+  if (!orig.info.label_ontop && dimen) {
+    const flip = dotRoot(g).info.flip === true;
+    v.info.ht = flip ? dimen.x : dimen.y;
+    v.info.rw = flip ? dimen.y : dimen.x;
+  }
+  return v;
+}
+function incrWidth(g, v) {
+  const width = Math.floor((g.info.nodesep ?? 0) / 2);
+  v.info.lw = (v.info.lw ?? 0) + width;
+  v.info.rw = (v.info.rw ?? 0) + width;
+}
+function plainVnode(g) {
+  const v = virtualNode(g);
+  incrWidth(g, v);
+  return v;
+}
+function leaderOf(v) {
+  if (v.info.ranktype !== CLUSTER) return ufFind(v);
+  return v.info.clust.info.rankleader[v.info.rank ?? 0];
+}
+function chainVnode(g, orig, r, labelRank) {
+  if (r === labelRank) return labelVnode(g, orig);
+  return plainVnode(g);
+}
+function makeChain(g, from, to, orig) {
+  const labelRank = orig.info.label !== void 0 ? Math.floor(((from.info.rank ?? 0) + (to.info.rank ?? 0)) / 2) : -1;
+  let u = from;
+  const toRank = to.info.rank ?? 0;
+  for (let r = (from.info.rank ?? 0) + 1; r <= toRank; r++) {
+    const v = r < toRank ? (() => {
+      const n = chainVnode(g, orig, r, labelRank);
+      n.info.rank = r;
+      return n;
+    })() : to;
+    const e = virtualEdge(u, v, orig);
+    applyVirtualWeight(e);
+    u = v;
+  }
+}
+function nodeRank3(n) {
+  return n.info.rank ?? 0;
+}
+function edgeCount(e) {
+  return e.info.count ?? 1;
+}
+function edgeXpenalty(e) {
+  return e.info.xpenalty ?? 0;
+}
+function edgeWeight3(e) {
+  return e.info.weight ?? 1;
+}
+function nextVirtEdge(e) {
+  return e.head.info.out?.list[0];
+}
+function mergeChainStep(rep, e, updateCount) {
+  if (updateCount) rep.info.count = edgeCount(rep) + edgeCount(e);
+  rep.info.xpenalty = edgeXpenalty(rep) + edgeXpenalty(e);
+  rep.info.weight = edgeWeight3(rep) + edgeWeight3(e);
+  return nextVirtEdge(rep);
+}
+function mergeChain(g, e, f, updateCount) {
+  const lastrank = Math.max(e.tail.info.rank ?? 0, e.head.info.rank ?? 0);
+  e.info.to_virt = f;
+  let rep = f;
+  while (rep !== void 0) {
+    if ((rep.head.info.rank ?? 0) === lastrank) {
+      mergeChainStep(rep, e, updateCount);
+      break;
+    }
+    incrWidth(g, rep.head);
+    rep = mergeChainStep(rep, e, updateCount);
+  }
+}
+function mergeable(e, f) {
+  if (!e || !f) return false;
+  return e.tail === f.tail && e.head === f.head && e.info.label === f.info.label && portsEq(e, f);
+}
+function interclrepChain(g, e, t, h) {
+  makeChain(g, t, h, e);
+  let cur = e.info.to_virt;
+  while (cur !== void 0 && nodeRank3(cur.head) <= nodeRank3(h)) {
+    cur.info.edge_type = CLUSTER_EDGE;
+    cur = cur.head.info.out?.list[0];
+  }
+}
+function interclrep(g, e) {
+  let t = leaderOf(e.tail);
+  let h = leaderOf(e.head);
+  if (nodeRank3(t) > nodeRank3(h)) {
+    const tmp = t;
+    t = h;
+    h = tmp;
+  }
+  if (t.info.clust === h.info.clust) return;
+  const ve = findFastEdge(t, h);
+  if (ve !== void 0) {
+    mergeChain(g, e, ve, true);
+    return;
+  }
+  if (nodeRank3(t) === nodeRank3(h)) return;
+  interclrepChain(g, e, t, h);
+}
+function isClusterEdge(e) {
+  return e.tail.info.ranktype === CLUSTER || e.head.info.ranktype === CLUSTER;
+}
+function handleClusterMergeable(g, e, prev) {
+  if (prev.info.to_virt !== void 0) {
+    mergeChain(g, e, prev.info.to_virt, false);
+    otherEdge(e);
+  } else if ((e.tail.info.rank ?? 0) === (e.head.info.rank ?? 0)) {
+    mergeOneway(e, prev);
+    otherEdge(e);
+  }
+  return prev;
+}
+function handleClusterEdge(g, e, prev) {
+  if (mergeable(prev, e)) return handleClusterMergeable(g, e, prev);
+  interclrep(g, e);
+  return e;
+}
+function concentrateOrMerge(g, e, prev) {
+  if (dotRoot(g).info.concentrate ?? false) {
+    e.info.edge_type = IGNORED;
+  } else if (prev.info.to_virt !== void 0) {
+    mergeChain(g, e, prev.info.to_virt, true);
+    otherEdge(e);
+  }
+}
+function handleMultiSameRank(e, prev) {
+  if ((e.tail.info.rank ?? 0) !== (e.head.info.rank ?? 0)) return false;
+  mergeOneway(e, prev);
+  otherEdge(e);
+  return true;
+}
+function handleMultiParallel(g, e, prev) {
+  if (e.info.label !== void 0 || prev.info.label !== void 0) return false;
+  if (!portsEq(e, prev)) return false;
+  concentrateOrMerge(g, e, prev);
+  return true;
+}
+function handleMultiEdge(g, e, prev) {
+  if (!prev || e.tail !== prev.tail || e.head !== prev.head) return false;
+  if (handleMultiSameRank(e, prev)) return true;
+  return handleMultiParallel(g, e, prev);
+}
+function oppEdgeConcOrMerge(g, e, opp) {
+  if (e.info.label !== void 0 || opp.info.label !== void 0) return false;
+  if (!portsEq(e, opp)) return false;
+  if (dotRoot(g).info.concentrate ?? false) {
+    e.info.edge_type = IGNORED;
+    opp.info.conc_opp_flag = true;
+  } else {
+    otherEdge(e);
+    mergeChain(g, e, opp.info.to_virt, true);
+  }
+  return true;
+}
+function tryOppEdge(g, e, opp) {
+  if (opp.head !== e.tail) return false;
+  if (opp.info.edge_type === IGNORED) return false;
+  if (opp.info.to_virt === void 0) makeChain(g, opp.tail, opp.head, opp);
+  return oppEdgeConcOrMerge(g, e, opp);
+}
+function handleBackEdge(g, e) {
+  for (const opp of e.head.outEdges(g)) {
+    if (tryOppEdge(g, e, opp)) return void 0;
+  }
+  makeChain(g, e.head, e.tail, e);
+  return e;
+}
+function class2EdgeSameRep(g, e) {
+  if (nodeRank3(e.tail) === nodeRank3(e.head)) {
+    flatEdge(g, e);
+    return e;
+  }
+  if (nodeRank3(e.head) > nodeRank3(e.tail)) {
+    makeChain(g, e.tail, e.head, e);
+    return e;
+  }
+  return handleBackEdge(g, e);
+}
+function class2OneEdge(g, e, prev) {
+  if (e.info.to_virt !== void 0) return e;
+  if (isClusterEdge(e)) return handleClusterEdge(g, e, prev);
+  if (handleMultiEdge(g, e, prev)) return prev;
+  if (e.tail === e.head) {
+    otherEdge(e);
+    return e;
+  }
+  const t = ufFind(e.tail);
+  const h = ufFind(e.head);
+  if (e.tail !== t || e.head !== h) return prev;
+  return class2EdgeSameRep(g, e);
+}
+function class2ProcessNodeEdges(g, oes) {
+  let prev;
+  for (const e of oes) {
+    const next = class2OneEdge(g, e, prev);
+    prev = next !== void 0 ? next : prev;
+  }
+}
+function weightClass(n) {
+  return n.info.weight_class ?? 0;
+}
+function incrWeightClass(n) {
+  if (weightClass(n) <= 2) n.info.weight_class = weightClass(n) + 1;
+}
+function class2WeightClasses(g) {
+  for (const e of g.edges) {
+    incrWeightClass(e.head);
+    incrWeightClass(e.tail);
+  }
+}
+function class2ProcessNodes(g) {
+  const outIdx = buildOutEdgeIndex(g);
+  for (const n of nodesInSeq(g)) {
+    if (n.info.clust === void 0 && n === ufFind(n)) fastNode(g, n);
+    class2ProcessNodeEdges(g, outIdx.get(n) ?? []);
   }
 }
-function markLowclusters(root) {
-  markLowclustersZap(root);
-  markLowclusterBasic(root);
+function class2(g) {
+  g.info.nlist = void 0;
+  markClusters(g);
+  const nClust = g.info.n_cluster ?? 0;
+  for (let c = 1; c <= nClust; c++) buildSkeleton(g, g.info.clust[c - 1]);
+  class2WeightClasses(g);
+  class2ProcessNodes(g);
+  if (g !== dotRoot(g)) g.info.comp = [g.info.nlist ?? null];
 }
 
 // src/layout/dot/rank.ts
@@ -23157,447 +22401,1220 @@ function gNCluster(g) {
 function gClust(g) {
   return g.info.clust ?? [];
 }
-function nRank(n) {
-  return n.info.rank ?? 0;
+function nRank(n) {
+  return n.info.rank ?? 0;
+}
+function nRanktype(n) {
+  return n.info.ranktype ?? 0;
+}
+function gMaxrankDef(g) {
+  return g.info.maxrank ?? -1;
+}
+function gMinrankDef(g) {
+  return g.info.minrank ?? Number.MAX_SAFE_INTEGER;
+}
+function setMinmax(g) {
+  const lr = gLeaderRank(g);
+  g.info.minrank = gMinrankVal(g) + lr;
+  g.info.maxrank = gMaxrankVal(g) + lr;
+  const cl = gClust(g);
+  const nc = gNCluster(g);
+  for (let c = 1; c <= nc; c++) setMinmax(cl[c - 1]);
+}
+function minmaxEdgesReverse(n, isOut) {
+  const rt = n.info.ranktype ?? 0;
+  const flag = isOut ? rt === SINKRANK : rt === SOURCERANK;
+  const list = isOut ? n.info.out : n.info.in;
+  if (list) {
+    while (list.size > 0) reverseEdge(list.list[0]);
+  }
+  return flag ? 1 : 0;
+}
+function minmaxEdges(g) {
+  if (!g.info.maxset && !g.info.minset) return [0, 0];
+  if (g.info.minset) g.info.minset = ufFind(g.info.minset);
+  if (g.info.maxset) g.info.maxset = ufFind(g.info.maxset);
+  const slenY = g.info.maxset ? minmaxEdgesReverse(g.info.maxset, true) : 0;
+  const slenX = g.info.minset ? minmaxEdgesReverse(g.info.minset, false) : 0;
+  return [slenX, slenY];
+}
+function nOutEdge0(n) {
+  return n.info.out?.list[0];
+}
+function nInEdge0(n) {
+  return n.info.in?.list[0];
+}
+function mmEdges2CheckMax(g, n, slen1) {
+  const out = n.info.out;
+  if ((!out || out.size === 0) && g.info.maxset && n !== g.info.maxset) {
+    const ref = nOutEdge0(n) ?? nInEdge0(n);
+    const e = virtualEdge(n, g.info.maxset, ref);
+    e.info.minlen = slen1;
+    e.info.weight = 0;
+    return true;
+  }
+  return false;
+}
+function mmEdges2CheckMin(g, n, slen0) {
+  const inp = n.info.in;
+  if ((!inp || inp.size === 0) && g.info.minset && n !== g.info.minset) {
+    const ref = nInEdge0(n) ?? nOutEdge0(n);
+    const e = virtualEdge(g.info.minset, n, ref);
+    e.info.minlen = slen0;
+    e.info.weight = 0;
+    return true;
+  }
+  return false;
+}
+function minmaxEdges2(g, slen) {
+  if (!g.info.maxset && !g.info.minset) return false;
+  let added = false;
+  for (const n of nodesInSeq(g)) {
+    if (n !== ufFind(n)) continue;
+    if (mmEdges2CheckMax(g, n, slen[1])) added = true;
+    if (mmEdges2CheckMin(g, n, slen[0])) added = true;
+  }
+  return added;
+}
+function rank1(g) {
+  const nslimit1 = g.attrs.get("nslimit1") ?? g.graphDefaultsSnapshot?.get("nslimit1") ?? g.root.attrs.get("nslimit1");
+  const maxiter = nslimit1 ? scaleClamp(g.nodes.size, parseFloat(nslimit1)) : Number.MAX_SAFE_INTEGER;
+  const comp = g.info.comp ?? [];
+  const hasClusters = (g.info.n_cluster ?? 0) > 0;
+  for (let c = 0; c < comp.length; c++) {
+    g.info.nlist = comp[c];
+    rank(g, hasClusters ? 0 : 1, maxiter);
+  }
+}
+function expandNode(g, n) {
+  const leader = ufFind(n);
+  if (leader !== n) n.info.rank = nRank(n) + nRank(leader);
+  if (gMaxrankDef(g) < nRank(n)) g.info.maxrank = n.info.rank;
+  if (gMinrankDef(g) > nRank(n)) g.info.minrank = n.info.rank;
+  if (nRanktype(n) !== 0 && nRanktype(n) !== LEAFSET) ufSingleton(n);
+}
+function expandRankPostprocess(g) {
+  if (clType === LOCAL) {
+    const cl = gClust(g);
+    for (let c = 1; c <= gNCluster(g); c++) setMinmax(cl[c - 1]);
+  } else {
+    findClusters(g);
+  }
+}
+function expandRanksets(g) {
+  const first = g.nodes.values().next().value;
+  if (!first) {
+    g.info.minrank = 0;
+    g.info.maxrank = 0;
+    return;
+  }
+  g.info.minrank = Number.MAX_SAFE_INTEGER;
+  g.info.maxrank = -1;
+  for (const n of nodesInSeq(g)) expandNode(g, n);
+  if (g === (g.info.dotroot ?? g.root)) expandRankPostprocess(g);
+}
+function dot1Rank(g) {
+  edgelabelRanks(g);
+  collapseSets(g, g);
+  class1(g);
+  const slen = minmaxEdges(g);
+  decompose(g, 0);
+  acyclic(g);
+  if (minmaxEdges2(g, slen)) decompose(g, 0);
+  rank1(g);
+  expandRanksets(g);
+  cleanup1(g);
+}
+function dotRank(g) {
+  if (mapbool2(g.attrs.get("newrank"))) {
+    g.info.flags = (g.info.flags ?? 0) | NEW_RANK;
+    dot2Rank(g);
+  } else {
+    dot1Rank(g);
+  }
+}
+
+// src/common/record.ts
+var HASTEXT = 1;
+var HASPORT = 2;
+var HASTABLE = 4;
+var INTEXT = 8;
+var INPORT = 16;
+var BOTTOM2 = 1;
+var RIGHT2 = 2;
+var TOP2 = 4;
+var LEFT2 = 8;
+var PAD_X = 16;
+var PAD_Y = 8;
+function makeField() {
+  return {
+    size: { x: 0, y: 0 },
+    b: { ll: { x: 0, y: 0 }, ur: { x: 0, y: 0 } },
+    n_flds: 0,
+    lp: null,
+    fld: null,
+    id: null,
+    LR: 0,
+    sides: 0
+  };
+}
+function recIsEscapedDelim(s, j) {
+  if (s[j] !== "\\") return false;
+  const nx = s[j + 1];
+  return nx === "{" || nx === "}" || nx === "|" || nx === "\\";
+}
+function recCountFields(p) {
+  let maxf = 1;
+  let cnt = 0;
+  for (let j = p.i; j < p.s.length; j++) {
+    if (recIsEscapedDelim(p.s, j)) {
+      j++;
+      continue;
+    }
+    const c = p.s[j];
+    if (c === "{") cnt++;
+    else if (c === "}") cnt--;
+    else if (c === "|" && cnt === 0) maxf++;
+    if (cnt < 0) break;
+  }
+  return maxf;
+}
+function recOpenPort(p, st) {
+  if (st.mode & (HASTABLE | HASPORT)) return -1;
+  st.mode |= HASPORT | INPORT;
+  p.i++;
+  st.pbuf = [];
+  st.hspIdx = 0;
+  return 0;
+}
+function recClosePort(p, st) {
+  if (!(st.mode & INPORT)) return -1;
+  const t = st.pbuf;
+  if (t.length > 1 && st.hspIdx !== t.length - 1 && t[t.length - 1] === " ") t.pop();
+  st.tmpport = t.join("");
+  st.mode &= ~INPORT;
+  p.i++;
+  return 0;
+}
+function recOpenTable(p, st, LR) {
+  p.i++;
+  if (st.mode !== 0 || p.i >= p.s.length) return -1;
+  st.mode = HASTABLE;
+  const sub = parseReclbl(p, LR ? 0 : 1, false);
+  if (sub === null) return -1;
+  st.rv.fld[st.fi++] = sub;
+  st.fp = sub;
+  return 0;
+}
+function recFlushText(p, st) {
+  if (!(st.mode & (HASTEXT | HASTABLE))) {
+    st.mode |= HASTEXT;
+    st.tbuf.push(" ");
+  }
+  if (st.mode & HASTEXT) {
+    const t = st.tbuf;
+    if (t.length > 1 && st.hstIdx !== t.length - 1 && t[t.length - 1] === " ") t.pop();
+    st.fp.lp = makeAnyLabel(
+      t.join(""),
+      false,
+      { fontname: p.lbl.fontname, fontsize: p.lbl.fontsize, fontcolor: p.lbl.fontcolor },
+      p.measurer,
+      p.obj
+    );
+    st.fp.LR = 1;
+    st.tbuf = [];
+    st.hstIdx = 0;
+  }
+}
+function recEndField(p, st, flag) {
+  const c = p.i < p.s.length ? p.s[p.i] : "";
+  if (c === "" && !flag || st.mode & INPORT) return -1;
+  if (!(st.mode & HASTABLE)) {
+    st.fp = makeField();
+    st.rv.fld[st.fi++] = st.fp;
+  }
+  if (st.tmpport !== null) {
+    st.fp.id = st.tmpport;
+    st.tmpport = null;
+  }
+  recFlushText(p, st);
+  if (c !== "") {
+    if (c === "}") {
+      p.i++;
+      st.rv.n_flds = st.fi;
+      return 1;
+    }
+    st.mode = 0;
+    p.i++;
+    return 0;
+  }
+  st.rv.n_flds = st.fi;
+  return 1;
+}
+function recBackslash(p, st) {
+  const nx = p.s[p.i + 1];
+  if (nx !== void 0) {
+    if (nx < " ") {
+    } else if (nx === " " && !p.lbl.html) {
+      st.ishardspace = true;
+    } else {
+      st.tbuf.push("\\");
+      st.mode |= INTEXT | HASTEXT;
+    }
+    p.i++;
+  }
+}
+function recPushText(st, c, html) {
+  const afterSpace = st.tbuf[st.tbuf.length - 1] === " ";
+  if (!(c === " " && !st.ishardspace && afterSpace && !html)) st.tbuf.push(c);
+  if (st.ishardspace) st.hstIdx = st.tbuf.length - 1;
+}
+function recPushPort(st, c) {
+  const atStartOrSpace = st.pbuf.length === 0 || st.pbuf[st.pbuf.length - 1] === " ";
+  if (!(c === " " && !st.ishardspace && atStartOrSpace)) st.pbuf.push(c);
+  if (st.ishardspace) st.hspIdx = st.pbuf.length - 1;
+}
+function recTextChar(p, st, c) {
+  if (st.mode & HASTABLE && c !== " ") return -1;
+  if (!(st.mode & (INTEXT | INPORT)) && c !== " ") st.mode |= INTEXT | HASTEXT;
+  if (st.mode & INTEXT) recPushText(st, c, p.lbl.html);
+  else if (st.mode & INPORT) recPushPort(st, c);
+  p.i++;
+  return 0;
+}
+function recDispatch(p, st, LR, flag) {
+  const c = p.s[p.i];
+  switch (c) {
+    case "<":
+      if (p.lbl.html) return recTextChar(p, st, c);
+      return recOpenPort(p, st);
+    case ">":
+      if (p.lbl.html) return recTextChar(p, st, c);
+      return recClosePort(p, st);
+    case "{":
+      return recOpenTable(p, st, LR);
+    case "}":
+    case "|":
+    case void 0:
+      return recEndField(p, st, flag);
+    case "\\":
+      recBackslash(p, st);
+      return recTextChar(p, st, p.s[p.i]);
+    default:
+      return recTextChar(p, st, c);
+  }
+}
+function parseReclbl(p, LR, flag) {
+  const rv = makeField();
+  rv.fld = new Array(recCountFields(p));
+  rv.LR = LR;
+  const st = {
+    rv,
+    fi: 0,
+    mode: 0,
+    tbuf: [],
+    hstIdx: 0,
+    pbuf: [],
+    hspIdx: 0,
+    tmpport: null,
+    ishardspace: false,
+    fp: null
+  };
+  for (; ; ) {
+    if (p.i < p.s.length && p.s[p.i] < " " && p.s[p.i] !== "") {
+      p.i++;
+      continue;
+    }
+    const r = recDispatch(p, st, LR, flag);
+    if (r === -1) return null;
+    if (r === 1) break;
+    if (p.i > p.s.length) break;
+  }
+  rv.n_flds = st.fi;
+  return rv;
+}
+function recLabelDimen(n, g, f) {
+  const dimen = { x: f.lp.dimen.x, y: f.lp.dimen.y };
+  if (dimen.x > 0 || dimen.y > 0) {
+    const m = nodeAttr(n, g, "margin");
+    const parts = m !== void 0 ? m.split(",").map(parseFloat) : [];
+    if (parts.length > 0 && !Number.isNaN(parts[0])) {
+      dimen.x += 2 * parts[0] * 72;
+      dimen.y += 2 * (parts.length > 1 && !Number.isNaN(parts[1]) ? parts[1] : parts[0]) * 72;
+    } else {
+      dimen.x += PAD_X;
+      dimen.y += PAD_Y;
+    }
+  }
+  return dimen;
+}
+function sizeReclbl(n, g, f) {
+  let d;
+  if (f.lp) {
+    d = recLabelDimen(n, g, f);
+  } else {
+    d = { x: 0, y: 0 };
+    for (let i = 0; i < f.n_flds; i++) {
+      const d0 = sizeReclbl(n, g, f.fld[i]);
+      if (f.LR) {
+        d.x += d0.x;
+        d.y = Math.max(d.y, d0.y);
+      } else {
+        d.y += d0.y;
+        d.x = Math.max(d.x, d0.x);
+      }
+    }
+  }
+  f.size = d;
+  return d;
+}
+function resizeReclbl(f, sz, nojustify) {
+  const d = { x: sz.x - f.size.x, y: sz.y - f.size.y };
+  f.size = sz;
+  if (f.lp && !nojustify) {
+    f.lp.space.x += d.x;
+    f.lp.space.y += d.y;
+  }
+  if (f.n_flds) {
+    const inc2 = f.LR ? d.x / f.n_flds : d.y / f.n_flds;
+    for (let i = 0; i < f.n_flds; i++) {
+      const sf = f.fld[i];
+      const amt = Math.trunc((i + 1) * inc2) - Math.trunc(i * inc2);
+      const newsz = f.LR ? { x: sf.size.x + amt, y: sz.y } : { x: sz.x, y: sf.size.y + amt };
+      resizeReclbl(sf, newsz, nojustify);
+    }
+  }
+}
+function recSideMask(f, i, last) {
+  if (f.LR) {
+    if (i === 0) return i === last ? TOP2 | BOTTOM2 | RIGHT2 | LEFT2 : TOP2 | BOTTOM2 | LEFT2;
+    return i === last ? TOP2 | BOTTOM2 | RIGHT2 : TOP2 | BOTTOM2;
+  }
+  if (i === 0) return i === last ? TOP2 | BOTTOM2 | RIGHT2 | LEFT2 : TOP2 | RIGHT2 | LEFT2;
+  return i === last ? LEFT2 | BOTTOM2 | RIGHT2 : LEFT2 | RIGHT2;
+}
+function posReclbl(f, ul, sides) {
+  f.sides = sides;
+  f.b = {
+    ll: { x: ul.x, y: ul.y - f.size.y },
+    ur: { x: ul.x + f.size.x, y: ul.y }
+  };
+  const last = f.n_flds - 1;
+  const pos = { x: ul.x, y: ul.y };
+  for (let i = 0; i <= last; i++) {
+    const mask = sides ? recSideMask(f, i, last) : 0;
+    posReclbl(f.fld[i], { x: pos.x, y: pos.y }, sides & mask);
+    if (f.LR) pos.x += f.fld[i].size.x;
+    else pos.y -= f.fld[i].size.y;
+  }
+}
+function attrBool(n, g, key) {
+  return mapbool2(nodeAttr(n, g, key));
+}
+function recAttrSize(n, g) {
+  const w = nodeAttr(n, g, "width");
+  const h = nodeAttr(n, g, "height");
+  return {
+    x: (w !== void 0 ? parseFloat(w) : 0.75) * 72,
+    y: (h !== void 0 ? parseFloat(h) : 0.5) * 72
+  };
+}
+function recParseOrFallback(lbl, measurer, flip, obj) {
+  const p = { s: lbl.text, i: 0, lbl, measurer, obj };
+  const info = parseReclbl(p, flip, true);
+  if (info !== null) return info;
+  const fb = { s: "\\N", i: 0, lbl, measurer, obj };
+  return parseReclbl(fb, flip, true);
+}
+function recordInit(n, g, measurer) {
+  const lbl = n.info.label;
+  const flip = ((g.root.info.rankdir ?? 0) >> 2 & 1) === 1 ? 0 : 1;
+  const info = recParseOrFallback(lbl, measurer, flip, n);
+  sizeReclbl(n, g, info);
+  const sz = recAttrSize(n, g);
+  if (!attrBool(n, g, "fixedsize")) {
+    sz.x = Math.max(info.size.x, sz.x);
+    sz.y = Math.max(info.size.y, sz.y);
+  }
+  resizeReclbl(info, sz, attrBool(n, g, "nojustify"));
+  posReclbl(info, { x: -sz.x / 2, y: sz.y / 2 }, BOTTOM2 | RIGHT2 | TOP2 | LEFT2);
+  n.info.width = info.size.x / 72;
+  n.info.height = (info.size.y + 1) / 72;
+  const ns = gvNodesize(info.size.x, info.size.y + 1, g.root.info.flip === true);
+  n.info.lw = ns.lw;
+  n.info.rw = ns.rw;
+  n.info.ht = ns.ht;
+  n.info.shape_info = info;
+}
+function recordMakeLabel(n, g, measurer) {
+  const labelText = nodeAttr(n, g, "label") ?? n.name;
+  const { fontname, fontsize, fontcolor } = readFontAttrs(n, g);
+  n.info.label = makeLabel(labelText, fontname, fontsize, fontcolor, measurer);
+}
+function recordNodeInit(n, g, measurer) {
+  recordMakeLabel(n, g, measurer);
+  recordInit(n, g, measurer);
+}
+function genFields(job, n, f) {
+  const renderer = job.renderer;
+  const coord = n.info.coord ?? { x: 0, y: 0 };
+  if (f.lp) {
+    const mid = {
+      x: (f.b.ll.x + f.b.ur.x) / 2 + coord.x,
+      y: (f.b.ll.y + f.b.ur.y) / 2 + coord.y
+    };
+    renderLabel(f.lp, mid, renderer, job);
+  }
+  for (let i = 0; i < f.n_flds; i++) {
+    if (i > 0) genFieldSeparator(job, coord, f, f.fld[i]);
+    genFields(job, n, f.fld[i]);
+  }
+}
+function genFieldSeparator(job, coord, f, child) {
+  const a = { x: 0, y: 0 };
+  const b = { x: 0, y: 0 };
+  if (f.LR) {
+    a.x = child.b.ll.x;
+    a.y = child.b.ll.y;
+    b.x = a.x;
+    b.y = child.b.ur.y;
+  } else {
+    b.x = child.b.ur.x;
+    b.y = child.b.ur.y;
+    a.x = child.b.ll.x;
+    a.y = b.y;
+  }
+  const pts = [
+    transformPoint({ x: a.x + coord.x, y: a.y + coord.y }, job),
+    transformPoint({ x: b.x + coord.x, y: b.y + coord.y }, job)
+  ];
+  job.renderer.polyline(pts, job);
+}
+function recordGencode(rawJob, rawNode) {
+  const job = rawJob;
+  const n = rawNode;
+  if (!job.renderer) return;
+  const f = n.info.shape_info;
+  if (!f) return;
+  const coord = n.info.coord ?? { x: 0, y: 0 };
+  const ll = { x: f.b.ll.x + coord.x, y: f.b.ll.y + coord.y };
+  const ur = { x: f.b.ur.x + coord.x, y: f.b.ur.y + coord.y };
+  const filled = job.obj !== null && applyNodeStyle(job.obj, n, job);
+  drawRecordBox(job, n, ll, ur, filled);
+  genFields(job, n, f);
+}
+function drawRecordBox(job, n, ll, ur, filled) {
+  const isMrecord = nodeAttr(n, n.root, "shape") === "Mrecord";
+  const rounded = isMrecord || parseStyleFlags(nodeAttr(n, n.root, "style")).rounded;
+  if (rounded) {
+    const af = [{ x: ll.x, y: ll.y }, { x: ur.x, y: ll.y }, { x: ur.x, y: ur.y }, { x: ll.x, y: ur.y }];
+    emitRoundedBezier(af, { x: 0, y: 0 }, filled, { renderer: job.renderer, job });
+    return;
+  }
+  const pts = [{ x: ll.x, y: ll.y }, { x: ll.x, y: ur.y }, { x: ur.x, y: ur.y }, { x: ur.x, y: ll.y }].map((q) => transformPoint(q, job));
+  job.renderer.polygon(pts, filled, job);
 }
-function nRanktype(n) {
-  return n.info.ranktype ?? 0;
+
+// src/common/poly-init.ts
+var DEFAULT_LW = 27;
+var DEFAULT_RW = 27;
+var DEFAULT_HT = 36;
+function nodeAttr(n, g, key) {
+  const own = n.attrs.get(key);
+  if (own !== void 0) return own;
+  if (n.nodeDefaultsSnapshot !== void 0) return n.nodeDefaultsSnapshot.get(key);
+  return g.nodeDefaults.get(key) ?? (g !== g.root ? g.root.nodeDefaults.get(key) : void 0);
 }
-function gMaxrankDef(g) {
-  return g.info.maxrank ?? -1;
+function readFontAttrs(n, g) {
+  return {
+    fontname: nodeAttr(n, g, "fontname") ?? DEFAULT_FONTNAME,
+    fontsize: parseFloat(nodeAttr(n, g, "fontsize") ?? String(DEFAULT_FONTSIZE2)),
+    fontcolor: nodeAttr(n, g, "fontcolor") ?? DEFAULT_COLOR2
+  };
 }
-function gMinrankDef(g) {
-  return g.info.minrank ?? Number.MAX_SAFE_INTEGER;
+function assignShapeInfo(n, polyDesc) {
+  const w = n.info.width !== void 0 ? n.info.width * 72 : (n.info.lw || DEFAULT_LW) + (n.info.rw || DEFAULT_RW);
+  const h = n.info.height !== void 0 ? n.info.height * 72 : n.info.ht || DEFAULT_HT;
+  const base = n.info.base_width !== void 0 && n.info.base_height !== void 0 ? { w: n.info.base_width * 72, h: n.info.base_height * 72 } : void 0;
+  n.info.shape_info = {
+    ...polyDesc,
+    vertices: computeVertices(polyDesc, w, h, base)
+  };
 }
-function setMinmax(g) {
-  const lr = gLeaderRank(g);
-  g.info.minrank = gMinrankVal(g) + lr;
-  g.info.maxrank = gMaxrankVal(g) + lr;
-  const cl = gClust(g);
-  const nc = gNCluster(g);
-  for (let c = 1; c <= nc; c++) setMinmax(cl[c - 1]);
+function buildNodeLabel(n, g, measurer) {
+  if (n.info.label !== void 0) return;
+  const labelAttr = nodeAttr(n, g, "label");
+  const font = readFontAttrs(n, g);
+  const isHtml = labelAttr !== void 0 && isHtmlValue(labelAttr);
+  const content = isHtml ? htmlValueContent(labelAttr) : labelAttr ?? n.name;
+  n.info.label = makeAnyLabel(content, isHtml, font, measurer, n);
 }
-function minmaxEdgesReverse(n, isOut) {
-  const rt = n.info.ranktype ?? 0;
-  const flag = isOut ? rt === SINKRANK : rt === SOURCERANK;
-  const list = isOut ? n.info.out : n.info.in;
-  if (list) {
-    while (list.size > 0) reverseEdge(list.list[0]);
+function polyInit(n, g, measurer) {
+  const shapeName = nodeAttr(n, g, "shape") ?? "ellipse";
+  const shapefile = nodeAttr(n, g, "shapefile");
+  n.info.shape = bindShape(shapeName, shapefile);
+  if (shapefile !== void 0 && shapefile !== "" && shapeName !== "epsf") {
+    console.error(`Warning: No or improper shapefile="${shapefile}" for node "${n.name}"`);
   }
-  return flag ? 1 : 0;
-}
-function minmaxEdges(g) {
-  if (!g.info.maxset && !g.info.minset) return [0, 0];
-  if (g.info.minset) g.info.minset = ufFind(g.info.minset);
-  if (g.info.maxset) g.info.maxset = ufFind(g.info.maxset);
-  const slenY = g.info.maxset ? minmaxEdgesReverse(g.info.maxset, true) : 0;
-  const slenX = g.info.minset ? minmaxEdgesReverse(g.info.minset, false) : 0;
-  return [slenX, slenY];
+  if (n.info.shape.kind === 2 /* SH_RECORD */) {
+    if (n.info.shape_info === void 0) recordNodeInit(n, g, measurer);
+    return;
+  }
+  buildNodeLabel(n, g, measurer);
+  if (n.info.shape_info !== void 0) return;
+  const polyDesc = n.info.shape.polygon;
+  if (polyDesc !== null) assignShapeInfo(n, polyDesc);
 }
-function nOutEdge0(n) {
-  return n.info.out?.list[0];
+
+// src/render/svg-multicolor.ts
+var THIN_LINE = 0.5;
+function rationalFunction(x, c) {
+  return (x * (x * c[0] + c[1]) + c[2]) / (x + c[3]);
 }
-function nInEdge0(n) {
-  return n.info.in?.list[0];
+var COEFFS3LOW = [
+  [
+    [3.85268, -21.229, -0.330434, 0.0127842],
+    [-1.61486, 0.706564, 0.225945, 0.263682],
+    [-0.910164, 0.388383, 551445e-8, 671814e-8],
+    [-0.630184, 0.192402, 98871e-7, 0.0102527]
+  ],
+  [
+    [-0.162211, 9.94329, 0.13723, 0.0124084],
+    [-0.253135, 187735e-8, 0.0230286, 0.01264],
+    [-0.0695069, -0.0437594, 0.0120636, 0.0163087],
+    [-0.0328856, -926032e-8, -173573e-8, 527385e-8]
+  ]
+];
+var COEFFS3HIGH = [
+  [
+    [0.0899116, -19.2349, -4.11711, 0.183362],
+    [0.138148, -1.45804, 1.32044, 1.38474],
+    [0.230903, -0.450262, 0.219963, 0.414038],
+    [0.0590565, -0.101062, 0.0430592, 0.0204699]
+  ],
+  [
+    [0.0164649, 9.89394, 0.0919496, 760802e-8],
+    [0.0191603, -0.0322058, 0.0134667, -0.0825018],
+    [0.0156192, -0.017535, 326508e-8, -0.228157],
+    [-0.0236752, 0.0405821, -0.0173086, 0.176187]
+  ]
+];
+var SAFETY3 = [1e-3, 4.98, 0.207, 67e-4];
+function estimateError(a, b, etaA, etaB) {
+  const eta = 0.5 * (etaA + etaB);
+  const x = b / a;
+  const dEta = etaB - etaA;
+  const cos2 = Math.cos(2 * eta);
+  const cos4 = Math.cos(4 * eta);
+  const cos6 = Math.cos(6 * eta);
+  const c = x < 0.25 ? COEFFS3LOW : COEFFS3HIGH;
+  const c0 = rationalFunction(x, c[0][0]) + cos2 * rationalFunction(x, c[0][1]) + cos4 * rationalFunction(x, c[0][2]) + cos6 * rationalFunction(x, c[0][3]);
+  const c1 = rationalFunction(x, c[1][0]) + cos2 * rationalFunction(x, c[1][1]) + cos4 * rationalFunction(x, c[1][2]) + cos6 * rationalFunction(x, c[1][3]);
+  return rationalFunction(x, SAFETY3) * a * Math.exp(c0 + c1 * dEta);
 }
-function mmEdges2CheckMax(g, n, slen1) {
-  const out = n.info.out;
-  if ((!out || out.size === 0) && g.info.maxset && n !== g.info.maxset) {
-    const ref = nOutEdge0(n) ?? nInEdge0(n);
-    const e = virtualEdge(n, g.info.maxset, ref);
-    e.info.minlen = slen1;
-    e.info.weight = 0;
-    return true;
+function allSubdivsBelowThreshold(a, b, eta1, n, dEta) {
+  let etaA = eta1;
+  for (let i = 0; i < n; i++) {
+    if (estimateError(a, b, etaA, etaA + dEta) > 1e-5) return false;
+    etaA += dEta;
   }
-  return false;
+  return true;
 }
-function mmEdges2CheckMin(g, n, slen0) {
-  const inp = n.info.in;
-  if ((!inp || inp.size === 0) && g.info.minset && n !== g.info.minset) {
-    const ref = nInEdge0(n) ?? nOutEdge0(n);
-    const e = virtualEdge(g.info.minset, n, ref);
-    e.info.minlen = slen0;
-    e.info.weight = 0;
-    return true;
+function numSubdivisions(a, b, eta1, eta2) {
+  let n = 1;
+  while (n < 1024) {
+    const dEta = (eta2 - eta1) / n;
+    if (dEta <= 0.5 * Math.PI && allSubdivsBelowThreshold(a, b, eta1, n, dEta)) break;
+    n <<= 1;
   }
-  return false;
+  return n;
 }
-function minmaxEdges2(g, slen) {
-  if (!g.info.maxset && !g.info.minset) return false;
-  let added = false;
-  for (const n of nodesInSeq(g)) {
-    if (n !== ufFind(n)) continue;
-    if (mmEdges2CheckMax(g, n, slen[1])) added = true;
-    if (mmEdges2CheckMin(g, n, slen[0])) added = true;
-  }
-  return added;
+function initArcPath(pts, e, eta1) {
+  const cosE = Math.cos(eta1);
+  const sinE = Math.sin(eta1);
+  const xB = e.cx + e.xsemi * cosE;
+  const yB = e.cy + e.ysemi * sinE;
+  pts.push(
+    { x: e.cx, y: e.cy },
+    { x: e.cx, y: e.cy },
+    { x: xB, y: yB },
+    { x: xB, y: yB }
+  );
+  return { xB, yB, xBDot: -e.xsemi * sinE, yBDot: e.ysemi * cosE };
 }
-function rank1(g) {
-  const nslimit1 = g.attrs.get("nslimit1") ?? g.graphDefaultsSnapshot?.get("nslimit1") ?? g.root.attrs.get("nslimit1");
-  const maxiter = nslimit1 ? scaleClamp(g.nodes.size, parseFloat(nslimit1)) : Number.MAX_SAFE_INTEGER;
-  const comp = g.info.comp ?? [];
-  const hasClusters = (g.info.n_cluster ?? 0) > 0;
-  for (let c = 0; c < comp.length; c++) {
-    g.info.nlist = comp[c];
-    rank(g, hasClusters ? 0 : 1, maxiter);
-  }
+function stepBezier(pts, state3, e, sp) {
+  const xA = state3.xB;
+  const yA = state3.yB;
+  const xADot = state3.xBDot;
+  const yADot = state3.yBDot;
+  const newEta = sp.etaB + sp.dEta;
+  const cosE = Math.cos(newEta);
+  const sinE = Math.sin(newEta);
+  state3.xB = e.cx + e.xsemi * cosE;
+  state3.yB = e.cy + e.ysemi * sinE;
+  state3.xBDot = -e.xsemi * sinE;
+  state3.yBDot = e.ysemi * cosE;
+  pts.push({ x: xA + sp.alpha * xADot, y: yA + sp.alpha * yADot });
+  pts.push({ x: state3.xB - sp.alpha * state3.xBDot, y: state3.yB - sp.alpha * state3.yBDot });
+  pts.push({ x: state3.xB, y: state3.yB });
+  return newEta;
 }
-function expandNode(g, n) {
-  const leader = ufFind(n);
-  if (leader !== n) n.info.rank = nRank(n) + nRank(leader);
-  if (gMaxrankDef(g) < nRank(n)) g.info.maxrank = n.info.rank;
-  if (gMinrankDef(g) > nRank(n)) g.info.minrank = n.info.rank;
-  if (nRanktype(n) !== 0 && nRanktype(n) !== LEAFSET) ufSingleton(n);
+function ellipticWedge(e, angle0, angle1) {
+  const TWOPI2 = 2 * Math.PI;
+  const eta1 = Math.atan2(Math.sin(angle0) / e.ysemi, Math.cos(angle0) / e.xsemi);
+  let eta2 = Math.atan2(Math.sin(angle1) / e.ysemi, Math.cos(angle1) / e.xsemi);
+  eta2 -= TWOPI2 * Math.floor((eta2 - eta1) / TWOPI2);
+  if (angle1 - angle0 > Math.PI && eta2 - eta1 < Math.PI) eta2 += TWOPI2;
+  const n = numSubdivisions(e.xsemi, e.ysemi, eta1, eta2);
+  const dEta = (eta2 - eta1) / n;
+  const t = Math.tan(0.5 * dEta);
+  const alpha = Math.sin(dEta) * (Math.sqrt(4 + 3 * t * t) - 1) / 3;
+  const pts = [];
+  const state3 = initArcPath(pts, e, eta1);
+  let sp = { etaB: eta1, dEta, alpha };
+  for (let i = 0; i < n; i++) sp = { ...sp, etaB: stepBezier(pts, state3, e, sp) };
+  pts.push({ x: state3.xB, y: state3.yB }, { x: e.cx, y: e.cy }, { x: e.cx, y: e.cy });
+  return pts;
 }
-function expandRankPostprocess(g) {
-  if (clType === LOCAL) {
-    const cl = gClust(g);
-    for (let c = 1; c <= gNCluster(g); c++) setMinmax(cl[c - 1]);
-  } else {
-    findClusters(g);
-  }
+function drawWedge(seg2, e, ctx) {
+  const TWOPI2 = 2 * Math.PI;
+  const angle1 = seg2.isLast ? TWOPI2 : seg2.angle0 + TWOPI2 * seg2.t;
+  const obj = ctx.job.obj;
+  if (obj !== null) obj.fillColor = resolveRenderColor(seg2.color);
+  const ptsUp = ellipticWedge(e, seg2.angle0, angle1);
+  ctx.renderer.bezier(ptsUp.map((p) => ({ x: p.x, y: -p.y })), true, ctx.job);
+  return angle1;
 }
-function expandRanksets(g) {
-  const first = g.nodes.values().next().value;
-  if (!first) {
-    g.info.minrank = 0;
-    g.info.maxrank = 0;
-    return;
+function wedgedEllipse(job, pf, clrs, renderer) {
+  const { segs, error } = parseSegs(clrs);
+  if (error === 1 || error === 2) return error;
+  const ctrX = (pf[0].x + pf[1].x) / 2;
+  const ctrY = (pf[0].y + pf[1].y) / 2;
+  const e = {
+    cx: ctrX,
+    cy: -ctrY,
+    xsemi: pf[1].x - ctrX,
+    ysemi: Math.abs(pf[1].y - ctrY)
+  };
+  const ctx = { job, renderer };
+  const obj = job.obj;
+  const saved = obj !== null ? obj.penWidth : 1;
+  if (obj !== null && saved > THIN_LINE) obj.penWidth = THIN_LINE;
+  let angle0 = 0;
+  for (let i = 0; i < segs.length; i++) {
+    const s = segs[i];
+    if (s.color === null) break;
+    if (s.t > 0) {
+      angle0 = drawWedge({ angle0, t: s.t, isLast: i + 1 === segs.length, color: s.color }, e, ctx);
+    }
   }
-  g.info.minrank = Number.MAX_SAFE_INTEGER;
-  g.info.maxrank = -1;
-  for (const n of nodesInSeq(g)) expandNode(g, n);
-  if (g === (g.info.dotroot ?? g.root)) expandRankPostprocess(g);
+  if (obj !== null && saved > THIN_LINE) obj.penWidth = saved;
+  return error;
 }
-function dot1Rank(g) {
-  edgelabelRanks(g);
-  collapseSets(g, g);
-  class1(g);
-  const slen = minmaxEdges(g);
-  decompose(g, 0);
-  acyclic(g);
-  if (minmaxEdges2(g, slen)) decompose(g, 0);
-  rank1(g);
-  expandRanksets(g);
-  cleanup1(g);
+function drawBand(p, seg2, ctx) {
+  const obj = ctx.job.obj;
+  if (obj !== null) obj.fillColor = resolveRenderColor(seg2.color);
+  p[1].x = p[2].x = seg2.isLast ? seg2.lastx : p[0].x + seg2.segWidth;
+  ctx.renderer.polygon([...p], true, ctx.job);
+  p[0].x = p[3].x = p[1].x;
 }
-function dotRank(g) {
-  if (mapbool2(g.attrs.get("newrank"))) {
-    g.info.flags = (g.info.flags ?? 0) | NEW_RANK;
-    dot2Rank(g);
-  } else {
-    dot1Rank(g);
+function stripedBox(job, pts, clrs, rotate, renderer) {
+  const { segs, error } = parseSegs(clrs);
+  if (error === 1 || error === 2) return error;
+  const p = rotate ? [{ ...pts[2] }, { ...pts[3] }, { ...pts[0] }, { ...pts[1] }] : [{ ...pts[0] }, { ...pts[1] }, { ...pts[2] }, { ...pts[3] }];
+  const lastx = p[1].x;
+  const xdelta = p[1].x - p[0].x;
+  p[1].x = p[2].x = p[0].x;
+  const ctx = { job, renderer };
+  const obj = job.obj;
+  const saved = obj !== null ? obj.penWidth : 1;
+  if (obj !== null && saved > THIN_LINE) obj.penWidth = THIN_LINE;
+  for (let i = 0; i < segs.length; i++) {
+    const s = segs[i];
+    if (s.color === null) break;
+    if (s.t > 0) {
+      drawBand(p, { color: s.color, isLast: i + 1 === segs.length, segWidth: xdelta * s.t, lastx }, ctx);
+    }
   }
+  if (obj !== null && saved > THIN_LINE) obj.penWidth = saved;
+  return error;
 }
 
-// src/layout/dot/classify.ts
-function portsEq(e, f) {
-  const ehp = e.info.head_port;
-  const fhp = f.info.head_port;
-  const etp = e.info.tail_port;
-  const ftp = f.info.tail_port;
-  const headMatch = ehp.p.x === fhp.p.x && ehp.p.y === fhp.p.y || !ehp.defined;
-  const tailMatch = etp.p.x === ftp.p.x && etp.p.y === ftp.p.y || !etp.defined;
-  return ehp.defined === fhp.defined && headMatch && tailMatch;
-}
-function nonconstraintEdge(e) {
-  return e.info.constraint === false;
+// src/render/xml-escape.ts
+var RE_DQUOTE = new RegExp('"', "g");
+var RE_SQUOTE = new RegExp("'", "g");
+var RE_AMP_NONENTITY = /&(?![A-Za-z]+;|#[0-9]+;|#x[0-9A-Fa-f]+;)/g;
+function escapeXml(s) {
+  let r = s.replace(RE_AMP_NONENTITY, "&amp;");
+  r = r.replace(/</g, "&lt;");
+  r = r.replace(/>/g, "&gt;");
+  r = r.replace(RE_DQUOTE, "&quot;");
+  r = r.replace(RE_SQUOTE, "&#39;");
+  return r;
 }
-var WNODE_ORDINARY = 0;
-var WNODE_SINGLETON = 1;
-var WNODE_VIRTUAL = 2;
-var CLASSIFY_WEIGHT_TABLE = [[1, 1, 1], [1, 2, 2], [1, 2, 4]];
-function epClass(n) {
-  if (n.info.node_type === VIRTUAL) return WNODE_VIRTUAL;
-  if ((n.info.weight_class ?? 2) <= 1) return WNODE_SINGLETON;
-  return WNODE_ORDINARY;
+function escapeXmlTitle(s) {
+  let r = escapeXml(s);
+  r = r.replace(/-/g, "&#45;");
+  r = r.replace(/ {2,}/g, (m) => " " + "&#160;".repeat(m.length - 1));
+  return r;
 }
-function applyVirtualWeight(e) {
-  const t = CLASSIFY_WEIGHT_TABLE[epClass(e.tail)][epClass(e.head)];
-  e.info.weight = (e.info.weight ?? 1) * t;
+function escapeXmlText(s) {
+  let r = escapeXml(s);
+  r = r.replace(/-/g, "&#45;");
+  r = r.replace(/\n/g, "&#10;");
+  r = r.replace(/\r/g, "&#13;");
+  r = r.replace(/ {2,}/g, (m) => " " + "&#160;".repeat(m.length - 1));
+  return r;
 }
-function interclust1TRank(e) {
-  const clust = e.tail.info.clust;
-  return clust ? (e.tail.info.rank ?? 0) - (clust.info.leader?.info.rank ?? 0) : 0;
+
+// src/gvc/device-cluster.ts
+function applyClusterGradient(obj, fill) {
+  obj.fill = fill.kind === "radial" ? 3 /* Radial */ : 2 /* Linear */;
+  obj.fillColor = resolveRenderColor(fill.fillColor);
+  obj.stopColor = resolveRenderColor(fill.stopColor);
+  obj.gradientFrac = fill.frac;
+  obj.gradientAngle = fill.angle;
 }
-function interclust1HRank(e) {
-  const clust = e.head.info.clust;
-  return clust ? (e.head.info.rank ?? 0) - (clust.info.leader?.info.rank ?? 0) : 0;
+function clusterAttr(sg, key) {
+  for (let g = sg; g !== null; g = g.parent) {
+    const v = g.attrs.get(key);
+    if (v !== void 0) return v;
+  }
+  return void 0;
 }
-function interclust1Lengths(e) {
-  const offset = (e.info.minlen ?? 1) + interclust1TRank(e) - interclust1HRank(e);
-  return offset > 0 ? [0, offset] : [-offset, 0];
+function clusterStyle(sg) {
+  return clusterAttr(sg, "style");
 }
-function interclust1(g, t, h, e) {
-  const [tLen, hLen] = interclust1Lengths(e);
-  const v = virtualNode(g);
-  v.info.node_type = SLACKNODE;
-  const t0 = ufFind(t);
-  const h0 = ufFind(h);
-  const w = e.info.weight ?? 1;
-  const rt = makeAuxEdge(v, t0, tLen, CL_BACK * w);
-  const rh = makeAuxEdge(v, h0, hLen, w);
-  rt.info.to_orig = e;
-  rh.info.to_orig = e;
+function clusterPeripheries(sg) {
+  const raw = clusterAttr(sg, "peripheries");
+  if (raw === void 0 || raw.length === 0) return 1;
+  const v = parseInt(raw, 10);
+  if (Number.isNaN(v)) return 1;
+  return v < 0 ? 0 : v;
 }
-function class1Edge(g, e) {
-  if (e.info.to_virt !== void 0) return;
-  if (nonconstraintEdge(e)) return;
-  const t = ufFind(e.tail);
-  const h = ufFind(e.head);
-  if (t === h) return;
-  if (t.info.clust || h.info.clust) {
-    interclust1(g, e.tail, e.head, e);
-    return;
-  }
-  const rep = findFastEdge(t, h);
-  if (rep !== void 0) mergeOneway(e, rep);
-  else virtualEdge(t, h, e);
+function applyClusterPenState(obj, sg) {
+  const flags = parseStyleFlags(clusterStyle(sg));
+  const pen = clusterAttr(sg, "pencolor") ?? clusterAttr(sg, "color");
+  obj.penColor = clusterPeripheries(sg) === 0 ? resolveRenderColor("transparent") : resolveRenderColor(resolvePenColor(pen));
+  obj.penWidth = resolvePenWidth(flags, clusterAttr(sg, "penwidth"));
+  obj.pen = resolvePenType(flags);
 }
-function class1(g) {
-  markClusters(g);
-  for (const n of nodesInSeq(g)) {
-    for (const e of n.outEdges(g)) class1Edge(g, e);
-  }
+function clusterAttrsOf(sg) {
+  return {
+    style: clusterStyle(sg),
+    color: clusterAttr(sg, "color"),
+    pencolor: clusterAttr(sg, "pencolor"),
+    fillcolor: clusterAttr(sg, "fillcolor"),
+    bgcolor: clusterAttr(sg, "bgcolor"),
+    penwidth: clusterAttr(sg, "penwidth"),
+    gradientangle: clusterAttr(sg, "gradientangle")
+  };
 }
-function labelVnodeDimen(orig) {
-  const lbl = orig.info.label;
-  return lbl?.dimen;
+function applyClusterObjState(sg, job) {
+  const fillRes = resolveClusterFillEx(clusterAttrsOf(sg));
+  if (job.obj === null) return false;
+  const obj = job.obj;
+  return withColorScheme(clusterAttr(sg, "colorscheme"), () => {
+    applyClusterPenState(obj, sg);
+    if (fillRes.kind === "none") {
+      obj.fill = 0 /* None */;
+      return false;
+    }
+    if (fillRes.kind === "solid") {
+      obj.fill = 1 /* Solid */;
+      obj.fillColor = resolveRenderColor(fillRes.color);
+      return true;
+    }
+    applyClusterGradient(obj, fillRes);
+    return true;
+  });
 }
-function labelVnode(g, orig) {
-  const dimen = labelVnodeDimen(orig);
-  const v = virtualNode(g);
-  v.info.label = orig.info.label;
-  v.info.lw = dotRoot(g).info.nodesep ?? 0;
-  if (!orig.info.label_ontop && dimen) {
-    const flip = dotRoot(g).info.flip === true;
-    v.info.ht = flip ? dimen.x : dimen.y;
-    v.info.rw = flip ? dimen.y : dimen.x;
-  }
-  return v;
+
+// src/render/svg-id.ts
+function svgClass(kind, classAttr) {
+  return classAttr !== void 0 && classAttr.length > 0 ? 'class="' + kind + " " + escapeXmlTitle(classAttr) + '"' : 'class="' + kind + '"';
 }
-function incrWidth(g, v) {
-  const width = Math.floor((g.info.nodesep ?? 0) / 2);
-  v.info.lw = (v.info.lw ?? 0) + width;
-  v.info.rw = (v.info.rw ?? 0) + width;
+function svgNodeId(n, job) {
+  return job.objId(n.attrs.get("id"), "node" + (n.id + 1));
 }
-function plainVnode(g) {
-  const v = virtualNode(g);
-  incrWidth(g, v);
-  return v;
+function svgEdgeId(e, job) {
+  return job.objId(e.attrs.get("id"), "edge" + e.graphSeq);
 }
-function leaderOf(v) {
-  if (v.info.ranktype !== CLUSTER) return ufFind(v);
-  return v.info.clust.info.rankleader[v.info.rank ?? 0];
+function svgClusterId(sg, job) {
+  return job.objId(sg.attrs.get("id"), "clust" + sg.seq);
 }
-function chainVnode(g, orig, r, labelRank) {
-  if (r === labelRank) return labelVnode(g, orig);
-  return plainVnode(g);
+function svgGraphId(g, job) {
+  return job.objId(g.attrs.get("id"), "graph0", true);
 }
-function makeChain(g, from, to, orig) {
-  const labelRank = orig.info.label !== void 0 ? Math.floor(((from.info.rank ?? 0) + (to.info.rank ?? 0)) / 2) : -1;
-  let u = from;
-  const toRank = to.info.rank ?? 0;
-  for (let r = (from.info.rank ?? 0) + 1; r <= toRank; r++) {
-    const v = r < toRank ? (() => {
-      const n = chainVnode(g, orig, r, labelRank);
-      n.info.rank = r;
-      return n;
-    })() : to;
-    const e = virtualEdge(u, v, orig);
-    applyVirtualWeight(e);
-    u = v;
-  }
+function svgNodeClass(n) {
+  return svgClass("node", nodeAttr(n, n.root, "class"));
 }
-function nodeRank3(n) {
-  return n.info.rank ?? 0;
+function svgEdgeClass(e) {
+  return svgClass("edge", e.attrs.get("class"));
 }
-function edgeCount(e) {
-  return e.info.count ?? 1;
+function svgClusterClass(sg) {
+  return svgClass("cluster", clusterAttr(sg, "class"));
 }
-function edgeXpenalty(e) {
-  return e.info.xpenalty ?? 0;
+function svgGraphClass(g) {
+  return svgClass("graph", g.attrs.get("class"));
 }
-function edgeWeight3(e) {
-  return e.info.weight ?? 1;
+
+// src/common/poly-gencode.ts
+function isMulticolor(fillcolor) {
+  return fillcolor.includes(":");
 }
-function nextVirtEdge(e) {
-  return e.head.info.out?.list[0];
+function renderEllipse(ring, coord, renderer, job, filled) {
+  const rx = Math.abs((ring[1].x - ring[0].x) / 2);
+  const ry = Math.abs((ring[1].y - ring[0].y) / 2);
+  const center = transformPoint(coord, job);
+  renderer.ellipse(center, rx, ry, filled, job);
 }
-function mergeChainStep(rep, e, updateCount) {
-  if (updateCount) rep.info.count = edgeCount(rep) + edgeCount(e);
-  rep.info.xpenalty = edgeXpenalty(rep) + edgeXpenalty(e);
-  rep.info.weight = edgeWeight3(rep) + edgeWeight3(e);
-  return nextVirtEdge(rep);
+function renderPolygon(ring, coord, renderer, job, filled) {
+  const pts = ring.map((v) => transformPoint({ x: v.x + coord.x, y: v.y + coord.y }, job));
+  renderer.polygon(pts, filled, job);
 }
-function mergeChain(g, e, f, updateCount) {
-  const lastrank = Math.max(e.tail.info.rank ?? 0, e.head.info.rank ?? 0);
-  e.info.to_virt = f;
-  let rep = f;
-  while (rep !== void 0) {
-    if ((rep.head.info.rank ?? 0) === lastrank) {
-      mergeChainStep(rep, e, updateCount);
-      break;
-    }
-    incrWidth(g, rep.head);
-    rep = mergeChainStep(rep, e, updateCount);
+function renderEllipseRing(ring, coord, filled, j, ctx) {
+  if (ctx.style.wedged && j === 0 && isMulticolor(ctx.fillcolor)) {
+    const pf = ring.map(
+      (v) => transformPoint({ x: v.x + coord.x, y: v.y + coord.y }, ctx.job)
+    );
+    wedgedEllipse(ctx.job, pf, ctx.fillcolor, ctx.renderer);
+    renderEllipse(ring, coord, ctx.renderer, ctx.job, false);
+  } else {
+    renderEllipse(ring, coord, ctx.renderer, ctx.job, filled);
   }
+  if (ctx.diagonals) mcircleHack(ring, coord, ctx);
 }
-function mergeable(e, f) {
-  if (!e || !f) return false;
-  return e.tail === f.tail && e.head === f.head && e.info.label === f.info.label && portsEq(e, f);
+function renderStripedRing(ring, coord, ctx) {
+  const af = ring.map((v) => transformPoint({ x: v.x + coord.x, y: v.y + coord.y }, ctx.job));
+  stripedBox(ctx.job, af, ctx.fillcolor, true, ctx.renderer);
+  renderPolygon(ring, coord, ctx.renderer, ctx.job, false);
 }
-function interclrepChain(g, e, t, h) {
-  makeChain(g, t, h, e);
-  let cur = e.info.to_virt;
-  while (cur !== void 0 && nodeRank3(cur.head) <= nodeRank3(h)) {
-    cur.info.edge_type = CLUSTER_EDGE;
-    cur = cur.head.info.out?.list[0];
-  }
+function renderPolyRing(ring, coord, filled, j, ctx) {
+  if (ctx.style.striped && j === 0) renderStripedRing(ring, coord, ctx);
+  else if (ctx.underline) underlineDraw(ring, coord, filled, ctx);
+  else if (ctx.shape !== 0 && ctx.shape !== STAR || ctx.diagonals || ctx.rounded) {
+    drawRoundCorners(ring, coord, filled, ctx);
+  } else renderPolygon(ring, coord, ctx.renderer, ctx.job, filled);
 }
-function interclrep(g, e) {
-  let t = leaderOf(e.tail);
-  let h = leaderOf(e.head);
-  if (nodeRank3(t) > nodeRank3(h)) {
-    const tmp = t;
-    t = h;
-    h = tmp;
-  }
-  if (t.info.clust === h.info.clust) return;
-  const ve = findFastEdge(t, h);
-  if (ve !== void 0) {
-    mergeChain(g, e, ve, true);
-    return;
+function renderPeripheries(poly, coord, filled, ctx) {
+  const sides = poly.sides <= 2 ? 2 : poly.sides;
+  const verts = poly.vertices;
+  for (let j = 0; j < poly.peripheries; j++) {
+    const ring = verts.slice(j * sides, (j + 1) * sides);
+    if (ring.length < sides) break;
+    const ringFilled = j === 0 ? filled : false;
+    if (poly.sides <= 2) {
+      renderEllipseRing(ring, coord, ringFilled, j, ctx);
+    } else {
+      renderPolyRing(ring, coord, ringFilled, j, ctx);
+    }
   }
-  if (nodeRank3(t) === nodeRank3(h)) return;
-  interclrepChain(g, e, t, h);
 }
-function isClusterEdge(e) {
-  return e.tail.info.ranktype === CLUSTER || e.head.info.ranktype === CLUSTER;
+function renderLabel(label, coord, renderer, job) {
+  if (label.u.kind !== "txt" || label.u.nspans < 1) return;
+  label.pos = coord;
+  label.set = true;
+  const VALIGN_TOP2 = "t".charCodeAt(0);
+  const VALIGN_BOTTOM2 = "b".charCodeAt(0);
+  let py = label.valign === VALIGN_TOP2 ? coord.y + label.space.y / 2 - label.fontsize : label.valign === VALIGN_BOTTOM2 ? coord.y - label.space.y / 2 + label.dimen.y - label.fontsize : coord.y + label.dimen.y / 2 - label.fontsize;
+  for (let i = 0; i < label.u.nspans; i++) {
+    const span = label.u.span[i];
+    const px = span.just === "l" ? coord.x - label.space.x / 2 : span.just === "r" ? coord.x + label.space.x / 2 : coord.x;
+    gvrenderTextspan(renderer, { x: px, y: py }, span, job);
+    py -= span.size.y;
+  }
 }
-function handleClusterMergeable(g, e, prev) {
-  if (prev.info.to_virt !== void 0) {
-    mergeChain(g, e, prev.info.to_virt, false);
-    otherEdge(e);
-  } else if ((e.tail.info.rank ?? 0) === (e.head.info.rank ?? 0)) {
-    mergeOneway(e, prev);
-    otherEdge(e);
+function renderNodeLabel(n, coord, renderer, job) {
+  const label = n.info.label;
+  if (label === void 0) return;
+  if (label.html && label.u.kind === "html") {
+    label.pos = coord;
+    label.set = true;
+    const html = label.u.html;
+    withLabelEmitState(job, () => emitHtmlLabel(html, coord, renderer, job));
+  } else {
+    renderLabel(label, coord, renderer, job);
   }
-  return prev;
 }
-function handleClusterEdge(g, e, prev) {
-  if (mergeable(prev, e)) return handleClusterMergeable(g, e, prev);
-  interclrep(g, e);
-  return e;
+function anchorAttr2(n, key) {
+  const v = nodeAttr(n, n.root, key);
+  return v !== void 0 && v !== "" ? v : void 0;
 }
-function concentrateOrMerge(g, e, prev) {
-  if (dotRoot(g).info.concentrate ?? false) {
-    e.info.edge_type = IGNORED;
-  } else if (prev.info.to_virt !== void 0) {
-    mergeChain(g, e, prev.info.to_virt, true);
-    otherEdge(e);
-  }
+function resolveTooltip(n, tooltip) {
+  if (tooltip !== void 0) return substObjAnchor(interpretCRNL(tooltip), n);
+  const label = n.info.label;
+  return label?.text ?? "";
 }
-function handleMultiSameRank(e, prev) {
-  if ((e.tail.info.rank ?? 0) !== (e.head.info.rank ?? 0)) return false;
-  mergeOneway(e, prev);
-  otherEdge(e);
+function beginNodeAnchor(n, renderer, job) {
+  const url = anchorAttr2(n, "href") ?? anchorAttr2(n, "URL");
+  const tooltip = anchorAttr2(n, "tooltip");
+  if (url === void 0 && tooltip === void 0) return false;
+  renderer.beginAnchor?.(
+    url !== void 0 ? substObjAnchor(url, n) : "",
+    resolveTooltip(n, tooltip),
+    anchorAttr2(n, "target") ?? "",
+    svgNodeId(n, job),
+    job
+  );
   return true;
 }
-function handleMultiParallel(g, e, prev) {
-  if (e.info.label !== void 0 || prev.info.label !== void 0) return false;
-  if (!portsEq(e, prev)) return false;
-  concentrateOrMerge(g, e, prev);
-  return true;
+function applyGradientFields(obj, fill) {
+  obj.fill = fill.kind === "radial" ? 3 /* Radial */ : 2 /* Linear */;
+  obj.fillColor = resolveRenderColor(fill.fillColor);
+  obj.stopColor = resolveRenderColor(fill.stopColor);
+  obj.gradientFrac = fill.frac;
+  obj.gradientAngle = fill.angle;
 }
-function handleMultiEdge(g, e, prev) {
-  if (!prev || e.tail !== prev.tail || e.head !== prev.head) return false;
-  if (handleMultiSameRank(e, prev)) return true;
-  return handleMultiParallel(g, e, prev);
+function isPointNode(n) {
+  return n.info.shape?.kind === 3 /* SH_POINT */;
 }
-function oppEdgeConcOrMerge(g, e, opp) {
-  if (e.info.label !== void 0 || opp.info.label !== void 0) return false;
-  if (!portsEq(e, opp)) return false;
-  if (dotRoot(g).info.concentrate ?? false) {
-    e.info.edge_type = IGNORED;
-    opp.info.conc_opp_flag = true;
-  } else {
-    otherEdge(e);
-    mergeChain(g, e, opp.info.to_virt, true);
+function findFillDflt(n) {
+  const fillcolor = nodeAttr(n, n.root, "fillcolor");
+  if (fillcolor !== void 0 && fillcolor !== "") return fillcolor;
+  const color = nodeAttr(n, n.root, "color");
+  if (color !== void 0 && color !== "") return color;
+  return "black";
+}
+function applyFillState(obj, n, job) {
+  obj.id = svgNodeId(n, job);
+  if (isPointNode(n)) {
+    obj.fill = 1 /* Solid */;
+    obj.fillColor = resolveRenderColor(findFillDflt(n));
+    return true;
   }
+  const fillRes = resolveNodeFillEx({
+    style: nodeAttr(n, n.root, "style"),
+    fillcolor: nodeAttr(n, n.root, "fillcolor"),
+    color: nodeAttr(n, n.root, "color"),
+    gradientangle: nodeAttr(n, n.root, "gradientangle")
+  });
+  if (fillRes.kind === "none") {
+    obj.fill = 0 /* None */;
+    return false;
+  }
+  if (fillRes.kind === "solid") {
+    obj.fill = 1 /* Solid */;
+    obj.fillColor = resolveRenderColor(fillRes.color);
+    return true;
+  }
+  applyGradientFields(obj, fillRes);
   return true;
 }
-function tryOppEdge(g, e, opp) {
-  if (opp.head !== e.tail) return false;
-  if (opp.info.edge_type === IGNORED) return false;
-  if (opp.info.to_virt === void 0) makeChain(g, opp.tail, opp.head, opp);
-  return oppEdgeConcOrMerge(g, e, opp);
+function applyPenState(obj, styleAttr, colorAttr, penwidthAttr) {
+  const flags = parseStyleFlags(styleAttr);
+  obj.penColor = resolveRenderColor(resolvePenColor(colorAttr));
+  obj.pen = resolvePenType(flags);
+  obj.penWidth = resolvePenWidth(flags, penwidthAttr);
+  obj.rawStyle = styleTokens(styleAttr);
 }
-function handleBackEdge(g, e) {
-  for (const opp of e.head.outEdges(g)) {
-    if (tryOppEdge(g, e, opp)) return void 0;
-  }
-  makeChain(g, e.head, e.tail, e);
-  return e;
+function applyNodeStyle(obj, n, job) {
+  const styleAttr = nodeAttr(n, n.root, "style");
+  const colorAttr = nodeAttr(n, n.root, "color");
+  const filled = applyFillState(obj, n, job);
+  applyPenState(obj, styleAttr, colorAttr, nodeAttr(n, n.root, "penwidth"));
+  return filled;
 }
-function class2EdgeSameRep(g, e) {
-  if (nodeRank3(e.tail) === nodeRank3(e.head)) {
-    flatEdge(g, e);
-    return e;
+function prepareDrawPoly(poly, filled, obj) {
+  if (poly.peripheries !== 0 || !filled) return poly;
+  obj.penColor = { type: "string", s: "transparent" };
+  return { ...poly, peripheries: 1 };
+}
+function vertexScale(n, poly) {
+  const info = n.info;
+  if (poly.vertices == null || info.width === void 0 || info.height === void 0) {
+    return poly;
   }
-  if (nodeRank3(e.head) > nodeRank3(e.tail)) {
-    makeChain(g, e.tail, e.head, e);
-    return e;
+  const xsize = (info.lw + info.rw) / (info.width * 72);
+  const ysize = info.ht / (info.height * 72);
+  if (Math.abs(xsize - 1) < 1e-9 && Math.abs(ysize - 1) < 1e-9) return poly;
+  return {
+    ...poly,
+    vertices: poly.vertices.map((v) => ({ x: v.x * xsize, y: v.y * ysize }))
+  };
+}
+function resolveNodeDrawCtx(job, n) {
+  const rawPoly = n.info.shape_info;
+  if (rawPoly === void 0 || rawPoly.vertices === void 0) return null;
+  const poly = vertexScale(n, rawPoly);
+  const coord = n.info.coord ?? { x: 0, y: 0 };
+  const obj = job.obj;
+  const filled = obj !== null && applyNodeStyle(obj, n, job);
+  const drawPoly = obj !== null ? prepareDrawPoly(poly, filled, obj) : poly;
+  const styleFlags = parseStyleFlags(nodeAttr(n, n.root, "style"));
+  const ringCtx = {
+    renderer: job.renderer,
+    job,
+    style: styleFlags,
+    fillcolor: nodeAttr(n, n.root, "fillcolor") ?? "",
+    ...specialCornerFlags(drawPoly.option, styleFlags)
+  };
+  return { poly: drawPoly, coord, filled, ringCtx };
+}
+function specialCornerFlags(opt, style) {
+  return {
+    shape: opt.shape,
+    diagonals: opt.diagonals || style.diagonals,
+    rounded: opt.rounded || style.rounded,
+    underline: opt.underline || style.underline
+  };
+}
+function polyGencode(rawJob, rawNode) {
+  const job = rawJob;
+  const n = rawNode;
+  const renderer = job.renderer;
+  if (!renderer) return;
+  const ctx = resolveNodeDrawCtx(job, n);
+  if (ctx === null) return;
+  const clustersLast = (job.flags & EMIT_CLUSTERS_LAST) !== 0;
+  const savedShape = job.obj?.urlMapShape;
+  const savedPts = job.obj?.urlMapPts;
+  let inAnchor = clustersLast ? false : beginNodeAnchor(n, renderer, job);
+  renderPeripheries(ctx.poly, ctx.coord, ctx.filled, ctx.ringCtx);
+  if (!isPointNode(n)) renderNodeLabel(n, ctx.coord, renderer, job);
+  if (clustersLast) {
+    if (job.obj && savedPts !== void 0 && savedShape !== void 0) {
+      job.obj.urlMapShape = savedShape;
+      job.obj.urlMapPts = savedPts;
+    }
+    inAnchor = beginNodeAnchor(n, renderer, job);
   }
-  return handleBackEdge(g, e);
+  if (inAnchor) renderer.endAnchor?.(job);
 }
-function class2OneEdge(g, e, prev) {
-  if (e.info.to_virt !== void 0) return e;
-  if (isClusterEdge(e)) return handleClusterEdge(g, e, prev);
-  if (handleMultiEdge(g, e, prev)) return prev;
-  if (e.tail === e.head) {
-    otherEdge(e);
-    return e;
+
+// src/common/poly-inside.ts
+function sameSide(p0, p1, L0, L1) {
+  const a = -(L1.y - L0.y);
+  const b = L1.x - L0.x;
+  const c = a * L0.x + b * L0.y;
+  const s0 = a * p0.x + b * p0.y - c >= 0;
+  const s1 = a * p1.x + b * p1.y - c >= 0;
+  return s0 === s1;
+}
+function fixedShapeSize(poly) {
+  let xmax = 0;
+  let ymax = 0;
+  for (const v of poly.vertices ?? []) {
+    xmax = Math.max(xmax, Math.abs(v.x));
+    ymax = Math.max(ymax, Math.abs(v.y));
   }
-  const t = ufFind(e.tail);
-  const h = ufFind(e.head);
-  if (e.tail !== t || e.head !== h) return prev;
-  return class2EdgeSameRep(g, e);
+  return { w: 2 * xmax, h: 2 * ymax };
 }
-function class2ProcessNodeEdges(g, oes) {
-  let prev;
-  for (const e of oes) {
-    const next = class2OneEdge(g, e, prev);
-    prev = next !== void 0 ? next : prev;
+function insideDims(n, xsize, ysize) {
+  const w = 72 * (n.info.width || xsize / 72);
+  const h = 72 * (n.info.height || ysize / 72);
+  return { w, h, ow: 72 * n.info.outline_width || w, oh: 72 * n.info.outline_height || h };
+}
+function insideScale(n, poly) {
+  const flip = n.root.info.flip === true;
+  if (poly.option.fixedshape) {
+    const { w: w2, h: h2 } = fixedShapeSize(poly);
+    const xsize2 = flip ? h2 : w2;
+    const ysize2 = flip ? w2 : h2;
+    return {
+      scalex: xsize2 !== 0 ? w2 / xsize2 : w2,
+      scaley: ysize2 !== 0 ? h2 / ysize2 : h2,
+      boxURx: w2 / 2,
+      boxURy: h2 / 2
+    };
   }
+  const lwrw = n.info.lw + n.info.rw;
+  const xsize = flip ? n.info.ht : lwrw;
+  const ysize = flip ? lwrw : n.info.ht;
+  const { w, h, ow, oh } = insideDims(n, xsize, ysize);
+  return {
+    scalex: xsize !== 0 ? w / xsize : w,
+    scaley: ysize !== 0 ? h / ysize : h,
+    boxURx: ow / 2,
+    boxURy: oh / 2
+  };
 }
-function weightClass(n) {
-  return n.info.weight_class ?? 0;
+function polygonWalk(P, vertex, sides) {
+  const O = { x: 0, y: 0 };
+  let i = 0;
+  let i1 = 1 % sides;
+  const Q = vertex[i];
+  const R2 = vertex[i1];
+  if (!sameSide(P, O, Q, R2)) return false;
+  const s = sameSide(P, Q, R2, O);
+  if (s && sameSide(P, R2, O, Q)) return true;
+  for (let j = 1; j < sides; j++) {
+    if (s) {
+      i = i1;
+      i1 = (i + 1) % sides;
+    } else {
+      i1 = i;
+      i = (i + sides - 1) % sides;
+    }
+    if (!sameSide(P, O, vertex[i], vertex[i1])) return false;
+  }
+  return true;
 }
-function incrWeightClass(n) {
-  if (weightClass(n) <= 2) n.info.weight_class = weightClass(n) + 1;
+function insideShape(n, poly, p) {
+  const sc = insideScale(n, poly);
+  const P = { x: p.x * sc.scalex, y: p.y * sc.scaley };
+  if (Math.abs(P.x) > sc.boxURx || Math.abs(P.y) > sc.boxURy) return false;
+  if (poly.sides <= 2) {
+    return Math.hypot(P.x / sc.boxURx, P.y / sc.boxURy) < 1;
+  }
+  const outerStart = (Math.max(poly.peripheries, 1) - 1) * poly.sides;
+  const outer = poly.vertices.slice(outerStart, outerStart + poly.sides);
+  const ring = polygonOutlineRing(outer, poly.sides, poly.penwidth ?? 1);
+  return polygonWalk(P, ring, poly.sides);
 }
-function class2WeightClasses(g) {
-  for (const e of g.edges) {
-    incrWeightClass(e.head);
-    incrWeightClass(e.tail);
+function polyInside(ctx, p) {
+  const n = ctx.node;
+  if (n === void 0) return false;
+  const rankdir = (n.root.info.rankdir ?? 0) & 3;
+  const P = rankdir === 0 ? p : ccwrotatepf(p, rankdir * 90);
+  if (ctx.bp) {
+    const b = ctx.bp;
+    return P.x >= b.ll.x && P.x <= b.ur.x && P.y >= b.ll.y && P.y <= b.ur.y;
   }
+  const poly = n.info.shape_info;
+  if (poly === void 0 || poly.vertices === null) return false;
+  return insideShape(n, poly, P);
 }
-function class2ProcessNodes(g) {
-  const outIdx = buildOutEdgeIndex(g);
-  for (const n of nodesInSeq(g)) {
-    if (n.info.clust === void 0 && n === ufFind(n)) fastNode(g, n);
-    class2ProcessNodeEdges(g, outIdx.get(n) ?? []);
+function starInside(ctx, p) {
+  const n = ctx.node;
+  if (n === void 0) return false;
+  const rankdir = (n.root.info.rankdir ?? 0) & 3;
+  const P = rankdir === 0 ? p : ccwrotatepf(p, rankdir * 90);
+  if (ctx.bp) {
+    const b = ctx.bp;
+    return P.x >= b.ll.x && P.x <= b.ur.x && P.y >= b.ll.y && P.y <= b.ur.y;
+  }
+  const poly = n.info.shape_info;
+  if (poly === void 0 || poly.vertices === null) return false;
+  const sides = poly.sides;
+  const outerStart = (Math.max(poly.peripheries, 1) - 1) * sides;
+  const outer = poly.vertices.slice(outerStart, outerStart + sides);
+  const ring = polygonOutlineRing(outer, sides, poly.penwidth ?? 1);
+  const O = { x: 0, y: 0 };
+  let outcnt = 0;
+  for (let i = 0; i < sides; i += 2) {
+    const Q = ring[i];
+    const R2 = ring[(i + 4) % sides];
+    if (!sameSide(P, O, Q, R2)) outcnt++;
+    if (outcnt === 2) return false;
   }
+  return true;
 }
-function class2(g) {
-  g.info.nlist = void 0;
-  markClusters(g);
-  const nClust = g.info.n_cluster ?? 0;
-  for (let c = 1; c <= nClust; c++) buildSkeleton(g, g.info.clust[c - 1]);
-  class2WeightClasses(g);
-  class2ProcessNodes(g);
-  if (g !== dotRoot(g)) g.info.comp = [g.info.nlist ?? null];
+function recordInside(ctx, p) {
+  const n = ctx.node;
+  if (n === void 0) return false;
+  const rankdir = (n.root.info.rankdir ?? 0) & 3;
+  const P = rankdir === 0 ? p : ccwrotatepf(p, rankdir * 90);
+  let bb;
+  if (ctx.bp) {
+    bb = ctx.bp;
+  } else {
+    const fld = n.info.shape_info;
+    if (!fld?.b) return false;
+    bb = fld.b;
+  }
+  const pw = 0.5;
+  return P.x >= bb.ll.x - pw && P.x <= bb.ur.x + pw && P.y >= bb.ll.y - pw && P.y <= bb.ur.y + pw;
 }
 
 // src/common/edge-label-init.ts
@@ -23788,10 +23805,12 @@ function parseRatioKind(g) {
 }
 function parseRatioDrawing(g) {
   const kind = parseRatioKind(g);
-  if (kind !== "compress" && kind !== "fill") return;
+  if (kind !== "compress" && kind !== "fill" && kind !== "value") return;
   const sz = parseSizePoints(g.attrs.get("size"));
   g.info.drawing = makeDrawing({
     ratioKind: kind,
+    // C: GD_drawing(g)->ratio = atof(p), set only for R_VALUE (setRatio).
+    ratio: kind === "value" ? Number.parseFloat(g.attrs.get("ratio")) : 0,
     size: sz ? { x: sz.x, y: sz.y } : { x: 0, y: 0 },
     filled: sz?.filled ?? false
   });
@@ -30461,6 +30480,19 @@ function obsPath(conf, p0, poly0, p1, poly1) {
 }
 
 // src/common/splines-routespl.ts
+var routeDump = null;
+function dumpIsVirtual(e) {
+  return (e.info?.edge_type ?? 0) !== 0;
+}
+function dumpEdgeNames(pp) {
+  let e = pp.data;
+  while (e !== null && dumpIsVirtual(e)) e = e.info?.to_orig ?? null;
+  if (e === null) return ["?", "?"];
+  return [e.tail?.name ?? "?", e.head?.name ?? "?"];
+}
+function emitDump(stage, names, mk) {
+  if (routeDump !== null && names !== null) routeDump(stage, names[0], names[1], mk());
+}
 function overlap(i0, i1, j0, j1) {
   if (i1 <= j0 || i0 >= j1) return 0;
   if (i0 <= j0 && i1 >= j1) return i1 - i0;
@@ -30712,8 +30744,21 @@ function runLimitLoop(boxes, boxn, ps, initLlx, initUrx) {
 }
 function routeSplinesInternal(pp, polyline) {
   const boxes = pp.boxes;
+  const dumpNames = routeDump ? dumpEdgeNames(pp) : null;
+  emitDump("S1_INPUT", dumpNames, () => ({
+    nbox: pp.nbox,
+    boxes: pp.boxes.slice(0, pp.nbox).map((b) => ({ ll: { ...b.ll }, ur: { ...b.ur } })),
+    start: { p: { ...pp.start.p }, theta: pp.start.theta, constrained: pp.start.constrained },
+    end: { p: { ...pp.end.p }, theta: pp.end.theta, constrained: pp.end.constrained }
+  }));
   if (checkPath(pp.nbox, boxes, pp)) return null;
   const effectiveBoxn = pp.nbox;
+  emitDump("S2_CHECKED", dumpNames, () => ({
+    nbox: effectiveBoxn,
+    boxes: boxes.slice(0, effectiveBoxn).map((b) => ({ ll: { ...b.ll }, ur: { ...b.ur } })),
+    start: { p: { ...pp.start.p } },
+    end: { p: { ...pp.end.p } }
+  }));
   let flip = false;
   if (effectiveBoxn > 1 && boxes[0].ll.y > boxes[1].ll.y) {
     flip = true;
@@ -30741,6 +30786,11 @@ function routeSplinesInternal(pp, polyline) {
     console.warn("in routesplines, Pshortestpath failed");
     return null;
   }
+  emitDump("S3_POLY", dumpNames, () => ({
+    poly: polypoints.map((p) => ({ ...p })),
+    eps: [{ ...eps[0] }, { ...eps[1] }],
+    pl: pl.map((p) => ({ ...p }))
+  }));
   let ps;
   if (polyline) {
     ps = makePolyline(pl);
@@ -30750,6 +30800,11 @@ function routeSplinesInternal(pp, polyline) {
     ps = routeSpline(edges, pl, evs);
     if (ps.length === 0) return null;
   }
+  emitDump("S4_SPL", dumpNames, () => ({
+    polyline,
+    evs: polyline ? void 0 : buildConstraintVectors(pp).map((v) => ({ ...v })),
+    ps: ps.map((p) => ({ ...p }))
+  }));
   if (isTriviallyBounded(ps)) {
     applyTrivialBounds(boxes, effectiveBoxn, ps);
     return ps;
@@ -32134,31 +32189,13 @@ function splay(root, key, keyOf, compare) {
 }
 
 // src/cdt/bag.ts
-function findByIdentity(start, target, key, keyOf, compare) {
-  let cur = start;
-  let parent = null;
-  while (cur !== null) {
-    if (cur.obj === target) return [cur, parent];
-    if (compare(key, keyOf(cur.obj)) !== 0) return [null, null];
-    parent = cur;
-    cur = cur.left;
-  }
-  return [null, null];
-}
-function unlinkNode(root, cur, parent) {
-  const left = cur.left;
-  const right = cur.right;
-  let replacement;
-  if (left === null) {
-    replacement = right;
-  } else {
-    const maxLeft = splayMax(left);
-    maxLeft.right = right;
-    replacement = maxLeft;
-  }
-  if (parent === null) return replacement;
-  parent.left = replacement;
-  return root;
+function removeRoot(root) {
+  const left = root.left;
+  const right = root.right;
+  if (left === null) return right;
+  const maxLeft = splayMax(left);
+  maxLeft.right = right;
+  return maxLeft;
 }
 var DtBag = class {
   _root = null;
@@ -32197,16 +32234,13 @@ var DtBag = class {
     const key = this._keyOf(obj);
     this._root = splay(this._root, key, this._keyOf, this._compare);
     if (this._compare(key, this._keyOf(this._root.obj)) !== 0) return false;
-    const [cur, parent] = findByIdentity(
-      this._root,
-      obj,
-      key,
-      this._keyOf,
-      this._compare
-    );
-    if (cur === null) return false;
-    const newRoot = unlinkNode(this._root, cur, parent);
-    this._root = newRoot;
+    while (this._root.obj !== obj) {
+      const nxt = this.next(this._root.obj);
+      if (nxt === void 0 || this._compare(key, this._keyOf(nxt)) !== 0) {
+        return false;
+      }
+    }
+    this._root = removeRoot(this._root);
     this._size--;
     return true;
   }
@@ -52489,7 +52523,7 @@ var XdotParser = class _XdotParser {
     let accounted = 0;
     let j = 0;
     while (accounted < len) {
-      if (cur + j >= s.length) break;
+      if (cur + j >= s.length) return null;
       const ch = s[cur + j];
       const prev = j > 0 ? s[cur + j - 1] : "";
       out += ch;