minerva-design 1.3.0 → 1.5.0

package/dist/charts/engine/graph/geometry.js

@@ -0,0 +1,144 @@
+//#region src/engine/graph/geometry.ts
+var e = (e, t, n, r, i, a, o, s, c) => {
+	let l = Math.hypot(r - t, i - n) + Math.hypot(a - r, o - i) + Math.hypot(s - a, c - o), u = Math.max(4, Math.min(28, Math.ceil(l / 10)));
+	for (let l = 1; l <= u; l++) {
+		let d = l / u, f = 1 - d, p = f * f * f, m = 3 * f * f * d, h = 3 * f * d * d, g = d * d * d;
+		e.push(p * t + m * r + h * a + g * s, p * n + m * i + h * o + g * c);
+	}
+}, t = (t, n, r, i, a, o) => {
+	let s = [t, n];
+	return e(s, t, n, t + (r - t) * 2 / 3, n + (i - n) * 2 / 3, a + (r - a) * 2 / 3, o + (i - o) * 2 / 3, a, o), s;
+}, n = (t, n) => {
+	let r = [t[0], t[1]];
+	for (let i = 2; i < t.length; i += 2) {
+		let a = t[i - 2], o = t[i - 1], s = t[i], c = t[i + 1];
+		if (n) {
+			let t = (o + c) / 2;
+			e(r, a, o, a, t, s, t, s, c);
+		} else {
+			let t = (a + s) / 2;
+			e(r, a, o, t, o, t, c, s, c);
+		}
+	}
+	return r;
+}, r = (e, t, n, r, i, a) => {
+	let o = e[e.length - 2], s = e[e.length - 1], c = Math.hypot(t - o, n - s), l = Math.hypot(r - t, i - n), u = Math.min(a, c / 2, l / 2);
+	if (u < .5) {
+		e.push(t, n);
+		return;
+	}
+	let d = t - (t - o) / c * u, f = n - (n - s) / c * u, p = t + (r - t) / l * u, m = n + (i - n) / l * u;
+	e.push(d, f);
+	for (let r = 1; r <= 4; r++) {
+		let i = r / 4, a = 1 - i;
+		e.push(a * a * d + 2 * a * i * t + i * i * p, a * a * f + 2 * a * i * n + i * i * m);
+	}
+}, i = (e, t, n) => {
+	let r = [e[0], e[1]];
+	for (let n = 2; n < e.length; n += 2) {
+		let i = e[n - 2], a = e[n - 1], o = e[n], s = e[n + 1];
+		if (Math.abs(t ? o - i : s - a) > .5) {
+			if (t) {
+				let e = (a + s) / 2;
+				r.push(i, e, o, e);
+			} else {
+				let e = (i + o) / 2;
+				r.push(e, a, e, s);
+			}
+		}
+		r.push(o, s);
+	}
+	return a(r, n);
+}, a = (e, t) => {
+	let n = [e[0], e[1]], i = e.length - 2;
+	for (let a = 2; a < i; a += 2) r(n, e[a], e[a + 1], e[a + 2], e[a + 3], t);
+	return i >= 2 && n.push(e[i], e[i + 1]), n;
+}, o = (e, t, n) => {
+	let r = (e + t) / 2, i = Math.abs(t - e) / 2, a = 2 * Math.max(4, Math.min(32, Math.ceil(i / 12))), o = [], s = e < t ? Math.PI : 0, c = e < t ? 0 : Math.PI;
+	for (let e = 0; e <= a; e++) {
+		let t = s + (c - s) * e / a;
+		o.push(r + i * Math.cos(t), n - i * Math.sin(t));
+	}
+	return o;
+}, s = (e) => {
+	let t = 0;
+	for (let n = 2; n < e.length; n += 2) t += Math.hypot(e[n] - e[n - 2], e[n + 1] - e[n - 1]);
+	return t;
+}, c = (e, t, n) => {
+	let r = s(e);
+	if (r <= t + n + 1e-6) {
+		if (e.length < 4) return e;
+		let i = l(e, (t + n > 0 ? t / (t + n) : .5) * r);
+		return [
+			i[0],
+			i[1],
+			i[0],
+			i[1]
+		];
+	}
+	let i = [], a = l(e, t), o = l(e, r - n);
+	i.push(a[0], a[1]);
+	let c = 0;
+	for (let a = 2; a < e.length; a += 2) c += Math.hypot(e[a] - e[a - 2], e[a + 1] - e[a - 1]), c > t && c < r - n && i.push(e[a], e[a + 1]);
+	return i.push(o[0], o[1]), i;
+}, l = (e, t) => {
+	let n = 0;
+	for (let r = 2; r < e.length; r += 2) {
+		let i = e[r] - e[r - 2], a = e[r + 1] - e[r - 1], o = Math.hypot(i, a);
+		if (n + o >= t && o > 0) {
+			let s = (t - n) / o;
+			return [
+				e[r - 2] + i * s,
+				e[r - 1] + a * s,
+				i / o,
+				a / o
+			];
+		}
+		n += o;
+	}
+	let r = e.length - 2, i = r >= 2 ? e[r] - e[r - 2] : 1, a = r >= 2 ? e[r + 1] - e[r - 1] : 0, o = Math.hypot(i, a) || 1;
+	return [
+		e[r],
+		e[r + 1],
+		i / o,
+		a / o
+	];
+}, u = (e) => {
+	for (let t = e.length - 4; t >= 0; t -= 2) {
+		let n = e[e.length - 2] - e[t], r = e[e.length - 1] - e[t + 1], i = Math.hypot(n, r);
+		if (i > 1e-9) return [n / i, r / i];
+	}
+	return [1, 0];
+}, d = (e, t, n, r, i) => {
+	if (!e) return t / 2;
+	let a = Math.abs(r), o = Math.abs(i), s = a > 1e-9 ? t / 2 / a : Infinity, c = o > 1e-9 ? n / 2 / o : Infinity;
+	return Math.min(s, c);
+}, f = (e, t, n, r, i, a, o) => {
+	let s = a * .42, c = t - r * a, l = n - i * a, u = c - i * s, d = l + r * s, f = c + i * s, p = l - r * s;
+	e.push(u, d, t, n, f, p, u, d, o, o), e.push(t, n, c, l, o, o);
+	let m = (u + c) / 2, h = (d + l) / 2, g = (f + c) / 2, _ = (p + l) / 2;
+	e.push(t, n, m, h, o, o, t, n, g, _, o, o);
+}, p = (e, t, n, r) => {
+	let i = [], a = s(e), o = t + n;
+	if (o <= 0 || a <= 0) return e.slice();
+	for (let n = 0; n < a; n += o) {
+		let o = Math.min(a, n + t), s = l(e, n);
+		i.push(s[0], s[1]);
+		let c = 0;
+		for (let t = 2; t < e.length; t += 2) c += Math.hypot(e[t] - e[t - 2], e[t + 1] - e[t - 1]), c > n && c < o && i.push(e[t], e[t + 1]);
+		let u = l(e, o);
+		i.push(u[0], u[1], r, r);
+	}
+	return i;
+}, m = (e, t, n) => {
+	let r = Infinity;
+	for (let i = 2; i < e.length; i += 2) {
+		let a = e[i - 2], o = e[i - 1], s = e[i] - a, c = e[i + 1] - o, l = s * s + c * c, u = l > 0 ? Math.max(0, Math.min(1, ((t - a) * s + (n - o) * c) / l)) : 0, d = a + s * u - t, f = o + c * u - n;
+		r = Math.min(r, d * d + f * f);
+	}
+	return r;
+};
+//#endregion
+export { o as arcPath, f as arrowHead, d as boundaryDistance, e as cubicPoints, p as dashPath, m as distanceToPath, u as endDirection, i as orthogonalPath, s as pathLength, l as pointAt, t as quadraticPath, a as roundCorners, n as splinePath, c as trimPath };
+
+//# sourceMappingURL=geometry.js.map

