@statelyai/graph 0.10.0 → 0.11.1

package/dist/formats/graphml/index.d.mts

@@ -1,4 +1,4 @@
-import { h as GraphFormatConverter, u as Graph } from "../../types-F3j-sr2X.mjs";
+import { h as GraphFormatConverter, u as Graph } from "../../types-CnZ01raw.mjs";
 
 //#region src/formats/graphml/index.d.ts
 declare function toGraphML(graph: Graph): string;

package/dist/formats/graphml/index.mjs

@@ -1,4 +1,4 @@
-import { n as createFormatConverter } from "../../converter-B5CUD0r9.mjs";
+import { n as createFormatConverter } from "../../converter-Dspillnn.mjs";
 import { XMLBuilder, XMLParser } from "fast-xml-parser";
 
 //#region src/formats/graphml/index.ts
@@ -100,6 +100,24 @@ function toGraphML(graph) {
 			"@_for": "edge",
 			"@_attr.name": "weight",
 			"@_attr.type": "double"
+		},
+		{
+			"@_id": "ports",
+			"@_for": "node",
+			"@_attr.name": "ports",
+			"@_attr.type": "string"
+		},
+		{
+			"@_id": "sourcePort",
+			"@_for": "edge",
+			"@_attr.name": "sourcePort",
+			"@_attr.type": "string"
+		},
+		{
+			"@_id": "targetPort",
+			"@_for": "edge",
+			"@_attr.name": "targetPort",
+			"@_attr.type": "string"
 		}
 	];
 	const nodes = graph.nodes.map((node) => {
@@ -148,6 +166,10 @@ function toGraphML(graph) {
 			"@_key": "color",
 			"#text": node.color
 		});
+		if (node.ports !== void 0) data.push({
+			"@_key": "ports",
+			"#text": JSON.stringify(node.ports)
+		});
 		return {
 			"@_id": node.id,
 			...data.length > 0 && { data }
@@ -191,6 +213,14 @@ function toGraphML(graph) {
 			"@_key": "weight",
 			"#text": edge.weight
 		});
+		if (edge.sourcePort !== void 0) data.push({
+			"@_key": "sourcePort",
+			"#text": edge.sourcePort
+		});
+		if (edge.targetPort !== void 0) data.push({
+			"@_key": "targetPort",
+			"#text": edge.targetPort
+		});
 		return {
 			"@_id": edge.id,
 			"@_source": edge.sourceId,
@@ -279,6 +309,7 @@ function fromGraphML(xml) {
 		if (dataMap.shape !== void 0) node.shape = dataMap.shape;
 		if (dataMap.color !== void 0) node.color = dataMap.color;
 		if (dataMap.style !== void 0) node.style = tryParseJSON(dataMap.style);
+		if (dataMap.ports !== void 0) node.ports = tryParseJSON(dataMap.ports);
 		return node;
 	});
 	const edges = asArray(graphEl.edge).map((edgeEl) => {
@@ -298,6 +329,8 @@ function fromGraphML(xml) {
 		if (dataMap.height !== void 0) edge.height = parseNumber(dataMap.height);
 		if (dataMap.color !== void 0) edge.color = dataMap.color;
 		if (dataMap.style !== void 0) edge.style = tryParseJSON(dataMap.style);
+		if (dataMap.sourcePort !== void 0) edge.sourcePort = dataMap.sourcePort;
+		if (dataMap.targetPort !== void 0) edge.targetPort = dataMap.targetPort;
 		return edge;
 	});
 	const graph = {

package/dist/formats/jgf/index.d.mts

@@ -1,4 +1,4 @@
-import { h as GraphFormatConverter, u as Graph } from "../../types-F3j-sr2X.mjs";
+import { h as GraphFormatConverter, u as Graph } from "../../types-CnZ01raw.mjs";
 
 //#region src/formats/jgf/index.d.ts
 interface JGFNode {

package/dist/formats/jgf/index.mjs

@@ -1,4 +1,4 @@
-import { n as createFormatConverter } from "../../converter-B5CUD0r9.mjs";
+import { n as createFormatConverter } from "../../converter-Dspillnn.mjs";
 
 //#region src/formats/jgf/index.ts
 /**

package/dist/formats/mermaid/index.d.mts

@@ -1,4 +1,4 @@
-import { h as GraphFormatConverter, u as Graph } from "../../types-F3j-sr2X.mjs";
+import { h as GraphFormatConverter, u as Graph } from "../../types-CnZ01raw.mjs";
 
 //#region src/formats/mermaid/sequence.d.ts
 interface SequenceNodeData {
@@ -19,8 +19,10 @@ interface SequenceNodeData {
 interface SequenceEdgeData {
   kind: 'message' | 'activation' | 'deactivation';
   stroke?: 'solid' | 'dotted';
-  arrowType?: 'filled' | 'open' | 'cross' | 'async';
+  arrowType?: 'filled' | 'open' | 'cross' | 'async' | 'half-top' | 'half-bottom' | 'half-reverse-top' | 'half-reverse-bottom' | 'stick-half-top' | 'stick-half-bottom' | 'stick-half-reverse-top' | 'stick-half-reverse-bottom';
   bidirectional?: boolean;
+  centralSource?: boolean;
+  centralTarget?: boolean;
   sequenceNumber?: number;
 }
 /**
@@ -396,4 +398,46 @@ declare function toMermaidBlock(graph: MermaidBlockGraph): string;
  */
 declare const mermaidBlockConverter: GraphFormatConverter<string, BlockNodeData, BlockEdgeData, BlockGraphData>;
 //#endregion
-export { type BlockEdgeData, type BlockGraphData, type BlockNodeData, type ClassEdgeData, type ClassGraphData, type ClassNodeData, type EREdgeData, type ERGraphData, type ERNodeData, type FlowchartEdgeData, type FlowchartGraphData, type FlowchartNodeData, type MermaidBlockGraph, type MermaidClassGraph, type MermaidERGraph, type MermaidFlowchartGraph, type MermaidMindmapGraph, type MermaidSequenceGraph, type MermaidStateGraph, type MindmapEdgeData, type MindmapGraphData, type MindmapNodeData, type SequenceBlock, type SequenceEdgeData, type SequenceGraphData, type SequenceNodeData, type StateEdgeData, type StateGraphData, type StateNodeData, fromMermaidBlock, fromMermaidClass, fromMermaidER, fromMermaidFlowchart, fromMermaidMindmap, fromMermaidSequence, fromMermaidState, mermaidBlockConverter, mermaidClassConverter, mermaidERConverter, mermaidFlowchartConverter, mermaidMindmapConverter, mermaidSequenceConverter, mermaidStateConverter, toMermaidBlock, toMermaidClass, toMermaidER, toMermaidFlowchart, toMermaidMindmap, toMermaidSequence, toMermaidState };
+//#region src/formats/mermaid/ishikawa.d.ts
+interface IshikawaNodeData {
+  kind: 'effect' | 'cause';
+}
+interface IshikawaEdgeData {}
+interface IshikawaGraphData {
+  diagramType: 'ishikawa';
+}
+type MermaidIshikawaGraph = Graph<IshikawaNodeData, IshikawaEdgeData, IshikawaGraphData>;
+/**
+ * Parses a Mermaid Ishikawa diagram string into a Graph.
+ *
+ * @example
+ * const graph = fromMermaidIshikawa(`
+ * ishikawa-beta
+ * Problem
+ *     Cause
+ *         Sub-cause
+ * `);
+ */
+declare function fromMermaidIshikawa(input: string): MermaidIshikawaGraph;
+/**
+ * Converts an Ishikawa Graph to a Mermaid Ishikawa diagram string.
+ *
+ * @example
+ * const mermaid = toMermaidIshikawa(graph);
+ * // "ishikawa-beta\nProblem\n    Cause"
+ */
+declare function toMermaidIshikawa(graph: MermaidIshikawaGraph): string;
+/**
+ * Bidirectional converter for Mermaid Ishikawa diagram format.
+ *
+ * @example
+ * const graph = mermaidIshikawaConverter.from(`
+ * ishikawa-beta
+ * Problem
+ *     Cause
+ * `);
+ * const str = mermaidIshikawaConverter.to(graph);
+ */
+declare const mermaidIshikawaConverter: GraphFormatConverter<string, IshikawaNodeData, IshikawaEdgeData, IshikawaGraphData>;
+//#endregion
+export { type BlockEdgeData, type BlockGraphData, type BlockNodeData, type ClassEdgeData, type ClassGraphData, type ClassNodeData, type EREdgeData, type ERGraphData, type ERNodeData, type FlowchartEdgeData, type FlowchartGraphData, type FlowchartNodeData, type IshikawaEdgeData, type IshikawaGraphData, type IshikawaNodeData, type MermaidBlockGraph, type MermaidClassGraph, type MermaidERGraph, type MermaidFlowchartGraph, type MermaidIshikawaGraph, type MermaidMindmapGraph, type MermaidSequenceGraph, type MermaidStateGraph, type MindmapEdgeData, type MindmapGraphData, type MindmapNodeData, type SequenceBlock, type SequenceEdgeData, type SequenceGraphData, type SequenceNodeData, type StateEdgeData, type StateGraphData, type StateNodeData, fromMermaidBlock, fromMermaidClass, fromMermaidER, fromMermaidFlowchart, fromMermaidIshikawa, fromMermaidMindmap, fromMermaidSequence, fromMermaidState, mermaidBlockConverter, mermaidClassConverter, mermaidERConverter, mermaidFlowchartConverter, mermaidIshikawaConverter, mermaidMindmapConverter, mermaidSequenceConverter, mermaidStateConverter, toMermaidBlock, toMermaidClass, toMermaidER, toMermaidFlowchart, toMermaidIshikawa, toMermaidMindmap, toMermaidSequence, toMermaidState };

package/dist/formats/mermaid/index.mjs

@@ -1,4 +1,4 @@
-import { n as createFormatConverter } from "../../converter-B5CUD0r9.mjs";
+import { n as createFormatConverter } from "../../converter-Dspillnn.mjs";
 
 //#region src/formats/mermaid/shared.ts
 const MERMAID_TO_DIRECTION = {
@@ -98,6 +98,46 @@ const ARROW_PATTERNS = [
 		arrowType: "async",
 		bidirectional: false
 	}],
+	["--|\\", {
+		stroke: "dotted",
+		arrowType: "half-top",
+		bidirectional: false
+	}],
+	["--|/", {
+		stroke: "dotted",
+		arrowType: "half-bottom",
+		bidirectional: false
+	}],
+	["/|--", {
+		stroke: "dotted",
+		arrowType: "half-reverse-top",
+		bidirectional: false
+	}],
+	["\\|--", {
+		stroke: "dotted",
+		arrowType: "half-reverse-bottom",
+		bidirectional: false
+	}],
+	["--\\\\", {
+		stroke: "dotted",
+		arrowType: "stick-half-top",
+		bidirectional: false
+	}],
+	["--//", {
+		stroke: "dotted",
+		arrowType: "stick-half-bottom",
+		bidirectional: false
+	}],
+	["//--", {
+		stroke: "dotted",
+		arrowType: "stick-half-reverse-top",
+		bidirectional: false
+	}],
+	["\\\\--", {
+		stroke: "dotted",
+		arrowType: "stick-half-reverse-bottom",
+		bidirectional: false
+	}],
 	["->>", {
 		stroke: "solid",
 		arrowType: "filled",
@@ -117,12 +157,56 @@ const ARROW_PATTERNS = [
 		stroke: "solid",
 		arrowType: "async",
 		bidirectional: false
+	}],
+	["-|\\", {
+		stroke: "solid",
+		arrowType: "half-top",
+		bidirectional: false
+	}],
+	["-|/", {
+		stroke: "solid",
+		arrowType: "half-bottom",
+		bidirectional: false
+	}],
+	["/|-", {
+		stroke: "solid",
+		arrowType: "half-reverse-top",
+		bidirectional: false
+	}],
+	["\\|-", {
+		stroke: "solid",
+		arrowType: "half-reverse-bottom",
+		bidirectional: false
+	}],
+	["-\\\\", {
+		stroke: "solid",
+		arrowType: "stick-half-top",
+		bidirectional: false
+	}],
+	["-//", {
+		stroke: "solid",
+		arrowType: "stick-half-bottom",
+		bidirectional: false
+	}],
+	["//-", {
+		stroke: "solid",
+		arrowType: "stick-half-reverse-top",
+		bidirectional: false
+	}],
+	["\\\\-", {
+		stroke: "solid",
+		arrowType: "stick-half-reverse-bottom",
+		bidirectional: false
 	}]
 ];
-function parseArrow(arrow) {
+function getEscapedRegExp(s) {
+	return s.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+}
+function getParsedArrow(arrow) {
 	for (const [pattern, info] of ARROW_PATTERNS) if (arrow === pattern) return info;
 }
-const MESSAGE_RE = /^(\S+?)\s*(<<-->>|<<->>|-->>|-->|--x|--\)|->>|->|-x|-\))\s*(\S+?)\s*:\s*(.*)$/;
+const ARROW_PATTERN_SOURCE = ARROW_PATTERNS.map(([pattern]) => getEscapedRegExp(pattern)).join("|");
+const MESSAGE_RE = /* @__PURE__ */ new RegExp(`^(\\S+?)\\s*(${ARROW_PATTERN_SOURCE})(\\(\\))?\\s*(\\S+?)\\s*:\\s*(.*)$`);
 /**
 * Parses a Mermaid sequence diagram string into a Graph.
 *
@@ -346,8 +430,14 @@ function fromMermaidSequence(input) {
 		if (msgMatch) {
 			let sourceId = msgMatch[1];
 			const arrowStr = msgMatch[2];
-			let targetId = msgMatch[3];
-			const messageText = msgMatch[4].trim();
+			const centralTarget = msgMatch[3] === "()";
+			let targetId = msgMatch[4];
+			const messageText = msgMatch[5].trim();
+			let centralSource = false;
+			if (sourceId.endsWith("()")) {
+				centralSource = true;
+				sourceId = sourceId.slice(0, -2);
+			}
 			let activationOnTarget = null;
 			if (targetId.startsWith("+")) {
 				activationOnTarget = "activation";
@@ -366,7 +456,7 @@ function fromMermaidSequence(input) {
 			}
 			ensureNode(sourceId);
 			ensureNode(targetId);
-			const arrowInfo = parseArrow(arrowStr);
+			const arrowInfo = getParsedArrow(arrowStr);
 			if (!arrowInfo) continue;
 			const edgeId = generateEdgeId(sourceId, targetId, edgeCounter++);
 			const data = {
@@ -374,6 +464,8 @@ function fromMermaidSequence(input) {
 				stroke: arrowInfo.stroke,
 				arrowType: arrowInfo.arrowType,
 				...arrowInfo.bidirectional && { bidirectional: true },
+				...centralSource && { centralSource: true },
+				...centralTarget && { centralTarget: true },
 				...autonumber && { sequenceNumber: ++seqNum }
 			};
 			addEdge({
@@ -464,13 +556,29 @@ const ARROW_MAP = {
 		open: "->",
 		filled: "->>",
 		cross: "-x",
-		async: "-)"
+		async: "-)",
+		"half-top": "-|\\",
+		"half-bottom": "-|/",
+		"half-reverse-top": "/|-",
+		"half-reverse-bottom": "\\|-",
+		"stick-half-top": "-\\\\",
+		"stick-half-bottom": "-//",
+		"stick-half-reverse-top": "//-",
+		"stick-half-reverse-bottom": "\\\\-"
 	},
 	dotted: {
 		open: "-->",
 		filled: "-->>",
 		cross: "--x",
-		async: "--)"
+		async: "--)",
+		"half-top": "--|\\",
+		"half-bottom": "--|/",
+		"half-reverse-top": "/|--",
+		"half-reverse-bottom": "\\|--",
+		"stick-half-top": "--\\\\",
+		"stick-half-bottom": "--//",
+		"stick-half-reverse-top": "//--",
+		"stick-half-reverse-bottom": "\\\\--"
 	}
 };
 /**
@@ -672,8 +780,9 @@ function toMermaidSequence(graph) {
 			let arrow;
 			if (d.bidirectional) arrow = stroke === "dotted" ? "<<-->>" : "<<->>";
 			else arrow = ARROW_MAP[stroke]?.[arrowType] ?? "->>";
+			if (d.centralTarget) arrow += "()";
 			const label = edge.label ? `: ${escapeMermaidLabel(edge.label)}` : ":";
-			lines.push(`${indent()}${edge.sourceId}${arrow}${edge.targetId}${label}`);
+			lines.push(`${indent()}${edge.sourceId}${d.centralSource ? "()" : ""}${arrow}${edge.targetId}${label}`);
 		}
 		const afters = afterEdge.get(edge.id);
 		if (afters) for (const _ev of afters) {
@@ -1987,12 +2096,14 @@ const mermaidClassConverter = createFormatConverter(toMermaidClass, fromMermaidC
 //#region src/formats/mermaid/er-diagram.ts
 const LEFT_CARDINALITY = {
 	"||": "one",
+	"1": "one",
 	"|o": "zero-or-one",
 	"}|": "one-or-more",
 	"}o": "zero-or-more"
 };
 const RIGHT_CARDINALITY = {
 	"||": "one",
+	"1": "one",
 	"o|": "zero-or-one",
 	"|{": "one-or-more",
 	"o{": "zero-or-more"
@@ -2009,25 +2120,18 @@ const CARDINALITY_TO_RIGHT = {
 	"one-or-more": "|{",
 	"zero-or-more": "o{"
 };
-function parseERRelationship(symbol) {
-	if (symbol.length < 6) return null;
-	const left = symbol.slice(0, 2);
-	const mid = symbol.slice(2, 4);
-	const right = symbol.slice(4, 6);
-	const srcCard = LEFT_CARDINALITY[left];
-	const tgtCard = RIGHT_CARDINALITY[right];
-	if (!srcCard || !tgtCard) return null;
-	let identifying;
-	if (mid === "--") identifying = true;
-	else if (mid === "..") identifying = false;
-	else return null;
-	return {
-		sourceCardinality: srcCard,
-		targetCardinality: tgtCard,
-		identifying
-	};
+function getParsedERRelationship(symbol) {
+	for (const left of Object.keys(LEFT_CARDINALITY).sort((a, b) => b.length - a.length)) for (const mid of ["--", ".."]) for (const right of Object.keys(RIGHT_CARDINALITY).sort((a, b) => b.length - a.length)) {
+		if (symbol !== `${left}${mid}${right}`) continue;
+		return {
+			sourceCardinality: LEFT_CARDINALITY[left],
+			targetCardinality: RIGHT_CARDINALITY[right],
+			identifying: mid === "--"
+		};
+	}
+	return null;
 }
-const ER_LINE_RE = /^(\S+)\s+([|}{o.][|}{o.][-.][-.][|}{o.][|}{o.])\s+(\S+)\s*:\s*"?([^"]*)"?\s*$/;
+const ER_LINE_RE = /^(\S+)\s+([|}{o1.]{1,2}[-.][-.][|}{o1.]{1,2})\s+(\S+)\s*:\s*"?([^"]*)"?\s*$/;
 /**
 * Parses a Mermaid ER diagram string into a Graph.
 *
@@ -2099,7 +2203,7 @@ function fromMermaidER(input) {
 			const label = relMatch[4].trim();
 			ensureNode(leftEntity);
 			ensureNode(rightEntity);
-			const rel = parseERRelationship(symbol);
+			const rel = getParsedERRelationship(symbol);
 			if (rel) {
 				const edgeId = generateEdgeId(leftEntity, rightEntity, edgeCounter++);
 				edges.push({
@@ -2532,4 +2636,105 @@ function toMermaidBlock(graph) {
 const mermaidBlockConverter = createFormatConverter(toMermaidBlock, fromMermaidBlock);
 
 //#endregion
-export { fromMermaidBlock, fromMermaidClass, fromMermaidER, fromMermaidFlowchart, fromMermaidMindmap, fromMermaidSequence, fromMermaidState, mermaidBlockConverter, mermaidClassConverter, mermaidERConverter, mermaidFlowchartConverter, mermaidMindmapConverter, mermaidSequenceConverter, mermaidStateConverter, toMermaidBlock, toMermaidClass, toMermaidER, toMermaidFlowchart, toMermaidMindmap, toMermaidSequence, toMermaidState };
+//#region src/formats/mermaid/ishikawa.ts
+/**
+* Parses a Mermaid Ishikawa diagram string into a Graph.
+*
+* @example
+* const graph = fromMermaidIshikawa(`
+* ishikawa-beta
+* Problem
+*     Cause
+*         Sub-cause
+* `);
+*/
+function fromMermaidIshikawa(input) {
+	validateInput(input, "Mermaid Ishikawa");
+	const { lines } = prepareLines(input);
+	const header = lines[0]?.trim();
+	if (!header || !header.startsWith("ishikawa-beta")) throw new Error("Mermaid Ishikawa: expected \"ishikawa-beta\" header");
+	const nodes = [];
+	const edges = [];
+	const stack = [];
+	let nodeCounter = 0;
+	let edgeCounter = 0;
+	for (let i = 1; i < lines.length; i++) {
+		const rawLine = lines[i];
+		if (!rawLine.trim()) continue;
+		const indent = rawLine.length - rawLine.trimStart().length;
+		const label = rawLine.trim();
+		const id = `ish_${nodeCounter++}`;
+		while (stack.length > 0 && stack[stack.length - 1].indent >= indent) stack.pop();
+		const parent = stack[stack.length - 1];
+		const node = {
+			type: "node",
+			id,
+			parentId: parent?.id ?? null,
+			initialNodeId: null,
+			label,
+			data: { kind: parent ? "cause" : "effect" }
+		};
+		if (parent) edges.push({
+			type: "edge",
+			id: generateEdgeId(parent.id, id, edgeCounter++),
+			sourceId: parent.id,
+			targetId: id,
+			label: "",
+			data: {}
+		});
+		nodes.push(node);
+		stack.push({
+			id,
+			indent
+		});
+	}
+	return {
+		id: "",
+		type: "directed",
+		initialNodeId: null,
+		nodes,
+		edges,
+		data: { diagramType: "ishikawa" }
+	};
+}
+/**
+* Converts an Ishikawa Graph to a Mermaid Ishikawa diagram string.
+*
+* @example
+* const mermaid = toMermaidIshikawa(graph);
+* // "ishikawa-beta\nProblem\n    Cause"
+*/
+function toMermaidIshikawa(graph) {
+	const lines = ["ishikawa-beta"];
+	const childrenMap = /* @__PURE__ */ new Map();
+	for (const node of graph.nodes) {
+		const parentId = node.parentId ?? null;
+		const children = childrenMap.get(parentId) ?? [];
+		children.push(node);
+		childrenMap.set(parentId, children);
+	}
+	const addIshikawaNodes = (parentId, depth) => {
+		for (const node of childrenMap.get(parentId) ?? []) {
+			const indent = "    ".repeat(depth);
+			lines.push(`${indent}${escapeMermaidLabel(node.label ?? node.id)}`);
+			addIshikawaNodes(node.id, depth + 1);
+		}
+	};
+	addIshikawaNodes(null, 0);
+	return lines.join("\n");
+}
+/**
+* Bidirectional converter for Mermaid Ishikawa diagram format.
+*
+* @example
+* const graph = mermaidIshikawaConverter.from(`
+* ishikawa-beta
+* Problem
+*     Cause
+* `);
+* const str = mermaidIshikawaConverter.to(graph);
+*/
+const mermaidIshikawaConverter = createFormatConverter(toMermaidIshikawa, fromMermaidIshikawa);
+
+//#endregion
+export { fromMermaidBlock, fromMermaidClass, fromMermaidER, fromMermaidFlowchart, fromMermaidIshikawa, fromMermaidMindmap, fromMermaidSequence, fromMermaidState, mermaidBlockConverter, mermaidClassConverter, mermaidERConverter, mermaidFlowchartConverter, mermaidIshikawaConverter, mermaidMindmapConverter, mermaidSequenceConverter, mermaidStateConverter, toMermaidBlock, toMermaidClass, toMermaidER, toMermaidFlowchart, toMermaidIshikawa, toMermaidMindmap, toMermaidSequence, toMermaidState };

package/dist/formats/tgf/index.d.mts

@@ -1,4 +1,4 @@
-import { h as GraphFormatConverter, u as Graph } from "../../types-F3j-sr2X.mjs";
+import { h as GraphFormatConverter, u as Graph } from "../../types-CnZ01raw.mjs";
 
 //#region src/formats/tgf/index.d.ts
 

package/dist/formats/tgf/index.mjs

@@ -1,4 +1,4 @@
-import { n as createFormatConverter } from "../../converter-B5CUD0r9.mjs";
+import { n as createFormatConverter } from "../../converter-Dspillnn.mjs";
 
 //#region src/formats/tgf/index.ts
 /**

package/dist/formats/xyflow/index.d.mts

@@ -1,4 +1,4 @@
-import { P as VisualGraphFormatConverter, j as VisualGraph } from "../../types-F3j-sr2X.mjs";
+import { P as VisualGraphFormatConverter, j as VisualGraph } from "../../types-CnZ01raw.mjs";
 import { EdgeBase, NodeBase } from "@xyflow/system";
 
 //#region src/formats/xyflow/index.d.ts

package/dist/index.d.mts

@@ -1,5 +1,5 @@
-import { A as VisualEdge, C as NodeConfig, D as SinglePathOptions, E as PortDirection, F as VisualNode, I as VisualPort, L as WalkContext, M as VisualGraphConfig, N as VisualGraphEntity, O as TransitionOptions, P as VisualGraphFormatConverter, R as WalkOptions, S as NodeChange, T as PortConfig, _ as GraphPatch, a as EdgeChange, b as GraphStep, c as EntitiesUpdate, d as GraphConfig, f as GraphDiff, g as GraphNode, h as GraphFormatConverter, i as DeleteNodeOptions, j as VisualGraph, k as TraversalOptions, l as EntityRect, m as GraphEntity, n as AllPairsShortestPathsOptions, o as EdgeConfig, p as GraphEdge, r as CoverageStats, s as EntitiesConfig, t as AStarOptions, u as Graph, v as GraphPath, w as PathOptions, x as MSTOptions, y as GraphPort, z as WeightedWalkOptions } from "./types-F3j-sr2X.mjs";
-import { A as getArticulationPoints, B as HITSResult, C as hasPath, D as joinPaths, E as isTree, F as genGirvanNewmanCommunities, G as getEigenvectorCentrality, H as getBetweennessCentrality, I as getGirvanNewmanCommunities, J as getOutDegreeCentrality, K as getHITS, L as getGreedyModularityCommunities, M as getBridges, N as GirvanNewmanOptions, O as IsomorphismOptions, P as LabelPropagationOptions, R as getLabelPropagationCommunities, S as getTopologicalSort, T as isConnected, U as getClosenessCentrality, V as IterativeCentralityOptions, W as getDegreeCentrality, Y as getPageRank, _ as getShortestPath, a as genPreorders, b as getSimplePaths, c as getAStarPath, d as getCycles, f as getMinimumSpanningTree, g as getPreorders, h as getPreorder, i as genPostorders, j as getBiconnectedComponents, k as isIsomorphic, l as getAllPairsShortestPaths, m as getPostorders, n as dfs, o as genShortestPaths, p as getPostorder, q as getInDegreeCentrality, r as genCycles, s as genSimplePaths, t as bfs, u as getConnectedComponents, v as getShortestPaths, w as isAcyclic, x as getStronglyConnectedComponents, y as getSimplePath, z as getModularity } from "./algorithms-DdjFO-ft.mjs";
+import { A as VisualEdge, C as NodeConfig, D as SinglePathOptions, E as PortDirection, F as VisualNode, I as VisualPort, L as WalkContext, M as VisualGraphConfig, N as VisualGraphEntity, O as TransitionOptions, P as VisualGraphFormatConverter, R as WalkOptions, S as NodeChange, T as PortConfig, _ as GraphPatch, a as EdgeChange, b as GraphStep, c as EntitiesUpdate, d as GraphConfig, f as GraphDiff, g as GraphNode, h as GraphFormatConverter, i as DeleteNodeOptions, j as VisualGraph, k as TraversalOptions, l as EntityRect, m as GraphEntity, n as AllPairsShortestPathsOptions, o as EdgeConfig, p as GraphEdge, r as CoverageStats, s as EntitiesConfig, t as AStarOptions, u as Graph, v as GraphPath, w as PathOptions, x as MSTOptions, y as GraphPort, z as WeightedWalkOptions } from "./types-CnZ01raw.mjs";
+import { A as genCycles, B as getStronglyConnectedComponents, C as getMinimumSpanningTree, D as getPostorders, E as getPostorder, F as getCycles, G as getTopologicalSort, H as bfs, I as getShortestPath, J as isConnected, K as hasPath, L as getShortestPaths, M as genSimplePaths, N as getAStarPath, O as getPreorder, P as getAllPairsShortestPaths, R as getSimplePath, S as getPageRank, T as genPreorders, U as dfs, V as joinPaths, W as getConnectedComponents, Y as isTree, _ as getDegreeCentrality, a as getBridges, b as getInDegreeCentrality, c as genGirvanNewmanCommunities, d as getLabelPropagationCommunities, f as getModularity, g as getClosenessCentrality, h as getBetweennessCentrality, i as getBiconnectedComponents, j as genShortestPaths, k as getPreorders, l as getGirvanNewmanCommunities, m as IterativeCentralityOptions, n as isIsomorphic, o as GirvanNewmanOptions, p as HITSResult, q as isAcyclic, r as getArticulationPoints, s as LabelPropagationOptions, t as IsomorphismOptions, u as getGreedyModularityCommunities, v as getEigenvectorCentrality, w as genPostorders, x as getOutDegreeCentrality, y as getHITS, z as getSimplePaths } from "./algorithms-BlM-qoJb.mjs";
 import { createFormatConverter } from "./formats/converter/index.mjs";
 import { getAncestors, getChildren, getDegree, getDepth, getDescendants, getEdgesBetween, getEdgesByPort, getEdgesOf, getInDegree, getInEdges, getLCA, getNeighbors, getOutDegree, getOutEdges, getParent, getPort, getPorts, getPredecessors, getRelativeDistance, getRelativeDistanceMap, getRoots, getSiblings, getSinks, getSources, getSuccessors, isCompound, isLeaf } from "./queries.mjs";
 

package/dist/index.mjs

@@ -1,7 +1,7 @@
-import { o as invalidateIndex, t as getIndex } from "./indexing-DyfgLuzw.mjs";
-import { $ as createGraphPort, A as getBiconnectedComponents, B as getEigenvectorCentrality, C as hasPath, D as joinPaths, E as isTree, F as getLabelPropagationCommunities, G as GraphInstance, H as getInDegreeCentrality, I as getModularity, J as addNode, K as addEdge, L as getBetweennessCentrality, M as genGirvanNewmanCommunities, N as getGirvanNewmanCommunities, O as isIsomorphic, P as getGreedyModularityCommunities, Q as createGraphNode, R as getClosenessCentrality, S as getTopologicalSort, T as isConnected, U as getOutDegreeCentrality, V as getHITS, W as getPageRank, X as createGraphEdge, Y as createGraph, Z as createGraphFromTransition, _ as getShortestPath, a as genPreorders, at as getNode, b as getSimplePaths, c as getAStarPath, ct as updateEdge, d as getCycles, et as createVisualGraph, f as getMinimumSpanningTree, g as getPreorders, h as getPreorder, i as genPostorders, it as getEdge, j as getBridges, k as getArticulationPoints, l as getAllPairsShortestPaths, lt as updateEntities, m as getPostorders, n as dfs, nt as deleteEntities, o as genShortestPaths, ot as hasEdge, p as getPostorder, q as addEntities, r as genCycles, rt as deleteNode, s as genSimplePaths, st as hasNode, t as bfs, tt as deleteEdge, u as getConnectedComponents, ut as updateNode, v as getShortestPaths, w as isAcyclic, x as getStronglyConnectedComponents, y as getSimplePath, z as getDegreeCentrality } from "./algorithms-C-S7u40k.mjs";
+import { o as invalidateIndex, t as getIndex } from "./indexing-CJc-ul8e.mjs";
+import { $ as createGraphPort, A as isAcyclic, B as getShortestPaths, C as getPreorder, D as getConnectedComponents, E as dfs, F as genSimplePaths, G as GraphInstance, H as getSimplePaths, I as getAStarPath, J as addNode, K as addEdge, L as getAllPairsShortestPaths, M as isTree, N as genCycles, O as getTopologicalSort, P as genShortestPaths, Q as createGraphNode, R as getCycles, S as getPostorders, T as bfs, U as getStronglyConnectedComponents, V as getSimplePath, W as joinPaths, X as createGraphEdge, Y as createGraph, Z as createGraphFromTransition, _ as getPageRank, a as genGirvanNewmanCommunities, at as getNode, b as genPreorders, c as getLabelPropagationCommunities, ct as updateEdge, d as getClosenessCentrality, et as createVisualGraph, f as getDegreeCentrality, g as getOutDegreeCentrality, h as getInDegreeCentrality, i as getBridges, it as getEdge, j as isConnected, k as hasPath, l as getModularity, lt as updateEntities, m as getHITS, n as getArticulationPoints, nt as deleteEntities, o as getGirvanNewmanCommunities, ot as hasEdge, p as getEigenvectorCentrality, q as addEntities, r as getBiconnectedComponents, rt as deleteNode, s as getGreedyModularityCommunities, st as hasNode, t as isIsomorphic, tt as deleteEdge, u as getBetweennessCentrality, ut as updateNode, v as getMinimumSpanningTree, w as getPreorders, x as getPostorder, y as genPostorders, z as getShortestPath } from "./algorithms-BHHg7lGq.mjs";
 import { getAncestors, getChildren, getDegree, getDepth, getDescendants, getEdgesBetween, getEdgesByPort, getEdgesOf, getInDegree, getInEdges, getLCA, getNeighbors, getOutDegree, getOutEdges, getParent, getPort, getPorts, getPredecessors, getRelativeDistance, getRelativeDistanceMap, getRoots, getSiblings, getSinks, getSources, getSuccessors, isCompound, isLeaf } from "./queries.mjs";
-import { n as createFormatConverter } from "./converter-B5CUD0r9.mjs";
+import { n as createFormatConverter } from "./converter-Dspillnn.mjs";
 
 //#region src/equivalence.ts
 /** Shallow-compare two values, returning true if they differ. */

package/dist/queries.d.mts

@@ -1,4 +1,4 @@
-import { g as GraphNode, p as GraphEdge, u as Graph, y as GraphPort } from "./types-F3j-sr2X.mjs";
+import { g as GraphNode, p as GraphEdge, u as Graph, y as GraphPort } from "./types-CnZ01raw.mjs";
 
 //#region src/queries.d.ts
 

package/dist/queries.mjs

@@ -1,4 +1,4 @@
-import { t as getIndex } from "./indexing-DyfgLuzw.mjs";
+import { t as getIndex } from "./indexing-CJc-ul8e.mjs";
 
 //#region src/queries.ts
 /**