package/dist/charts/engine/graph/geometry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"geometry.js","names":["cubicPoints","length","x1","x0","y1","y0","x2","y2","x3","y3","segments","i","t","u","a","b","c","d","quadraticPath","out","cx","cy","splinePath","points","vertical","my","mx","corner","px","py","inLen","outLen","nx","ny","r","radius","ax","ay","bx","by","orthogonalPath","corners","roundCorners","last","arcPath","from","to","y","pathLength","trimPath","total","start","end","p","pointAt","startPoint","endPoint","walked","dx","dy","l","distance","k","endDirection","boundaryDistance","box","width","ux","uy","tx","ty","height","arrowHead","w","lx","ly","rx","ry","gap","dashPath","period","dash","space","distanceToPath","best","qx","qy"],"sources":["../../../../../charts/src/engine/graph/geometry.ts"],"sourcesContent":["// Edge geometry in layout units: curves sampled into polylines, trimming at\n// the node boundaries, arrowheads and dashes. Polylines are flat\n// `[x0, y0, x1, y1, …]` arrays.\n\n/** Points of a cubic Bézier (the start point excluded) */\nexport const cubicPoints = (\n  out: number[],\n  x0: number,\n  y0: number,\n  x1: number,\n  y1: number,\n  x2: number,\n  y2: number,\n  x3: number,\n  y3: number,\n): void => {\n  const length =\n    Math.hypot(x1 - x0, y1 - y0) +\n    Math.hypot(x2 - x1, y2 - y1) +\n    Math.hypot(x3 - x2, y3 - y2);\n  const segments = Math.max(4, Math.min(28, Math.ceil(length / 10)));\n  for (let i = 1; i <= segments; i++) {\n    const t = i / segments;\n    const u = 1 - t;\n    const a = u * u * u;\n    const b = 3 * u * u * t;\n    const c = 3 * u * t * t;\n    const d = t * t * t;\n    out.push(\n      a * x0 + b * x1 + c * x2 + d * x3,\n      a * y0 + b * y1 + c * y2 + d * y3,\n    );\n  }\n};\n\n/** Points of a quadratic Bézier (the start point included) */\nexport const quadraticPath = (\n  x0: number,\n  y0: number,\n  cx: number,\n  cy: number,\n  x1: number,\n  y1: number,\n): number[] => {\n  const out = [x0, y0];\n  cubicPoints(\n    out,\n    x0,\n    y0,\n    x0 + ((cx - x0) * 2) / 3,\n    y0 + ((cy - y0) * 2) / 3,\n    x1 + ((cx - x1) * 2) / 3,\n    y1 + ((cy - y1) * 2) / 3,\n    x1,\n    y1,\n  );\n  return out;\n};\n\n/**\n * Smooth path through waypoints whose tangents follow the flow axis\n * (vertical for top → bottom layouts): C1 at every waypoint\n */\nexport const splinePath = (\n  points: readonly number[],\n  vertical: boolean,\n): number[] => {\n  const out = [points[0], points[1]];\n  for (let i = 2; i < points.length; i += 2) {\n    const x0 = points[i - 2];\n    const y0 = points[i - 1];\n    const x1 = points[i];\n    const y1 = points[i + 1];\n    if (vertical) {\n      const my = (y0 + y1) / 2;\n      cubicPoints(out, x0, y0, x0, my, x1, my, x1, y1);\n    } else {\n      const mx = (x0 + x1) / 2;\n      cubicPoints(out, x0, y0, mx, y0, mx, y1, x1, y1);\n    }\n  }\n  return out;\n};\n\n/** Rounded corner from the end of `out` through (cx, cy) towards (nx, ny) */\nconst corner = (\n  out: number[],\n  cx: number,\n  cy: number,\n  nx: number,\n  ny: number,\n  radius: number,\n) => {\n  const px = out[out.length - 2];\n  const py = out[out.length - 1];\n  const inLen = Math.hypot(cx - px, cy - py);\n  const outLen = Math.hypot(nx - cx, ny - cy);\n  const r = Math.min(radius, inLen / 2, outLen / 2);\n  if (r < 0.5) {\n    out.push(cx, cy);\n    return;\n  }\n  const ax = cx - ((cx - px) / inLen) * r;\n  const ay = cy - ((cy - py) / inLen) * r;\n  const bx = cx + ((nx - cx) / outLen) * r;\n  const by = cy + ((ny - cy) / outLen) * r;\n  out.push(ax, ay);\n  // quadratic arc around the corner\n  for (let i = 1; i <= 4; i++) {\n    const t = i / 4;\n    const u = 1 - t;\n    out.push(\n      u * u * ax + 2 * u * t * cx + t * t * bx,\n      u * u * ay + 2 * u * t * cy + t * t * by,\n    );\n  }\n};\n\n/**\n * Orthogonal path through waypoints: along the flow axis to the middle,\n * across, then along the axis again, with rounded corners\n */\nexport const orthogonalPath = (\n  points: readonly number[],\n  vertical: boolean,\n  radius: number,\n): number[] => {\n  const corners: number[] = [points[0], points[1]];\n  for (let i = 2; i < points.length; i += 2) {\n    const x0 = points[i - 2];\n    const y0 = points[i - 1];\n    const x1 = points[i];\n    const y1 = points[i + 1];\n    if (Math.abs(vertical ? x1 - x0 : y1 - y0) > 0.5) {\n      if (vertical) {\n        const my = (y0 + y1) / 2;\n        corners.push(x0, my, x1, my);\n      } else {\n        const mx = (x0 + x1) / 2;\n        corners.push(mx, y0, mx, y1);\n      }\n    }\n    corners.push(x1, y1);\n  }\n  return roundCorners(corners, radius);\n};\n\n/** Polyline with rounded corners */\nexport const roundCorners = (\n  corners: readonly number[],\n  radius: number,\n): number[] => {\n  const out = [corners[0], corners[1]];\n  const last = corners.length - 2;\n  for (let i = 2; i < last; i += 2) {\n    corner(\n      out,\n      corners[i],\n      corners[i + 1],\n      corners[i + 2],\n      corners[i + 3],\n      radius,\n    );\n  }\n  if (last >= 2) out.push(corners[last], corners[last + 1]);\n  return out;\n};\n\n/** Upper half circle between two points of the x axis (arc diagrams) */\nexport const arcPath = (ax: number, bx: number, y: number): number[] => {\n  const cx = (ax + bx) / 2;\n  const r = Math.abs(bx - ax) / 2;\n  const segments = 2 * Math.max(4, Math.min(32, Math.ceil(r / 12)));\n  const out: number[] = [];\n  const from = ax < bx ? Math.PI : 0;\n  const to = ax < bx ? 0 : Math.PI;\n  for (let i = 0; i <= segments; i++) {\n    const a = from + ((to - from) * i) / segments;\n    out.push(cx + r * Math.cos(a), y - r * Math.sin(a));\n  }\n  return out;\n};\n\n/** Length of a polyline */\nexport const pathLength = (points: readonly number[]): number => {\n  let length = 0;\n  for (let i = 2; i < points.length; i += 2)\n    length += Math.hypot(\n      points[i] - points[i - 2],\n      points[i + 1] - points[i - 1],\n    );\n  return length;\n};\n\n/** Removes `start` / `end` units from the ends of a polyline */\nexport const trimPath = (\n  points: number[],\n  start: number,\n  end: number,\n): number[] => {\n  const total = pathLength(points);\n  if (total <= start + end + 1e-6) {\n    // too short: a zero-length segment in the middle keeps the direction\n    if (points.length < 4) return points;\n    const t = start + end > 0 ? start / (start + end) : 0.5;\n    const p = pointAt(points, t * total);\n    return [p[0], p[1], p[0], p[1]];\n  }\n  const out: number[] = [];\n  const startPoint = pointAt(points, start);\n  const endPoint = pointAt(points, total - end);\n  out.push(startPoint[0], startPoint[1]);\n  let walked = 0;\n  for (let i = 2; i < points.length; i += 2) {\n    walked += Math.hypot(\n      points[i] - points[i - 2],\n      points[i + 1] - points[i - 1],\n    );\n    if (walked > start && walked < total - end)\n      out.push(points[i], points[i + 1]);\n  }\n  out.push(endPoint[0], endPoint[1]);\n  return out;\n};\n\n/** Point and direction at a distance along a polyline */\nexport const pointAt = (\n  points: readonly number[],\n  distance: number,\n): [number, number, number, number] => {\n  let walked = 0;\n  for (let i = 2; i < points.length; i += 2) {\n    const dx = points[i] - points[i - 2];\n    const dy = points[i + 1] - points[i - 1];\n    const l = Math.hypot(dx, dy);\n    if (walked + l >= distance && l > 0) {\n      const t = (distance - walked) / l;\n      return [points[i - 2] + dx * t, points[i - 1] + dy * t, dx / l, dy / l];\n    }\n    walked += l;\n  }\n  const k = points.length - 2;\n  const dx = k >= 2 ? points[k] - points[k - 2] : 1;\n  const dy = k >= 2 ? points[k + 1] - points[k - 1] : 0;\n  const l = Math.hypot(dx, dy) || 1;\n  return [points[k], points[k + 1], dx / l, dy / l];\n};\n\n/** Direction at the end of a polyline (unit vector) */\nexport const endDirection = (points: readonly number[]): [number, number] => {\n  for (let i = points.length - 4; i >= 0; i -= 2) {\n    const dx = points[points.length - 2] - points[i];\n    const dy = points[points.length - 1] - points[i + 1];\n    const l = Math.hypot(dx, dy);\n    if (l > 1e-9) return [dx / l, dy / l];\n  }\n  return [1, 0];\n};\n\n/** Distance from the center of a node to its boundary in direction (ux, uy) */\nexport const boundaryDistance = (\n  box: boolean,\n  width: number,\n  height: number,\n  ux: number,\n  uy: number,\n): number => {\n  if (!box) return width / 2;\n  const ax = Math.abs(ux);\n  const ay = Math.abs(uy);\n  const tx = ax > 1e-9 ? width / 2 / ax : Infinity;\n  const ty = ay > 1e-9 ? height / 2 / ay : Infinity;\n  return Math.min(tx, ty);\n};\n\n/**\n * Arrowhead at (tx, ty) pointing along (ux, uy): the outline of a narrow\n * triangle and its axis, drawn with the line width it looks solid\n */\nexport const arrowHead = (\n  out: number[],\n  tx: number,\n  ty: number,\n  ux: number,\n  uy: number,\n  length: number,\n  gap: number,\n): void => {\n  const w = length * 0.42;\n  const bx = tx - ux * length;\n  const by = ty - uy * length;\n  const lx = bx - uy * w;\n  const ly = by + ux * w;\n  const rx = bx + uy * w;\n  const ry = by - ux * w;\n  out.push(lx, ly, tx, ty, rx, ry, lx, ly, gap, gap);\n  out.push(tx, ty, bx, by, gap, gap);\n  const mx = (lx + bx) / 2;\n  const my = (ly + by) / 2;\n  const nx = (rx + bx) / 2;\n  const ny = (ry + by) / 2;\n  out.push(tx, ty, mx, my, gap, gap, tx, ty, nx, ny, gap, gap);\n};\n\n/** Splits a polyline into dashes (`dash` / `space` in layout units) */\nexport const dashPath = (\n  points: readonly number[],\n  dash: number,\n  space: number,\n  gap: number,\n): number[] => {\n  const out: number[] = [];\n  const total = pathLength(points);\n  const period = dash + space;\n  if (period <= 0 || total <= 0) return points.slice();\n  for (let start = 0; start < total; start += period) {\n    const end = Math.min(total, start + dash);\n    const a = pointAt(points, start);\n    out.push(a[0], a[1]);\n    let walked = 0;\n    for (let i = 2; i < points.length; i += 2) {\n      walked += Math.hypot(\n        points[i] - points[i - 2],\n        points[i + 1] - points[i - 1],\n      );\n      if (walked > start && walked < end) out.push(points[i], points[i + 1]);\n    }\n    const b = pointAt(points, end);\n    out.push(b[0], b[1], gap, gap);\n  }\n  return out;\n};\n\n/** Squared distance from (px, py) to a polyline */\nexport const distanceToPath = (\n  points: readonly number[],\n  px: number,\n  py: number,\n): number => {\n  let best = Infinity;\n  for (let i = 2; i < points.length; i += 2) {\n    const ax = points[i - 2];\n    const ay = points[i - 1];\n    const dx = points[i] - ax;\n    const dy = points[i + 1] - ay;\n    const l = dx * dx + dy * dy;\n    const t =\n      l > 0\n        ? Math.max(0, Math.min(1, ((px - ax) * dx + (py - ay) * dy) / l))\n        : 0;\n    const qx = ax + dx * t - px;\n    const qy = ay + dy * t - py;\n    best = Math.min(best, qx * qx + qy * qy);\n  }\n  return best;\n};\n"],"mappings":";AAKA,IAAaA,KACX,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,MACS;CACT,IAAMC,IACJ,KAAK,MAAMC,IAAKC,GAAIC,IAAKC,CAAE,IAC3B,KAAK,MAAMC,IAAKJ,GAAIK,IAAKH,CAAE,IAC3B,KAAK,MAAMI,IAAKF,GAAIG,IAAKF,CAAE,GACvBG,IAAW,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,KAAK,KAAKT,IAAS,EAAE,CAAC,CAAC;CACjE,KAAK,IAAIU,IAAI,GAAGA,KAAKD,GAAU,KAAK;EAClC,IAAME,IAAID,IAAID,GACRG,IAAI,IAAID,GACRE,IAAID,IAAIA,IAAIA,GACZE,IAAI,IAAIF,IAAIA,IAAID,GAChBI,IAAI,IAAIH,IAAID,IAAIA,GAChBK,IAAIL,IAAIA,IAAIA;EAClB,EAAI,KACFE,IAAIX,IAAKY,IAAIb,IAAKc,IAAIV,IAAKW,IAAIT,GAC/BM,IAAIT,IAAKU,IAAIX,IAAKY,IAAIT,IAAKU,IAAIR,CACjC;CACF;AACF,GAGaS,KACX,GACA,GACA,GACA,GACA,GACA,MACa;CACb,IAAMC,IAAM,CAAChB,GAAIE,CAAE;CAYnB,OAXAL,EACEmB,GACAhB,GACAE,GACAF,KAAOiB,IAAKjB,KAAM,IAAK,GACvBE,KAAOgB,IAAKhB,KAAM,IAAK,GACvBH,KAAOkB,IAAKlB,KAAM,IAAK,GACvBE,KAAOiB,IAAKjB,KAAM,IAAK,GACvBF,GACAE,CACF,GACOe;AACT,GAMaG,KACX,GACA,MACa;CACb,IAAMH,IAAM,CAACI,EAAO,IAAIA,EAAO,EAAE;CACjC,KAAK,IAAI,IAAI,GAAG,IAAIA,EAAO,QAAQ,KAAK,GAAG;EACzC,IAAMpB,IAAKoB,EAAO,IAAI,IAChBlB,IAAKkB,EAAO,IAAI,IAChBrB,IAAKqB,EAAO,IACZnB,IAAKmB,EAAO,IAAI;EACtB,IAAIC,GAAU;GACZ,IAAMC,KAAMpB,IAAKD,KAAM;GACvB,EAAYe,GAAKhB,GAAIE,GAAIF,GAAIsB,GAAIvB,GAAIuB,GAAIvB,GAAIE,CAAE;EACjD,OAAO;GACL,IAAMsB,KAAMvB,IAAKD,KAAM;GACvB,EAAYiB,GAAKhB,GAAIE,GAAIqB,GAAIrB,GAAIqB,GAAItB,GAAIF,GAAIE,CAAE;EACjD;CACF;CACA,OAAOe;AACT,GAGMQ,KACJ,GACA,GACA,GACA,GACA,GACA,MACG;CACH,IAAMC,IAAKT,EAAIA,EAAI,SAAS,IACtBU,IAAKV,EAAIA,EAAI,SAAS,IACtBW,IAAQ,KAAK,MAAMV,IAAKQ,GAAIP,IAAKQ,CAAE,GACnCE,IAAS,KAAK,MAAMC,IAAKZ,GAAIa,IAAKZ,CAAE,GACpCa,IAAI,KAAK,IAAIC,GAAQL,IAAQ,GAAGC,IAAS,CAAC;CAChD,IAAIG,IAAI,IAAK;EACX,EAAI,KAAKd,GAAIC,CAAE;EACf;CACF;CACA,IAAMe,IAAKhB,KAAOA,IAAKQ,KAAME,IAASI,GAChCG,IAAKhB,KAAOA,IAAKQ,KAAMC,IAASI,GAChCI,IAAKlB,KAAOY,IAAKZ,KAAMW,IAAUG,GACjCK,IAAKlB,KAAOY,IAAKZ,KAAMU,IAAUG;CACvC,EAAI,KAAKE,GAAIC,CAAE;CAEf,KAAK,IAAI1B,IAAI,GAAGA,KAAK,GAAG,KAAK;EAC3B,IAAMC,IAAID,IAAI,GACRE,IAAI,IAAID;EACd,EAAI,KACFC,IAAIA,IAAIuB,IAAK,IAAIvB,IAAID,IAAIQ,IAAKR,IAAIA,IAAI0B,GACtCzB,IAAIA,IAAIwB,IAAK,IAAIxB,IAAID,IAAIS,IAAKT,IAAIA,IAAI2B,CACxC;CACF;AACF,GAMaC,KACX,GACA,GACA,MACa;CACb,IAAMC,IAAoB,CAAClB,EAAO,IAAIA,EAAO,EAAE;CAC/C,KAAK,IAAIZ,IAAI,GAAGA,IAAIY,EAAO,QAAQ,KAAK,GAAG;EACzC,IAAMpB,IAAKoB,EAAOZ,IAAI,IAChBN,IAAKkB,EAAOZ,IAAI,IAChBT,IAAKqB,EAAOZ,IACZP,IAAKmB,EAAOZ,IAAI;EACtB,IAAI,KAAK,IAAIa,IAAWtB,IAAKC,IAAKC,IAAKC,CAAE,IAAI,IAAK;GAChD,IAAImB,GAAU;IACZ,IAAMC,KAAMpB,IAAKD,KAAM;IACvB,EAAQ,KAAKD,GAAIsB,GAAIvB,GAAIuB,CAAE;GAC7B,OAAO;IACL,IAAMC,KAAMvB,IAAKD,KAAM;IACvB,EAAQ,KAAKwB,GAAIrB,GAAIqB,GAAItB,CAAE;GAC7B;EACF;EACA,EAAQ,KAAKF,GAAIE,CAAE;CACrB;CACA,OAAOsC,EAAaD,GAASN,CAAM;AACrC,GAGaO,KACX,GACA,MACa;CACb,IAAMvB,IAAM,CAACsB,EAAQ,IAAIA,EAAQ,EAAE,GAC7BE,IAAOF,EAAQ,SAAS;CAC9B,KAAK,IAAI9B,IAAI,GAAGA,IAAIgC,GAAM,KAAK,GAC7B,EACExB,GACAsB,EAAQ9B,IACR8B,EAAQ9B,IAAI,IACZ8B,EAAQ9B,IAAI,IACZ8B,EAAQ9B,IAAI,IACZwB,CACF;CAGF,OADIQ,KAAQ,KAAGxB,EAAI,KAAKsB,EAAQE,IAAOF,EAAQE,IAAO,EAAE,GACjDxB;AACT,GAGayB,KAAW,GAAY,GAAY,MAAwB;CACtE,IAAMxB,KAAMgB,IAAKE,KAAM,GACjBJ,IAAI,KAAK,IAAII,IAAKF,CAAE,IAAI,GACxB1B,IAAW,IAAI,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,KAAK,KAAKwB,IAAI,EAAE,CAAC,CAAC,GAC1Df,IAAgB,CAAC,GACjB0B,IAAOT,IAAKE,IAAK,KAAK,KAAK,GAC3BQ,IAAKV,IAAKE,IAAK,IAAI,KAAK;CAC9B,KAAK,IAAI3B,IAAI,GAAGA,KAAKD,GAAU,KAAK;EAClC,IAAMI,IAAI+B,KAASC,IAAKD,KAAQlC,IAAKD;EACrC,EAAI,KAAKU,IAAKc,IAAI,KAAK,IAAIpB,CAAC,GAAGiC,IAAIb,IAAI,KAAK,IAAIpB,CAAC,CAAC;CACpD;CACA,OAAOK;AACT,GAGa6B,KAAc,MAAsC;CAC/D,IAAI/C,IAAS;CACb,KAAK,IAAIU,IAAI,GAAGA,IAAIY,EAAO,QAAQ,KAAK,GACtC,KAAU,KAAK,MACbA,EAAOZ,KAAKY,EAAOZ,IAAI,IACvBY,EAAOZ,IAAI,KAAKY,EAAOZ,IAAI,EAC7B;CACF,OAAOV;AACT,GAGagD,KACX,GACA,GACA,MACa;CACb,IAAMC,IAAQF,EAAWzB,CAAM;CAC/B,IAAI2B,KAASC,IAAQC,IAAM,MAAM;EAE/B,IAAI7B,EAAO,SAAS,GAAG,OAAOA;EAE9B,IAAM8B,IAAIC,EAAQ/B,IADR4B,IAAQC,IAAM,IAAID,KAASA,IAAQC,KAAO,MACtBF,CAAK;EACnC,OAAO;GAACG,EAAE;GAAIA,EAAE;GAAIA,EAAE;GAAIA,EAAE;EAAE;CAChC;CACA,IAAMlC,IAAgB,CAAC,GACjBoC,IAAaD,EAAQ/B,GAAQ4B,CAAK,GAClCK,IAAWF,EAAQ/B,GAAQ2B,IAAQE,CAAG;CAC5C,EAAI,KAAKG,EAAW,IAAIA,EAAW,EAAE;CACrC,IAAIE,IAAS;CACb,KAAK,IAAI9C,IAAI,GAAGA,IAAIY,EAAO,QAAQ,KAAK,GAKtC,AAJA,KAAU,KAAK,MACbA,EAAOZ,KAAKY,EAAOZ,IAAI,IACvBY,EAAOZ,IAAI,KAAKY,EAAOZ,IAAI,EAC7B,GACI8C,IAASN,KAASM,IAASP,IAAQE,KACrCjC,EAAI,KAAKI,EAAOZ,IAAIY,EAAOZ,IAAI,EAAE;CAGrC,OADAQ,EAAI,KAAKqC,EAAS,IAAIA,EAAS,EAAE,GAC1BrC;AACT,GAGamC,KACX,GACA,MACqC;CACrC,IAAIG,IAAS;CACb,KAAK,IAAI9C,IAAI,GAAGA,IAAIY,EAAO,QAAQ,KAAK,GAAG;EACzC,IAAMmC,IAAKnC,EAAOZ,KAAKY,EAAOZ,IAAI,IAC5BgD,IAAKpC,EAAOZ,IAAI,KAAKY,EAAOZ,IAAI,IAChCiD,IAAI,KAAK,MAAMF,GAAIC,CAAE;EAC3B,IAAIF,IAASG,KAAKC,KAAYD,IAAI,GAAG;GACnC,IAAMhD,KAAKiD,IAAWJ,KAAUG;GAChC,OAAO;IAACrC,EAAOZ,IAAI,KAAK+C,IAAK9C;IAAGW,EAAOZ,IAAI,KAAKgD,IAAK/C;IAAG8C,IAAKE;IAAGD,IAAKC;GAAC;EACxE;EACA,KAAUA;CACZ;CACA,IAAME,IAAIvC,EAAO,SAAS,GACpBmC,IAAKI,KAAK,IAAIvC,EAAOuC,KAAKvC,EAAOuC,IAAI,KAAK,GAC1CH,IAAKG,KAAK,IAAIvC,EAAOuC,IAAI,KAAKvC,EAAOuC,IAAI,KAAK,GAC9CF,IAAI,KAAK,MAAMF,GAAIC,CAAE,KAAK;CAChC,OAAO;EAACpC,EAAOuC;EAAIvC,EAAOuC,IAAI;EAAIJ,IAAKE;EAAGD,IAAKC;CAAC;AAClD,GAGaG,KAAgB,MAAgD;CAC3E,KAAK,IAAIpD,IAAIY,EAAO,SAAS,GAAGZ,KAAK,GAAG,KAAK,GAAG;EAC9C,IAAM+C,IAAKnC,EAAOA,EAAO,SAAS,KAAKA,EAAOZ,IACxCgD,IAAKpC,EAAOA,EAAO,SAAS,KAAKA,EAAOZ,IAAI,IAC5CiD,IAAI,KAAK,MAAMF,GAAIC,CAAE;EAC3B,IAAIC,IAAI,MAAM,OAAO,CAACF,IAAKE,GAAGD,IAAKC,CAAC;CACtC;CACA,OAAO,CAAC,GAAG,CAAC;AACd,GAGaI,KACX,GACA,GACA,GACA,GACA,MACW;CACX,IAAI,CAACC,GAAK,OAAOC,IAAQ;CACzB,IAAM9B,IAAK,KAAK,IAAI+B,CAAE,GAChB9B,IAAK,KAAK,IAAI+B,CAAE,GAChBC,IAAKjC,IAAK,OAAO8B,IAAQ,IAAI9B,IAAK,UAClCkC,IAAKjC,IAAK,OAAOkC,IAAS,IAAIlC,IAAK;CACzC,OAAO,KAAK,IAAIgC,GAAIC,CAAE;AACxB,GAMaE,KACX,GACA,GACA,GACA,GACA,GACA,GACA,MACS;CACT,IAAMC,IAAIxE,IAAS,KACbqC,IAAK+B,IAAKF,IAAKlE,GACfsC,IAAK+B,IAAKF,IAAKnE,GACfyE,IAAKpC,IAAK8B,IAAKK,GACfE,IAAKpC,IAAK4B,IAAKM,GACfG,IAAKtC,IAAK8B,IAAKK,GACfI,IAAKtC,IAAK4B,IAAKM;CAErB,AADAtD,EAAI,KAAKuD,GAAIC,GAAIN,GAAIC,GAAIM,GAAIC,GAAIH,GAAIC,GAAIG,GAAKA,CAAG,GACjD3D,EAAI,KAAKkD,GAAIC,GAAIhC,GAAIC,GAAIuC,GAAKA,CAAG;CACjC,IAAMpD,KAAMgD,IAAKpC,KAAM,GACjBb,KAAMkD,IAAKpC,KAAM,GACjBP,KAAM4C,IAAKtC,KAAM,GACjBL,KAAM4C,IAAKtC,KAAM;CACvB,EAAI,KAAK8B,GAAIC,GAAI5C,GAAID,GAAIqD,GAAKA,GAAKT,GAAIC,GAAItC,GAAIC,GAAI6C,GAAKA,CAAG;AAC7D,GAGaC,KACX,GACA,GACA,GACA,MACa;CACb,IAAM5D,IAAgB,CAAC,GACjB+B,IAAQF,EAAWzB,CAAM,GACzByD,IAASC,IAAOC;CACtB,IAAIF,KAAU,KAAK9B,KAAS,GAAG,OAAO3B,EAAO,MAAM;CACnD,KAAK,IAAI4B,IAAQ,GAAGA,IAAQD,GAAO,KAAS8B,GAAQ;EAClD,IAAM5B,IAAM,KAAK,IAAIF,GAAOC,IAAQ8B,CAAI,GAClCnE,IAAIwC,EAAQ/B,GAAQ4B,CAAK;EAC/B,EAAI,KAAKrC,EAAE,IAAIA,EAAE,EAAE;EACnB,IAAI2C,IAAS;EACb,KAAK,IAAI9C,IAAI,GAAGA,IAAIY,EAAO,QAAQ,KAAK,GAKtC,AAJA,KAAU,KAAK,MACbA,EAAOZ,KAAKY,EAAOZ,IAAI,IACvBY,EAAOZ,IAAI,KAAKY,EAAOZ,IAAI,EAC7B,GACI8C,IAASN,KAASM,IAASL,KAAKjC,EAAI,KAAKI,EAAOZ,IAAIY,EAAOZ,IAAI,EAAE;EAEvE,IAAMI,IAAIuC,EAAQ/B,GAAQ6B,CAAG;EAC7B,EAAI,KAAKrC,EAAE,IAAIA,EAAE,IAAI+D,GAAKA,CAAG;CAC/B;CACA,OAAO3D;AACT,GAGagE,KACX,GACA,GACA,MACW;CACX,IAAIC,IAAO;CACX,KAAK,IAAI,IAAI,GAAG,IAAI7D,EAAO,QAAQ,KAAK,GAAG;EACzC,IAAMa,IAAKb,EAAO,IAAI,IAChBc,IAAKd,EAAO,IAAI,IAChBmC,IAAKnC,EAAO,KAAKa,GACjBuB,IAAKpC,EAAO,IAAI,KAAKc,GACrB,IAAIqB,IAAKA,IAAKC,IAAKA,GACnB/C,IACJ,IAAI,IACA,KAAK,IAAI,GAAG,KAAK,IAAI,KAAKgB,IAAKQ,KAAMsB,KAAM7B,IAAKQ,KAAMsB,KAAM,CAAC,CAAC,IAC9D,GACA0B,IAAKjD,IAAKsB,IAAK9C,IAAIgB,GACnB0D,IAAKjD,IAAKsB,IAAK/C,IAAIiB;EACzB,IAAO,KAAK,IAAIuD,GAAMC,IAAKA,IAAKC,IAAKA,CAAE;CACzC;CACA,OAAOF;AACT"}

package/dist/charts/engine/graph/index.cjs

@@ -0,0 +1 @@
+const e=require("./force.cjs"),t=require("./circular.cjs"),n=require("./dag.cjs"),r=require("./tree.cjs"),i=require("./chart.cjs");exports.arcLayout=t.arcLayout,exports.circularLayout=t.circularLayout,exports.countCrossings=n.countCrossings,exports.createForceSimulation=e.createForceSimulation,exports.createGraphChart=i.createGraphChart,exports.criticalPath=n.criticalPath,exports.dagLayout=n.dagLayout,exports.forceLayout=e.forceLayout,exports.treeLayout=r.treeLayout;

package/dist/charts/engine/graph/index.d.cts

@@ -0,0 +1,6 @@
+export { createGraphChart } from './chart.cjs';
+export { createForceSimulation, forceLayout } from './force.cjs';
+export { countCrossings, criticalPath, dagLayout } from './dag.cjs';
+export { treeLayout } from './tree.cjs';
+export { arcLayout, circularLayout } from './circular.cjs';
+export type { GraphCircularLayoutOptions, GraphCircularLayoutResult, GraphDagLayoutOptions, GraphDagLayoutResult, GraphForceLayoutOptions, GraphForceSimulation, GraphChartEventMap, GraphChartInstance, GraphChartLabels, GraphChartOptions, GraphCircularOptions, GraphCriticalPath, GraphDagOptions, GraphData, GraphDirection, GraphEdge, GraphEdgeStyle, GraphForceOptions, GraphGroup, GraphGroupToggleEvent, GraphHoverEvent, GraphInteractionOptions, GraphLayoutEndEvent, GraphLayoutResult, GraphLayoutType, GraphLegendOptions, GraphNode, GraphNodeShape, GraphPoint, GraphSelectEvent, GraphToggleEvent, GraphTooltipOptions, GraphTreeOptions, GraphTreeLayoutOptions, GraphTreeLayoutResult, } from './types.cjs';

package/dist/charts/engine/graph/index.d.ts

@@ -0,0 +1,6 @@
+export { createGraphChart } from './chart.js';
+export { createForceSimulation, forceLayout } from './force.js';
+export { countCrossings, criticalPath, dagLayout } from './dag.js';
+export { treeLayout } from './tree.js';
+export { arcLayout, circularLayout } from './circular.js';
+export type { GraphCircularLayoutOptions, GraphCircularLayoutResult, GraphDagLayoutOptions, GraphDagLayoutResult, GraphForceLayoutOptions, GraphForceSimulation, GraphChartEventMap, GraphChartInstance, GraphChartLabels, GraphChartOptions, GraphCircularOptions, GraphCriticalPath, GraphDagOptions, GraphData, GraphDirection, GraphEdge, GraphEdgeStyle, GraphForceOptions, GraphGroup, GraphGroupToggleEvent, GraphHoverEvent, GraphInteractionOptions, GraphLayoutEndEvent, GraphLayoutResult, GraphLayoutType, GraphLegendOptions, GraphNode, GraphNodeShape, GraphPoint, GraphSelectEvent, GraphToggleEvent, GraphTooltipOptions, GraphTreeOptions, GraphTreeLayoutOptions, GraphTreeLayoutResult, } from './types.js';

package/dist/charts/engine/graph/index.js

@@ -0,0 +1,6 @@
+import { createForceSimulation as e, forceLayout as t } from "./force.js";
+import { arcLayout as n, circularLayout as r } from "./circular.js";
+import { countCrossings as i, criticalPath as a, dagLayout as o } from "./dag.js";
+import { treeLayout as s } from "./tree.js";
+import { createGraphChart as c } from "./chart.js";
+export { n as arcLayout, r as circularLayout, i as countCrossings, e as createForceSimulation, c as createGraphChart, a as criticalPath, o as dagLayout, t as forceLayout, s as treeLayout };

package/dist/charts/engine/graph/labels.cjs

@@ -0,0 +1,2 @@
+const e=require("../locale.cjs");var t={en:{chart:`Network graph`,tree:`Tree diagram`,dag:`Dependency graph`,summary:`{nodes} nodes, {edges} links.`,groupsSummary:`Groups: {groups}.`,keyboardHelp:`Use the arrow keys to move between nodes, Enter to select, + and - to zoom, 0 to fit.`,nodeFocus:`{name}, {degree} links`,nodeFocusGroup:`{name} ({group}), {degree} links`,selected:`{count} selected`,selectionCleared:`Selection cleared`,expanded:`{name} expanded`,collapsed:`{name} collapsed, {count} hidden`,shown:`{name}: shown`,hidden:`{name}: hidden`,degree:`Links`,incoming:`Incoming`,outgoing:`Outgoing`,value:`Value`,group:`Group`,hiddenChildren:`Hidden`,critical:`Critical path`,zoomIn:`Zoom in`,zoomOut:`Zoom out`,fit:`Fit to view`,zoomHint:`Use {key} + scroll to zoom`,listSeparator:`, `},zh:{chart:`关系图`,tree:`树图`,dag:`依赖图`,summary:`{nodes} 个节点，{edges} 条关系。`,groupsSummary:`分组：{groups}。`,keyboardHelp:`使用方向键在节点间移动，Enter 选中，+ 和 - 缩放，0 适应视图。`,nodeFocus:`{name}，{degree} 条关系`,nodeFocusGroup:`{name}（{group}），{degree} 条关系`,selected:`已选中 {count} 个`,selectionCleared:`已清除选择`,expanded:`{name} 已展开`,collapsed:`{name} 已折叠，隐藏 {count} 个`,shown:`{name}：已显示`,hidden:`{name}：已隐藏`,degree:`关系数`,incoming:`入边`,outgoing:`出边`,value:`数值`,group:`分组`,hiddenChildren:`已折叠`,critical:`关键路径`,zoomIn:`放大`,zoomOut:`缩小`,fit:`适应视图`,zoomHint:`按住 {key} 并滚动以缩放`,listSeparator:`、`},ja:{chart:`ネットワーク図`,tree:`ツリー図`,dag:`依存関係グラフ`,summary:`ノード {nodes} 個、リンク {edges} 本。`,groupsSummary:`グループ：{groups}。`,keyboardHelp:`矢印キーでノード間を移動、Enter で選択、+ と - でズーム、0 で全体表示。`,nodeFocus:`{name}、リンク {degree} 本`,nodeFocusGroup:`{name}（{group}）、リンク {degree} 本`,selected:`{count} 個を選択`,selectionCleared:`選択を解除しました`,expanded:`{name} を展開しました`,collapsed:`{name} を折りたたみました（{count} 個非表示）`,shown:`{name}：表示`,hidden:`{name}：非表示`,degree:`リンク数`,incoming:`入力`,outgoing:`出力`,value:`値`,group:`グループ`,hiddenChildren:`非表示`,critical:`クリティカルパス`,zoomIn:`拡大`,zoomOut:`縮小`,fit:`全体表示`,zoomHint:`{key} を押しながらスクロールでズーム`,listSeparator:`、`},fr:{chart:`Graphe de relations`,tree:`Arbre`,dag:`Graphe de dépendances`,summary:`{nodes} nœuds, {edges} liens.`,groupsSummary:`Groupes : {groups}.`,keyboardHelp:`Flèches pour passer d’un nœud à l’autre, Entrée pour sélectionner, + et - pour zoomer, 0 pour tout afficher.`,nodeFocus:`{name}, {degree} liens`,nodeFocusGroup:`{name} ({group}), {degree} liens`,selected:`{count} sélectionné(s)`,selectionCleared:`Sélection effacée`,expanded:`{name} déplié`,collapsed:`{name} replié, {count} masqué(s)`,shown:`{name} : affiché`,hidden:`{name} : masqué`,degree:`Liens`,incoming:`Entrants`,outgoing:`Sortants`,value:`Valeur`,group:`Groupe`,hiddenChildren:`Masqués`,critical:`Chemin critique`,zoomIn:`Zoom avant`,zoomOut:`Zoom arrière`,fit:`Tout afficher`,zoomHint:`Utilisez {key} + molette pour zoomer`,listSeparator:`, `}},n=(e,t)=>e.replace(/\{(\w+)\}/g,(e,n)=>n in t?String(t[n]):e),r=(n,r)=>{let i=e.resolveLocale(n);return{locale:i,labels:e.localeLabels(t,i,r),count:t=>e.numberFormat(i).format(t),value:t=>Number.isFinite(t)?e.numberFormat(i,{maximumFractionDigits:2}).format(t):`–`}};exports.GRAPH_LABELS=t,exports.fill=n,exports.graphLocale=r;
+//# sourceMappingURL=labels.cjs.map

package/dist/charts/engine/graph/labels.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"labels.cjs","names":["resolveLocale","localeLabels","numberFormat","require_locale","GRAPH_LABELS","fill","template","key","values","match","graphLocale","resolved","locale","overrides","value"],"sources":["../../../../../charts/src/engine/graph/labels.ts"],"sourcesContent":["// Built-in texts of the graph charts (English, Chinese, Japanese, French)\n// and the number formatting of their tooltips.\n\nimport {\n  localeLabels,\n  numberFormat,\n  resolveLocale,\n  type LabelDictionary,\n} from \"../locale\";\nimport type { GraphChartLabels } from \"./types\";\n\nexport const GRAPH_LABELS: LabelDictionary<GraphChartLabels> = {\n  en: {\n    chart: \"Network graph\",\n    tree: \"Tree diagram\",\n    dag: \"Dependency graph\",\n    summary: \"{nodes} nodes, {edges} links.\",\n    groupsSummary: \"Groups: {groups}.\",\n    keyboardHelp:\n      \"Use the arrow keys to move between nodes, Enter to select, + and - to zoom, 0 to fit.\",\n    nodeFocus: \"{name}, {degree} links\",\n    nodeFocusGroup: \"{name} ({group}), {degree} links\",\n    selected: \"{count} selected\",\n    selectionCleared: \"Selection cleared\",\n    expanded: \"{name} expanded\",\n    collapsed: \"{name} collapsed, {count} hidden\",\n    shown: \"{name}: shown\",\n    hidden: \"{name}: hidden\",\n    degree: \"Links\",\n    incoming: \"Incoming\",\n    outgoing: \"Outgoing\",\n    value: \"Value\",\n    group: \"Group\",\n    hiddenChildren: \"Hidden\",\n    critical: \"Critical path\",\n    zoomIn: \"Zoom in\",\n    zoomOut: \"Zoom out\",\n    fit: \"Fit to view\",\n    zoomHint: \"Use {key} + scroll to zoom\",\n    listSeparator: \", \",\n  },\n  zh: {\n    chart: \"关系图\",\n    tree: \"树图\",\n    dag: \"依赖图\",\n    summary: \"{nodes} 个节点，{edges} 条关系。\",\n    groupsSummary: \"分组：{groups}。\",\n    keyboardHelp:\n      \"使用方向键在节点间移动，Enter 选中，+ 和 - 缩放，0 适应视图。\",\n    nodeFocus: \"{name}，{degree} 条关系\",\n    nodeFocusGroup: \"{name}（{group}），{degree} 条关系\",\n    selected: \"已选中 {count} 个\",\n    selectionCleared: \"已清除选择\",\n    expanded: \"{name} 已展开\",\n    collapsed: \"{name} 已折叠，隐藏 {count} 个\",\n    shown: \"{name}：已显示\",\n    hidden: \"{name}：已隐藏\",\n    degree: \"关系数\",\n    incoming: \"入边\",\n    outgoing: \"出边\",\n    value: \"数值\",\n    group: \"分组\",\n    hiddenChildren: \"已折叠\",\n    critical: \"关键路径\",\n    zoomIn: \"放大\",\n    zoomOut: \"缩小\",\n    fit: \"适应视图\",\n    zoomHint: \"按住 {key} 并滚动以缩放\",\n    listSeparator: \"、\",\n  },\n  ja: {\n    chart: \"ネットワーク図\",\n    tree: \"ツリー図\",\n    dag: \"依存関係グラフ\",\n    summary: \"ノード {nodes} 個、リンク {edges} 本。\",\n    groupsSummary: \"グループ：{groups}。\",\n    keyboardHelp:\n      \"矢印キーでノード間を移動、Enter で選択、+ と - でズーム、0 で全体表示。\",\n    nodeFocus: \"{name}、リンク {degree} 本\",\n    nodeFocusGroup: \"{name}（{group}）、リンク {degree} 本\",\n    selected: \"{count} 個を選択\",\n    selectionCleared: \"選択を解除しました\",\n    expanded: \"{name} を展開しました\",\n    collapsed: \"{name} を折りたたみました（{count} 個非表示）\",\n    shown: \"{name}：表示\",\n    hidden: \"{name}：非表示\",\n    degree: \"リンク数\",\n    incoming: \"入力\",\n    outgoing: \"出力\",\n    value: \"値\",\n    group: \"グループ\",\n    hiddenChildren: \"非表示\",\n    critical: \"クリティカルパス\",\n    zoomIn: \"拡大\",\n    zoomOut: \"縮小\",\n    fit: \"全体表示\",\n    zoomHint: \"{key} を押しながらスクロールでズーム\",\n    listSeparator: \"、\",\n  },\n  fr: {\n    chart: \"Graphe de relations\",\n    tree: \"Arbre\",\n    dag: \"Graphe de dépendances\",\n    summary: \"{nodes} nœuds, {edges} liens.\",\n    groupsSummary: \"Groupes : {groups}.\",\n    keyboardHelp:\n      \"Flèches pour passer d’un nœud à l’autre, Entrée pour sélectionner, + et - pour zoomer, 0 pour tout afficher.\",\n    nodeFocus: \"{name}, {degree} liens\",\n    nodeFocusGroup: \"{name} ({group}), {degree} liens\",\n    selected: \"{count} sélectionné(s)\",\n    selectionCleared: \"Sélection effacée\",\n    expanded: \"{name} déplié\",\n    collapsed: \"{name} replié, {count} masqué(s)\",\n    shown: \"{name} : affiché\",\n    hidden: \"{name} : masqué\",\n    degree: \"Liens\",\n    incoming: \"Entrants\",\n    outgoing: \"Sortants\",\n    value: \"Valeur\",\n    group: \"Groupe\",\n    hiddenChildren: \"Masqués\",\n    critical: \"Chemin critique\",\n    zoomIn: \"Zoom avant\",\n    zoomOut: \"Zoom arrière\",\n    fit: \"Tout afficher\",\n    zoomHint: \"Utilisez {key} + molette pour zoomer\",\n    listSeparator: \", \",\n  },\n};\n\n/** Replaces `{name}` placeholders */\nexport const fill = (\n  template: string,\n  values: Record<string, string | number>,\n): string =>\n  template.replace(/\\{(\\w+)\\}/g, (match, key: string) =>\n    key in values ? String(values[key]) : match,\n  );\n\nexport interface GraphLocale {\n  locale: string;\n  labels: GraphChartLabels;\n  count: (value: number) => string;\n  value: (value: number) => string;\n}\n\nexport const graphLocale = (\n  locale: string | undefined,\n  overrides: Partial<GraphChartLabels> | undefined,\n): GraphLocale => {\n  const resolved = resolveLocale(locale);\n  return {\n    locale: resolved,\n    labels: localeLabels(GRAPH_LABELS, resolved, overrides),\n    count: (value) => numberFormat(resolved).format(value),\n    value: (value) =>\n      Number.isFinite(value)\n        ? numberFormat(resolved, { maximumFractionDigits: 2 }).format(value)\n        : \"–\",\n  };\n};\n"],"mappings":"iCAWA,IAAaI,EAAkD,CAC7D,GAAI,CACF,MAAO,gBACP,KAAM,eACN,IAAK,mBACL,QAAS,gCACT,cAAe,oBACf,aACE,wFACF,UAAW,yBACX,eAAgB,mCAChB,SAAU,mBACV,iBAAkB,oBAClB,SAAU,kBACV,UAAW,mCACX,MAAO,gBACP,OAAQ,iBACR,OAAQ,QACR,SAAU,WACV,SAAU,WACV,MAAO,QACP,MAAO,QACP,eAAgB,SAChB,SAAU,gBACV,OAAQ,UACR,QAAS,WACT,IAAK,cACL,SAAU,6BACV,cAAe,IACjB,EACA,GAAI,CACF,MAAO,MACP,KAAM,KACN,IAAK,MACL,QAAS,2BACT,cAAe,eACf,aACE,wCACF,UAAW,sBACX,eAAgB,+BAChB,SAAU,gBACV,iBAAkB,QAClB,SAAU,aACV,UAAW,0BACX,MAAO,aACP,OAAQ,aACR,OAAQ,MACR,SAAU,KACV,SAAU,KACV,MAAO,KACP,MAAO,KACP,eAAgB,MAChB,SAAU,OACV,OAAQ,KACR,QAAS,KACT,IAAK,OACL,SAAU,kBACV,cAAe,GACjB,EACA,GAAI,CACF,MAAO,UACP,KAAM,OACN,IAAK,UACL,QAAS,+BACT,cAAe,iBACf,aACE,6CACF,UAAW,wBACX,eAAgB,iCAChB,SAAU,eACV,iBAAkB,YAClB,SAAU,iBACV,UAAW,iCACX,MAAO,YACP,OAAQ,aACR,OAAQ,OACR,SAAU,KACV,SAAU,KACV,MAAO,IACP,MAAO,OACP,eAAgB,MAChB,SAAU,WACV,OAAQ,KACR,QAAS,KACT,IAAK,OACL,SAAU,wBACV,cAAe,GACjB,EACA,GAAI,CACF,MAAO,sBACP,KAAM,QACN,IAAK,wBACL,QAAS,gCACT,cAAe,sBACf,aACE,+GACF,UAAW,yBACX,eAAgB,mCAChB,SAAU,yBACV,iBAAkB,oBAClB,SAAU,gBACV,UAAW,mCACX,MAAO,mBACP,OAAQ,kBACR,OAAQ,QACR,SAAU,WACV,SAAU,WACV,MAAO,SACP,MAAO,SACP,eAAgB,UAChB,SAAU,kBACV,OAAQ,aACR,QAAS,eACT,IAAK,gBACL,SAAU,uCACV,cAAe,IACjB,CACF,EAGaC,GACX,EACA,IAEAC,EAAS,QAAQ,cAAe,EAAO,IACrCC,KAAOC,EAAS,OAAOA,EAAOD,EAAI,EAAIE,CACxC,EASWC,GACX,EACA,IACgB,CAChB,IAAMC,EAAWX,EAAAA,cAAcY,CAAM,EACrC,MAAO,CACL,OAAQD,EACR,OAAQV,EAAAA,aAAaG,EAAcO,EAAUE,CAAS,EACtD,MAAQ,GAAUX,EAAAA,aAAaS,CAAQ,CAAC,CAAC,OAAOG,CAAK,EACrD,MAAQ,GACN,OAAO,SAASA,CAAK,EACjBZ,EAAAA,aAAaS,EAAU,CAAE,sBAAuB,CAAE,CAAC,CAAC,CAAC,OAAOG,CAAK,EACjE,GACR,CACF"}

package/dist/charts/engine/graph/labels.d.cts

@@ -0,0 +1,12 @@
+import { LabelDictionary } from '../locale.cjs';
+import { GraphChartLabels } from './types.cjs';
+export declare const GRAPH_LABELS: LabelDictionary<GraphChartLabels>;
+/** Replaces `{name}` placeholders */
+export declare const fill: (template: string, values: Record<string, string | number>) => string;
+export interface GraphLocale {
+    locale: string;
+    labels: GraphChartLabels;
+    count: (value: number) => string;
+    value: (value: number) => string;
+}
+export declare const graphLocale: (locale: string | undefined, overrides: Partial<GraphChartLabels> | undefined) => GraphLocale;

package/dist/charts/engine/graph/labels.d.ts

@@ -0,0 +1,12 @@
+import { LabelDictionary } from '../locale.js';
+import { GraphChartLabels } from './types.js';
+export declare const GRAPH_LABELS: LabelDictionary<GraphChartLabels>;
+/** Replaces `{name}` placeholders */
+export declare const fill: (template: string, values: Record<string, string | number>) => string;
+export interface GraphLocale {
+    locale: string;
+    labels: GraphChartLabels;
+    count: (value: number) => string;
+    value: (value: number) => string;
+}
+export declare const graphLocale: (locale: string | undefined, overrides: Partial<GraphChartLabels> | undefined) => GraphLocale;

package/dist/charts/engine/graph/labels.js

@@ -0,0 +1,128 @@
+import { localeLabels as e, numberFormat as t, resolveLocale as n } from "../locale.js";
+//#region src/engine/graph/labels.ts
+var r = {
+	en: {
+		chart: "Network graph",
+		tree: "Tree diagram",
+		dag: "Dependency graph",
+		summary: "{nodes} nodes, {edges} links.",
+		groupsSummary: "Groups: {groups}.",
+		keyboardHelp: "Use the arrow keys to move between nodes, Enter to select, + and - to zoom, 0 to fit.",
+		nodeFocus: "{name}, {degree} links",
+		nodeFocusGroup: "{name} ({group}), {degree} links",
+		selected: "{count} selected",
+		selectionCleared: "Selection cleared",
+		expanded: "{name} expanded",
+		collapsed: "{name} collapsed, {count} hidden",
+		shown: "{name}: shown",
+		hidden: "{name}: hidden",
+		degree: "Links",
+		incoming: "Incoming",
+		outgoing: "Outgoing",
+		value: "Value",
+		group: "Group",
+		hiddenChildren: "Hidden",
+		critical: "Critical path",
+		zoomIn: "Zoom in",
+		zoomOut: "Zoom out",
+		fit: "Fit to view",
+		zoomHint: "Use {key} + scroll to zoom",
+		listSeparator: ", "
+	},
+	zh: {
+		chart: "关系图",
+		tree: "树图",
+		dag: "依赖图",
+		summary: "{nodes} 个节点，{edges} 条关系。",
+		groupsSummary: "分组：{groups}。",
+		keyboardHelp: "使用方向键在节点间移动，Enter 选中，+ 和 - 缩放，0 适应视图。",
+		nodeFocus: "{name}，{degree} 条关系",
+		nodeFocusGroup: "{name}（{group}），{degree} 条关系",
+		selected: "已选中 {count} 个",
+		selectionCleared: "已清除选择",
+		expanded: "{name} 已展开",
+		collapsed: "{name} 已折叠，隐藏 {count} 个",
+		shown: "{name}：已显示",
+		hidden: "{name}：已隐藏",
+		degree: "关系数",
+		incoming: "入边",
+		outgoing: "出边",
+		value: "数值",
+		group: "分组",
+		hiddenChildren: "已折叠",
+		critical: "关键路径",
+		zoomIn: "放大",
+		zoomOut: "缩小",
+		fit: "适应视图",
+		zoomHint: "按住 {key} 并滚动以缩放",
+		listSeparator: "、"
+	},
+	ja: {
+		chart: "ネットワーク図",
+		tree: "ツリー図",
+		dag: "依存関係グラフ",
+		summary: "ノード {nodes} 個、リンク {edges} 本。",
+		groupsSummary: "グループ：{groups}。",
+		keyboardHelp: "矢印キーでノード間を移動、Enter で選択、+ と - でズーム、0 で全体表示。",
+		nodeFocus: "{name}、リンク {degree} 本",
+		nodeFocusGroup: "{name}（{group}）、リンク {degree} 本",
+		selected: "{count} 個を選択",
+		selectionCleared: "選択を解除しました",
+		expanded: "{name} を展開しました",
+		collapsed: "{name} を折りたたみました（{count} 個非表示）",
+		shown: "{name}：表示",
+		hidden: "{name}：非表示",
+		degree: "リンク数",
+		incoming: "入力",
+		outgoing: "出力",
+		value: "値",
+		group: "グループ",
+		hiddenChildren: "非表示",
+		critical: "クリティカルパス",
+		zoomIn: "拡大",
+		zoomOut: "縮小",
+		fit: "全体表示",
+		zoomHint: "{key} を押しながらスクロールでズーム",
+		listSeparator: "、"
+	},
+	fr: {
+		chart: "Graphe de relations",
+		tree: "Arbre",
+		dag: "Graphe de dépendances",
+		summary: "{nodes} nœuds, {edges} liens.",
+		groupsSummary: "Groupes : {groups}.",
+		keyboardHelp: "Flèches pour passer d’un nœud à l’autre, Entrée pour sélectionner, + et - pour zoomer, 0 pour tout afficher.",
+		nodeFocus: "{name}, {degree} liens",
+		nodeFocusGroup: "{name} ({group}), {degree} liens",
+		selected: "{count} sélectionné(s)",
+		selectionCleared: "Sélection effacée",
+		expanded: "{name} déplié",
+		collapsed: "{name} replié, {count} masqué(s)",
+		shown: "{name} : affiché",
+		hidden: "{name} : masqué",
+		degree: "Liens",
+		incoming: "Entrants",
+		outgoing: "Sortants",
+		value: "Valeur",
+		group: "Groupe",
+		hiddenChildren: "Masqués",
+		critical: "Chemin critique",
+		zoomIn: "Zoom avant",
+		zoomOut: "Zoom arrière",
+		fit: "Tout afficher",
+		zoomHint: "Utilisez {key} + molette pour zoomer",
+		listSeparator: ", "
+	}
+}, i = (e, t) => e.replace(/\{(\w+)\}/g, (e, n) => n in t ? String(t[n]) : e), a = (i, a) => {
+	let o = n(i);
+	return {
+		locale: o,
+		labels: e(r, o, a),
+		count: (e) => t(o).format(e),
+		value: (e) => Number.isFinite(e) ? t(o, { maximumFractionDigits: 2 }).format(e) : "–"
+	};
+};
+//#endregion
+export { r as GRAPH_LABELS, i as fill, a as graphLocale };
+
+//# sourceMappingURL=labels.js.map

package/dist/charts/engine/graph/labels.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"labels.js","names":["GRAPH_LABELS","fill","template","key","values","match","graphLocale","resolved","resolveLocale","locale","localeLabels","overrides","numberFormat","value"],"sources":["../../../../../charts/src/engine/graph/labels.ts"],"sourcesContent":["// Built-in texts of the graph charts (English, Chinese, Japanese, French)\n// and the number formatting of their tooltips.\n\nimport {\n  localeLabels,\n  numberFormat,\n  resolveLocale,\n  type LabelDictionary,\n} from \"../locale\";\nimport type { GraphChartLabels } from \"./types\";\n\nexport const GRAPH_LABELS: LabelDictionary<GraphChartLabels> = {\n  en: {\n    chart: \"Network graph\",\n    tree: \"Tree diagram\",\n    dag: \"Dependency graph\",\n    summary: \"{nodes} nodes, {edges} links.\",\n    groupsSummary: \"Groups: {groups}.\",\n    keyboardHelp:\n      \"Use the arrow keys to move between nodes, Enter to select, + and - to zoom, 0 to fit.\",\n    nodeFocus: \"{name}, {degree} links\",\n    nodeFocusGroup: \"{name} ({group}), {degree} links\",\n    selected: \"{count} selected\",\n    selectionCleared: \"Selection cleared\",\n    expanded: \"{name} expanded\",\n    collapsed: \"{name} collapsed, {count} hidden\",\n    shown: \"{name}: shown\",\n    hidden: \"{name}: hidden\",\n    degree: \"Links\",\n    incoming: \"Incoming\",\n    outgoing: \"Outgoing\",\n    value: \"Value\",\n    group: \"Group\",\n    hiddenChildren: \"Hidden\",\n    critical: \"Critical path\",\n    zoomIn: \"Zoom in\",\n    zoomOut: \"Zoom out\",\n    fit: \"Fit to view\",\n    zoomHint: \"Use {key} + scroll to zoom\",\n    listSeparator: \", \",\n  },\n  zh: {\n    chart: \"关系图\",\n    tree: \"树图\",\n    dag: \"依赖图\",\n    summary: \"{nodes} 个节点，{edges} 条关系。\",\n    groupsSummary: \"分组：{groups}。\",\n    keyboardHelp:\n      \"使用方向键在节点间移动，Enter 选中，+ 和 - 缩放，0 适应视图。\",\n    nodeFocus: \"{name}，{degree} 条关系\",\n    nodeFocusGroup: \"{name}（{group}），{degree} 条关系\",\n    selected: \"已选中 {count} 个\",\n    selectionCleared: \"已清除选择\",\n    expanded: \"{name} 已展开\",\n    collapsed: \"{name} 已折叠，隐藏 {count} 个\",\n    shown: \"{name}：已显示\",\n    hidden: \"{name}：已隐藏\",\n    degree: \"关系数\",\n    incoming: \"入边\",\n    outgoing: \"出边\",\n    value: \"数值\",\n    group: \"分组\",\n    hiddenChildren: \"已折叠\",\n    critical: \"关键路径\",\n    zoomIn: \"放大\",\n    zoomOut: \"缩小\",\n    fit: \"适应视图\",\n    zoomHint: \"按住 {key} 并滚动以缩放\",\n    listSeparator: \"、\",\n  },\n  ja: {\n    chart: \"ネットワーク図\",\n    tree: \"ツリー図\",\n    dag: \"依存関係グラフ\",\n    summary: \"ノード {nodes} 個、リンク {edges} 本。\",\n    groupsSummary: \"グループ：{groups}。\",\n    keyboardHelp:\n      \"矢印キーでノード間を移動、Enter で選択、+ と - でズーム、0 で全体表示。\",\n    nodeFocus: \"{name}、リンク {degree} 本\",\n    nodeFocusGroup: \"{name}（{group}）、リンク {degree} 本\",\n    selected: \"{count} 個を選択\",\n    selectionCleared: \"選択を解除しました\",\n    expanded: \"{name} を展開しました\",\n    collapsed: \"{name} を折りたたみました（{count} 個非表示）\",\n    shown: \"{name}：表示\",\n    hidden: \"{name}：非表示\",\n    degree: \"リンク数\",\n    incoming: \"入力\",\n    outgoing: \"出力\",\n    value: \"値\",\n    group: \"グループ\",\n    hiddenChildren: \"非表示\",\n    critical: \"クリティカルパス\",\n    zoomIn: \"拡大\",\n    zoomOut: \"縮小\",\n    fit: \"全体表示\",\n    zoomHint: \"{key} を押しながらスクロールでズーム\",\n    listSeparator: \"、\",\n  },\n  fr: {\n    chart: \"Graphe de relations\",\n    tree: \"Arbre\",\n    dag: \"Graphe de dépendances\",\n    summary: \"{nodes} nœuds, {edges} liens.\",\n    groupsSummary: \"Groupes : {groups}.\",\n    keyboardHelp:\n      \"Flèches pour passer d’un nœud à l’autre, Entrée pour sélectionner, + et - pour zoomer, 0 pour tout afficher.\",\n    nodeFocus: \"{name}, {degree} liens\",\n    nodeFocusGroup: \"{name} ({group}), {degree} liens\",\n    selected: \"{count} sélectionné(s)\",\n    selectionCleared: \"Sélection effacée\",\n    expanded: \"{name} déplié\",\n    collapsed: \"{name} replié, {count} masqué(s)\",\n    shown: \"{name} : affiché\",\n    hidden: \"{name} : masqué\",\n    degree: \"Liens\",\n    incoming: \"Entrants\",\n    outgoing: \"Sortants\",\n    value: \"Valeur\",\n    group: \"Groupe\",\n    hiddenChildren: \"Masqués\",\n    critical: \"Chemin critique\",\n    zoomIn: \"Zoom avant\",\n    zoomOut: \"Zoom arrière\",\n    fit: \"Tout afficher\",\n    zoomHint: \"Utilisez {key} + molette pour zoomer\",\n    listSeparator: \", \",\n  },\n};\n\n/** Replaces `{name}` placeholders */\nexport const fill = (\n  template: string,\n  values: Record<string, string | number>,\n): string =>\n  template.replace(/\\{(\\w+)\\}/g, (match, key: string) =>\n    key in values ? String(values[key]) : match,\n  );\n\nexport interface GraphLocale {\n  locale: string;\n  labels: GraphChartLabels;\n  count: (value: number) => string;\n  value: (value: number) => string;\n}\n\nexport const graphLocale = (\n  locale: string | undefined,\n  overrides: Partial<GraphChartLabels> | undefined,\n): GraphLocale => {\n  const resolved = resolveLocale(locale);\n  return {\n    locale: resolved,\n    labels: localeLabels(GRAPH_LABELS, resolved, overrides),\n    count: (value) => numberFormat(resolved).format(value),\n    value: (value) =>\n      Number.isFinite(value)\n        ? numberFormat(resolved, { maximumFractionDigits: 2 }).format(value)\n        : \"–\",\n  };\n};\n"],"mappings":";;AAWA,IAAaA,IAAkD;CAC7D,IAAI;EACF,OAAO;EACP,MAAM;EACN,KAAK;EACL,SAAS;EACT,eAAe;EACf,cACE;EACF,WAAW;EACX,gBAAgB;EAChB,UAAU;EACV,kBAAkB;EAClB,UAAU;EACV,WAAW;EACX,OAAO;EACP,QAAQ;EACR,QAAQ;EACR,UAAU;EACV,UAAU;EACV,OAAO;EACP,OAAO;EACP,gBAAgB;EAChB,UAAU;EACV,QAAQ;EACR,SAAS;EACT,KAAK;EACL,UAAU;EACV,eAAe;CACjB;CACA,IAAI;EACF,OAAO;EACP,MAAM;EACN,KAAK;EACL,SAAS;EACT,eAAe;EACf,cACE;EACF,WAAW;EACX,gBAAgB;EAChB,UAAU;EACV,kBAAkB;EAClB,UAAU;EACV,WAAW;EACX,OAAO;EACP,QAAQ;EACR,QAAQ;EACR,UAAU;EACV,UAAU;EACV,OAAO;EACP,OAAO;EACP,gBAAgB;EAChB,UAAU;EACV,QAAQ;EACR,SAAS;EACT,KAAK;EACL,UAAU;EACV,eAAe;CACjB;CACA,IAAI;EACF,OAAO;EACP,MAAM;EACN,KAAK;EACL,SAAS;EACT,eAAe;EACf,cACE;EACF,WAAW;EACX,gBAAgB;EAChB,UAAU;EACV,kBAAkB;EAClB,UAAU;EACV,WAAW;EACX,OAAO;EACP,QAAQ;EACR,QAAQ;EACR,UAAU;EACV,UAAU;EACV,OAAO;EACP,OAAO;EACP,gBAAgB;EAChB,UAAU;EACV,QAAQ;EACR,SAAS;EACT,KAAK;EACL,UAAU;EACV,eAAe;CACjB;CACA,IAAI;EACF,OAAO;EACP,MAAM;EACN,KAAK;EACL,SAAS;EACT,eAAe;EACf,cACE;EACF,WAAW;EACX,gBAAgB;EAChB,UAAU;EACV,kBAAkB;EAClB,UAAU;EACV,WAAW;EACX,OAAO;EACP,QAAQ;EACR,QAAQ;EACR,UAAU;EACV,UAAU;EACV,OAAO;EACP,OAAO;EACP,gBAAgB;EAChB,UAAU;EACV,QAAQ;EACR,SAAS;EACT,KAAK;EACL,UAAU;EACV,eAAe;CACjB;AACF,GAGaC,KACX,GACA,MAEAC,EAAS,QAAQ,eAAe,GAAO,MACrCC,KAAOC,IAAS,OAAOA,EAAOD,EAAI,IAAIE,CACxC,GASWC,KACX,GACA,MACgB;CAChB,IAAMC,IAAWC,EAAcC,CAAM;CACrC,OAAO;EACL,QAAQF;EACR,QAAQG,EAAaV,GAAcO,GAAUI,CAAS;EACtD,QAAQ,MAAUC,EAAaL,CAAQ,CAAC,CAAC,OAAOM,CAAK;EACrD,QAAQ,MACN,OAAO,SAASA,CAAK,IACjBD,EAAaL,GAAU,EAAE,uBAAuB,EAAE,CAAC,CAAC,CAAC,OAAOM,CAAK,IACjE;CACR;AACF"}

package/dist/charts/engine/graph/model.cjs

@@ -0,0 +1,2 @@
+var e=e=>{let t=1/0,n=-1/0;for(let r of e)r!==void 0&&Number.isFinite(r)&&(r<t&&(t=r),r>n&&(n=r));return t<=n?[t,n]:null},t=(t,n,r)=>{let i=new Map,a=[],o=[];t.forEach((e,t)=>{e&&typeof e.id==`string`&&!i.has(e.id)&&(i.set(e.id,a.length),a.push(e),o.push(t))});let s=a.length,c=[],l=[],u=[],d=[];n.forEach((e,t)=>{let n=i.get(e?.source),r=i.get(e?.target);n!==void 0&&r!==void 0&&n!==r&&(c.push(e),l.push(t),u.push(n),d.push(r))});let f=c.length,p=Int32Array.from(u),m=Int32Array.from(d),h=new Int32Array(s),g=new Int32Array(s),_=new Int32Array(s+1);for(let e=0;e<f;e++)g[p[e]]++,h[m[e]]++,_[p[e]+1]++,_[m[e]+1]++;for(let e=0;e<s;e++)_[e+1]+=_[e];let v=new Int32Array(f*2),y=_.slice(0,s);for(let e=0;e<f;e++)v[y[p[e]]++]=e,v[y[m[e]]++]=e;let b=[],x=new Map;for(let e of r??[])e&&!x.has(e.id)&&(x.set(e.id,b.length),b.push({id:e.id,name:e.name??e.id,color:e.color,hidden:!!e.hidden,count:0}));let S=new Int32Array(s).fill(-1);a.forEach((e,t)=>{if(e.group===void 0||e.group===null)return;let n=String(e.group),r=x.get(n);r===void 0&&(r=b.length,x.set(n,r),b.push({id:n,name:n,hidden:!1,count:0})),b[r].count++,S[t]=r});let C=e=>h[e]+g[e],w=Int32Array.from({length:s},(e,t)=>t).sort((e,t)=>{let n=a[e].value,r=a[t].value,i=Number.isFinite(n)?n:-1/0;return(Number.isFinite(r)?r:-1/0)-i||C(t)-C(e)||e-t});return{nodes:a,n:s,nodeInput:Int32Array.from(o),index:i,edges:c,edgeInput:Int32Array.from(l),m:f,source:p,target:m,adjStart:_,adjEdge:v,inDegree:h,outDegree:g,groups:b,groupOf:S,valueRange:e(a.map(e=>e.value)),edgeValueRange:e(c.map(e=>e.value)),rank:w}},n=(e,t,n,r)=>{n[t]=1;for(let i=e.adjStart[t];i<e.adjStart[t+1];i++){let t=e.adjEdge[i];r[t]=1,n[e.source[t]]=1,n[e.target[t]]=1}},r=(e,t,n,r)=>{n[t]=1;for(let i of[!0,!1]){let a=new Uint8Array(e.n);a[t]=1;let o=[t];for(let t=0;t<o.length;t++){let s=o[t];for(let t=e.adjStart[s];t<e.adjStart[s+1];t++){let c=e.adjEdge[t],l=i?e.source[c]:e.target[c],u=i?e.target[c]:e.source[c];l===s&&(r[c]=1,n[u]=1,a[u]||(a[u]=1,o.push(u)))}}}};exports.buildModel=t,exports.lineage=r,exports.neighborhood=n;
+//# sourceMappingURL=model.cjs.map

package/dist/charts/engine/graph/model.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"model.cjs","names":["range","min","max","v","values","buildModel","index","unique","nodeInput","nodes","node","k","n","edges","input","s","t","edgesIn","a","edge","b","m","source","target","inDegree","outDegree","adjStart","i","adjEdge","cursor","groups","groupIndex","g","groupsIn","groupOf","id","degree","rank","va","vb","fa","neighborhood","model","e","lineage","down","seen","queue","q","from","to"],"sources":["../../../../../charts/src/engine/graph/model.ts"],"sourcesContent":["// Index structures of the graph data: ids, valid edges, adjacency (CSR),\n// degrees, groups.\n\nimport type { GraphEdge, GraphGroup, GraphNode } from \"./types\";\n\nexport interface GraphGroupModel {\n  id: string;\n  name: string;\n  color?: string;\n  /** Hidden by its `hidden` option */\n  hidden: boolean;\n  /** Number of nodes */\n  count: number;\n}\n\nexport interface GraphModel {\n  nodes: readonly GraphNode[];\n  n: number;\n  /** Index of each node in the input (duplicate ids are skipped) */\n  nodeInput: Int32Array;\n  index: Map<string, number>;\n  /** Valid edges (both ends known) */\n  edges: GraphEdge[];\n  /** Index of each valid edge in the input */\n  edgeInput: Int32Array;\n  m: number;\n  source: Int32Array;\n  target: Int32Array;\n  /** Undirected adjacency: node → edges (CSR) */\n  adjStart: Int32Array;\n  adjEdge: Int32Array;\n  inDegree: Int32Array;\n  outDegree: Int32Array;\n  groups: GraphGroupModel[];\n  /** Group index of each node, -1 = none */\n  groupOf: Int32Array;\n  /** Value range of the nodes with a value */\n  valueRange: [number, number] | null;\n  /** Value range of the edges with a value */\n  edgeValueRange: [number, number] | null;\n  /** Nodes ordered by importance (value, then degree) */\n  rank: Int32Array;\n}\n\nconst range = (values: (number | undefined)[]): [number, number] | null => {\n  let min = Infinity;\n  let max = -Infinity;\n  for (const v of values) {\n    if (v === undefined || !Number.isFinite(v)) continue;\n    if (v < min) min = v;\n    if (v > max) max = v;\n  }\n  return min <= max ? [min, max] : null;\n};\n\nexport const buildModel = (\n  nodes: readonly GraphNode[],\n  edgesIn: readonly GraphEdge[],\n  groupsIn: readonly GraphGroup[] | undefined,\n): GraphModel => {\n  const index = new Map<string, number>();\n  const unique: GraphNode[] = [];\n  const nodeInput: number[] = [];\n  nodes.forEach((node, k) => {\n    if (!node || typeof node.id !== \"string\" || index.has(node.id)) return;\n    index.set(node.id, unique.length);\n    unique.push(node);\n    nodeInput.push(k);\n  });\n  const n = unique.length;\n  const edges: GraphEdge[] = [];\n  const input: number[] = [];\n  const s: number[] = [];\n  const t: number[] = [];\n  edgesIn.forEach((edge, k) => {\n    const a = index.get(edge?.source);\n    const b = index.get(edge?.target);\n    if (a === undefined || b === undefined || a === b) return;\n    edges.push(edge);\n    input.push(k);\n    s.push(a);\n    t.push(b);\n  });\n  const m = edges.length;\n  const source = Int32Array.from(s);\n  const target = Int32Array.from(t);\n  const inDegree = new Int32Array(n);\n  const outDegree = new Int32Array(n);\n  const adjStart = new Int32Array(n + 1);\n  for (let e = 0; e < m; e++) {\n    outDegree[source[e]]++;\n    inDegree[target[e]]++;\n    adjStart[source[e] + 1]++;\n    adjStart[target[e] + 1]++;\n  }\n  for (let i = 0; i < n; i++) adjStart[i + 1] += adjStart[i];\n  const adjEdge = new Int32Array(m * 2);\n  const cursor = adjStart.slice(0, n);\n  for (let e = 0; e < m; e++) {\n    adjEdge[cursor[source[e]]++] = e;\n    adjEdge[cursor[target[e]]++] = e;\n  }\n\n  const groups: GraphGroupModel[] = [];\n  const groupIndex = new Map<string, number>();\n  for (const g of groupsIn ?? []) {\n    if (!g || groupIndex.has(g.id)) continue;\n    groupIndex.set(g.id, groups.length);\n    groups.push({\n      id: g.id,\n      name: g.name ?? g.id,\n      color: g.color,\n      hidden: !!g.hidden,\n      count: 0,\n    });\n  }\n  const groupOf = new Int32Array(n).fill(-1);\n  unique.forEach((node, i) => {\n    if (node.group === undefined || node.group === null) return;\n    const id = String(node.group);\n    let g = groupIndex.get(id);\n    if (g === undefined) {\n      g = groups.length;\n      groupIndex.set(id, g);\n      groups.push({ id, name: id, hidden: false, count: 0 });\n    }\n    groups[g].count++;\n    groupOf[i] = g;\n  });\n\n  const degree = (i: number) => inDegree[i] + outDegree[i];\n  const rank = Int32Array.from({ length: n }, (_, i) => i).sort((a, b) => {\n    const va = unique[a].value;\n    const vb = unique[b].value;\n    const fa = Number.isFinite(va) ? va! : -Infinity;\n    const fb = Number.isFinite(vb) ? vb! : -Infinity;\n    return fb - fa || degree(b) - degree(a) || a - b;\n  });\n\n  return {\n    nodes: unique,\n    n,\n    nodeInput: Int32Array.from(nodeInput),\n    index,\n    edges,\n    edgeInput: Int32Array.from(input),\n    m,\n    source,\n    target,\n    adjStart,\n    adjEdge,\n    inDegree,\n    outDegree,\n    groups,\n    groupOf,\n    valueRange: range(unique.map((node) => node.value)),\n    edgeValueRange: range(edges.map((edge) => edge.value)),\n    rank,\n  };\n};\n\n/** Neighbors of a node and the edges between them */\nexport const neighborhood = (\n  model: GraphModel,\n  i: number,\n  nodes: Uint8Array,\n  edges: Uint8Array,\n): void => {\n  nodes[i] = 1;\n  for (let k = model.adjStart[i]; k < model.adjStart[i + 1]; k++) {\n    const e = model.adjEdge[k];\n    edges[e] = 1;\n    nodes[model.source[e]] = 1;\n    nodes[model.target[e]] = 1;\n  }\n};\n\n/** Ancestors and descendants of a node and the edges of these paths */\nexport const lineage = (\n  model: GraphModel,\n  i: number,\n  nodes: Uint8Array,\n  edges: Uint8Array,\n): void => {\n  nodes[i] = 1;\n  for (const down of [true, false]) {\n    const seen = new Uint8Array(model.n);\n    seen[i] = 1;\n    const queue = [i];\n    for (let q = 0; q < queue.length; q++) {\n      const v = queue[q];\n      for (let k = model.adjStart[v]; k < model.adjStart[v + 1]; k++) {\n        const e = model.adjEdge[k];\n        const from = down ? model.source[e] : model.target[e];\n        const to = down ? model.target[e] : model.source[e];\n        if (from !== v) continue;\n        edges[e] = 1;\n        nodes[to] = 1;\n        if (!seen[to]) {\n          seen[to] = 1;\n          queue.push(to);\n        }\n      }\n    }\n  }\n};\n"],"mappings":"AA4CA,IAAMA,EAAS,GAA4D,CACzE,IAAIC,EAAM,IACNC,EAAM,KACV,IAAK,IAAMC,KAAKC,EACVD,IAAM,IAAA,IAAc,OAAO,SAASA,CAAC,IACrCA,EAAIF,IAAK,EAAME,GACfA,EAAID,IAAK,EAAMC,IAErB,OAAOF,GAAOC,EAAM,CAACD,EAAKC,CAAG,EAAI,IACnC,EAEaG,GACX,EACA,EACA,IACe,CACf,IAAMC,EAAQ,IAAI,IACZC,EAAsB,CAAC,EACvBC,EAAsB,CAAC,EAC7BC,EAAM,SAAS,EAAM,IAAM,CACpBC,GAAQ,OAAOA,EAAK,IAAO,UAAY,GAAM,IAAIA,EAAK,EAAE,IAC7DJ,EAAM,IAAII,EAAK,GAAIH,EAAO,MAAM,EAChCA,EAAO,KAAKG,CAAI,EAChBF,EAAU,KAAKG,CAAC,EAClB,CAAC,EACD,IAAMC,EAAIL,EAAO,OACXM,EAAqB,CAAC,EACtBC,EAAkB,CAAC,EACnBC,EAAc,CAAC,EACfC,EAAc,CAAC,EACrBC,EAAQ,SAAS,EAAM,IAAM,CAC3B,IAAMC,EAAIZ,EAAM,IAAIa,GAAM,MAAM,EAC1BC,EAAId,EAAM,IAAIa,GAAM,MAAM,EAC5BD,IAAM,IAAA,IAAaE,IAAM,IAAA,IAAaF,IAAME,IAChDP,EAAM,KAAKM,CAAI,EACfL,EAAM,KAAKH,CAAC,EACZI,EAAE,KAAKG,CAAC,EACRF,EAAE,KAAKI,CAAC,EACV,CAAC,EACD,IAAMC,EAAIR,EAAM,OACVS,EAAS,WAAW,KAAKP,CAAC,EAC1BQ,EAAS,WAAW,KAAKP,CAAC,EAC1BQ,EAAW,IAAI,WAAWZ,CAAC,EAC3Ba,EAAY,IAAI,WAAWb,CAAC,EAC5Bc,EAAW,IAAI,WAAWd,EAAI,CAAC,EACrC,IAAK,IAAI,EAAI,EAAG,EAAIS,EAAG,IACrB,EAAUC,EAAO,GAAG,GACpB,EAASC,EAAO,GAAG,GACnB,EAASD,EAAO,GAAK,EAAE,GACvB,EAASC,EAAO,GAAK,EAAE,GAEzB,IAAK,IAAII,EAAI,EAAGA,EAAIf,EAAG,IAAK,EAASe,EAAI,IAAMD,EAASC,GACxD,IAAMC,EAAU,IAAI,WAAWP,EAAI,CAAC,EAC9BQ,EAASH,EAAS,MAAM,EAAGd,CAAC,EAClC,IAAK,IAAI,EAAI,EAAG,EAAIS,EAAG,IACrB,EAAQ,EAAOC,EAAO,GAAG,IAAM,EAC/B,EAAQ,EAAOC,EAAO,GAAG,IAAM,EAGjC,IAAMO,EAA4B,CAAC,EAC7BC,EAAa,IAAI,IACvB,IAAK,IAAMC,KAAKC,GAAY,CAAC,EACtBD,GAAK,GAAW,IAAIA,EAAE,EAAE,IAC7BD,EAAW,IAAIC,EAAE,GAAIF,EAAO,MAAM,EAClCA,EAAO,KAAK,CACV,GAAIE,EAAE,GACN,KAAMA,EAAE,MAAQA,EAAE,GAClB,MAAOA,EAAE,MACT,OAAQ,CAAC,CAACA,EAAE,OACZ,MAAO,CACT,CAAC,GAEH,IAAME,EAAU,IAAI,WAAWtB,CAAC,CAAC,CAAC,KAAK,EAAE,EACzCL,EAAO,SAAS,EAAM,IAAM,CAC1B,GAAIG,EAAK,QAAU,IAAA,IAAaA,EAAK,QAAU,KAAM,OACrD,IAAMyB,EAAK,OAAOzB,EAAK,KAAK,EACxBsB,EAAID,EAAW,IAAII,CAAE,EACrBH,IAAM,IAAA,KACR,EAAIF,EAAO,OACXC,EAAW,IAAII,EAAIH,CAAC,EACpBF,EAAO,KAAK,CAAE,KAAI,KAAMK,EAAI,OAAQ,GAAO,MAAO,CAAE,CAAC,GAEvD,EAAOH,EAAE,CAAC,QACV,EAAQL,GAAKK,CACf,CAAC,EAED,IAAMI,EAAU,GAAcZ,EAASG,GAAKF,EAAUE,GAChDU,EAAO,WAAW,KAAK,CAAE,OAAQzB,CAAE,GAAI,EAAG,IAAMe,CAAC,CAAC,CAAC,MAAM,EAAG,IAAM,CACtE,IAAMW,EAAK/B,EAAOW,EAAE,CAAC,MACfqB,EAAKhC,EAAOa,EAAE,CAAC,MACfoB,EAAK,OAAO,SAASF,CAAE,EAAIA,EAAM,KAEvC,OADW,OAAO,SAASC,CAAE,EAAIA,EAAM,MAC3BC,GAAMJ,EAAOhB,CAAC,EAAIgB,EAAOlB,CAAC,GAAKA,EAAIE,CACjD,CAAC,EAED,MAAO,CACL,MAAOb,EACP,IACA,UAAW,WAAW,KAAKC,CAAS,EACpC,QACA,QACA,UAAW,WAAW,KAAKM,CAAK,EAChC,IACA,SACA,SACA,WACA,UACA,WACA,YACA,SACA,UACA,WAAYd,EAAMO,EAAO,IAAK,GAASG,EAAK,KAAK,CAAC,EAClD,eAAgBV,EAAMa,EAAM,IAAK,GAASM,EAAK,KAAK,CAAC,EACrD,MACF,CACF,EAGasB,GACX,EACA,EACA,EACA,IACS,CACT,EAAMd,GAAK,EACX,IAAK,IAAIhB,EAAI+B,EAAM,SAASf,GAAIhB,EAAI+B,EAAM,SAASf,EAAI,GAAI,IAAK,CAC9D,IAAMgB,EAAID,EAAM,QAAQ/B,GACxB,EAAMgC,GAAK,EACX,EAAMD,EAAM,OAAOC,IAAM,EACzB,EAAMD,EAAM,OAAOC,IAAM,CAC3B,CACF,EAGaC,GACX,EACA,EACA,EACA,IACS,CACT,EAAMjB,GAAK,EACX,IAAK,IAAMkB,IAAQ,CAAC,GAAM,EAAK,EAAG,CAChC,IAAMC,EAAO,IAAI,WAAWJ,EAAM,CAAC,EACnC,EAAKf,GAAK,EACV,IAAMoB,EAAQ,CAACpB,CAAC,EAChB,IAAK,IAAIqB,EAAI,EAAGA,EAAID,EAAM,OAAQ,IAAK,CACrC,IAAM5C,EAAI4C,EAAMC,GAChB,IAAK,IAAIrC,EAAI+B,EAAM,SAASvC,GAAIQ,EAAI+B,EAAM,SAASvC,EAAI,GAAI,IAAK,CAC9D,IAAMwC,EAAID,EAAM,QAAQ/B,GAClBsC,EAAOJ,EAAOH,EAAM,OAAOC,GAAKD,EAAM,OAAOC,GAC7CO,EAAKL,EAAOH,EAAM,OAAOC,GAAKD,EAAM,OAAOC,GAC7CM,IAAS9C,IACb,EAAMwC,GAAK,EACX,EAAMO,GAAM,EACPJ,EAAKI,KACR,EAAKA,GAAM,EACXH,EAAM,KAAKG,CAAE,GAEjB,CACF,CACF,CACF"}

package/dist/charts/engine/graph/model.d.cts

@@ -0,0 +1,43 @@
+import { GraphEdge, GraphGroup, GraphNode } from './types.cjs';
+export interface GraphGroupModel {
+    id: string;
+    name: string;
+    color?: string;
+    /** Hidden by its `hidden` option */
+    hidden: boolean;
+    /** Number of nodes */
+    count: number;
+}
+export interface GraphModel {
+    nodes: readonly GraphNode[];
+    n: number;
+    /** Index of each node in the input (duplicate ids are skipped) */
+    nodeInput: Int32Array;
+    index: Map<string, number>;
+    /** Valid edges (both ends known) */
+    edges: GraphEdge[];
+    /** Index of each valid edge in the input */
+    edgeInput: Int32Array;
+    m: number;
+    source: Int32Array;
+    target: Int32Array;
+    /** Undirected adjacency: node → edges (CSR) */
+    adjStart: Int32Array;
+    adjEdge: Int32Array;
+    inDegree: Int32Array;
+    outDegree: Int32Array;
+    groups: GraphGroupModel[];
+    /** Group index of each node, -1 = none */
+    groupOf: Int32Array;
+    /** Value range of the nodes with a value */
+    valueRange: [number, number] | null;
+    /** Value range of the edges with a value */
+    edgeValueRange: [number, number] | null;
+    /** Nodes ordered by importance (value, then degree) */
+    rank: Int32Array;
+}
+export declare const buildModel: (nodes: readonly GraphNode[], edgesIn: readonly GraphEdge[], groupsIn: readonly GraphGroup[] | undefined) => GraphModel;
+/** Neighbors of a node and the edges between them */
+export declare const neighborhood: (model: GraphModel, i: number, nodes: Uint8Array, edges: Uint8Array) => void;
+/** Ancestors and descendants of a node and the edges of these paths */
+export declare const lineage: (model: GraphModel, i: number, nodes: Uint8Array, edges: Uint8Array) => void;

package/dist/charts/engine/graph/model.d.ts

@@ -0,0 +1,43 @@
+import { GraphEdge, GraphGroup, GraphNode } from './types.js';
+export interface GraphGroupModel {
+    id: string;
+    name: string;
+    color?: string;
+    /** Hidden by its `hidden` option */
+    hidden: boolean;
+    /** Number of nodes */
+    count: number;
+}
+export interface GraphModel {
+    nodes: readonly GraphNode[];
+    n: number;
+    /** Index of each node in the input (duplicate ids are skipped) */
+    nodeInput: Int32Array;
+    index: Map<string, number>;
+    /** Valid edges (both ends known) */
+    edges: GraphEdge[];
+    /** Index of each valid edge in the input */
+    edgeInput: Int32Array;
+    m: number;
+    source: Int32Array;
+    target: Int32Array;
+    /** Undirected adjacency: node → edges (CSR) */
+    adjStart: Int32Array;
+    adjEdge: Int32Array;
+    inDegree: Int32Array;
+    outDegree: Int32Array;
+    groups: GraphGroupModel[];
+    /** Group index of each node, -1 = none */
+    groupOf: Int32Array;
+    /** Value range of the nodes with a value */
+    valueRange: [number, number] | null;
+    /** Value range of the edges with a value */
+    edgeValueRange: [number, number] | null;
+    /** Nodes ordered by importance (value, then degree) */
+    rank: Int32Array;
+}
+export declare const buildModel: (nodes: readonly GraphNode[], edgesIn: readonly GraphEdge[], groupsIn: readonly GraphGroup[] | undefined) => GraphModel;
+/** Neighbors of a node and the edges between them */
+export declare const neighborhood: (model: GraphModel, i: number, nodes: Uint8Array, edges: Uint8Array) => void;
+/** Ancestors and descendants of a node and the edges of these paths */
+export declare const lineage: (model: GraphModel, i: number, nodes: Uint8Array, edges: Uint8Array) => void;

package/dist/charts/engine/graph/model.js

@@ -0,0 +1,88 @@
+//#region src/engine/graph/model.ts
+var e = (e) => {
+	let t = Infinity, n = -Infinity;
+	for (let r of e) r !== void 0 && Number.isFinite(r) && (r < t && (t = r), r > n && (n = r));
+	return t <= n ? [t, n] : null;
+}, t = (t, n, r) => {
+	let i = /* @__PURE__ */ new Map(), a = [], o = [];
+	t.forEach((e, t) => {
+		e && typeof e.id == "string" && !i.has(e.id) && (i.set(e.id, a.length), a.push(e), o.push(t));
+	});
+	let s = a.length, c = [], l = [], u = [], d = [];
+	n.forEach((e, t) => {
+		let n = i.get(e?.source), r = i.get(e?.target);
+		n !== void 0 && r !== void 0 && n !== r && (c.push(e), l.push(t), u.push(n), d.push(r));
+	});
+	let f = c.length, p = Int32Array.from(u), m = Int32Array.from(d), h = new Int32Array(s), g = new Int32Array(s), _ = new Int32Array(s + 1);
+	for (let e = 0; e < f; e++) g[p[e]]++, h[m[e]]++, _[p[e] + 1]++, _[m[e] + 1]++;
+	for (let e = 0; e < s; e++) _[e + 1] += _[e];
+	let v = new Int32Array(f * 2), y = _.slice(0, s);
+	for (let e = 0; e < f; e++) v[y[p[e]]++] = e, v[y[m[e]]++] = e;
+	let b = [], x = /* @__PURE__ */ new Map();
+	for (let e of r ?? []) e && !x.has(e.id) && (x.set(e.id, b.length), b.push({
+		id: e.id,
+		name: e.name ?? e.id,
+		color: e.color,
+		hidden: !!e.hidden,
+		count: 0
+	}));
+	let S = new Int32Array(s).fill(-1);
+	a.forEach((e, t) => {
+		if (e.group === void 0 || e.group === null) return;
+		let n = String(e.group), r = x.get(n);
+		r === void 0 && (r = b.length, x.set(n, r), b.push({
+			id: n,
+			name: n,
+			hidden: !1,
+			count: 0
+		})), b[r].count++, S[t] = r;
+	});
+	let C = (e) => h[e] + g[e], w = Int32Array.from({ length: s }, (e, t) => t).sort((e, t) => {
+		let n = a[e].value, r = a[t].value, i = Number.isFinite(n) ? n : -Infinity;
+		return (Number.isFinite(r) ? r : -Infinity) - i || C(t) - C(e) || e - t;
+	});
+	return {
+		nodes: a,
+		n: s,
+		nodeInput: Int32Array.from(o),
+		index: i,
+		edges: c,
+		edgeInput: Int32Array.from(l),
+		m: f,
+		source: p,
+		target: m,
+		adjStart: _,
+		adjEdge: v,
+		inDegree: h,
+		outDegree: g,
+		groups: b,
+		groupOf: S,
+		valueRange: e(a.map((e) => e.value)),
+		edgeValueRange: e(c.map((e) => e.value)),
+		rank: w
+	};
+}, n = (e, t, n, r) => {
+	n[t] = 1;
+	for (let i = e.adjStart[t]; i < e.adjStart[t + 1]; i++) {
+		let t = e.adjEdge[i];
+		r[t] = 1, n[e.source[t]] = 1, n[e.target[t]] = 1;
+	}
+}, r = (e, t, n, r) => {
+	n[t] = 1;
+	for (let i of [!0, !1]) {
+		let a = new Uint8Array(e.n);
+		a[t] = 1;
+		let o = [t];
+		for (let t = 0; t < o.length; t++) {
+			let s = o[t];
+			for (let t = e.adjStart[s]; t < e.adjStart[s + 1]; t++) {
+				let c = e.adjEdge[t], l = i ? e.source[c] : e.target[c], u = i ? e.target[c] : e.source[c];
+				l === s && (r[c] = 1, n[u] = 1, a[u] || (a[u] = 1, o.push(u)));
+			}
+		}
+	}
+};
+//#endregion
+export { t as buildModel, r as lineage, n as neighborhood };
+
+//# sourceMappingURL=model.js.map