@statelyai/graph 0.13.0 → 2.0.0

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@statelyai/graph",
   "type": "module",
-  "version": "0.13.0",
+  "version": "2.0.0",
   "description": "A TypeScript-first graph library with plain JSON-serializable objects",
   "author": "David Khourshid <david@stately.ai>",
   "license": "MIT",
@@ -28,6 +28,7 @@
     "./adjacency-list": "./dist/formats/adjacency-list/index.mjs",
     "./converter": "./dist/formats/converter/index.mjs",
     "./cytoscape": "./dist/formats/cytoscape/index.mjs",
+    "./d2": "./dist/formats/d2/index.mjs",
     "./d3": "./dist/formats/d3/index.mjs",
     "./dot": "./dist/formats/dot/index.mjs",
     "./edge-list": "./dist/formats/edge-list/index.mjs",
@@ -51,12 +52,13 @@
     "schemas"
   ],
   "devDependencies": {
-    "publint": "^0.3.15",
     "@changesets/changelog-github": "^0.5.2",
     "@changesets/cli": "^2.29.8",
+    "@dagrejs/graphlib": "^4.0.1",
     "@types/d3-array": "^3.2.2",
     "@types/d3-force": "^3.0.10",
     "@types/node": "^25.0.3",
+    "@vitest/coverage-v8": "^4.0.18",
     "@xyflow/system": "^0.0.75",
     "bumpp": "^10.3.2",
     "cytoscape": "^3.33.1",
@@ -65,6 +67,14 @@
     "dotparser": "^1.1.1",
     "elkjs": "^0.11.1",
     "fast-xml-parser": "^5.3.4",
+    "graphology": "^0.26.0",
+    "graphology-components": "^1.5.4",
+    "graphology-metrics": "^2.4.0",
+    "graphology-shortest-path": "^2.1.0",
+    "graphology-types": "^0.24.8",
+    "ngraph.graph": "^20.1.2",
+    "ngraph.path": "^1.6.1",
+    "publint": "^0.3.15",
     "tsdown": "^0.18.1",
     "tsx": "^4.21.0",
     "typescript": "^5.9.3",
@@ -113,6 +123,7 @@
     "generate-schema": "tsx scripts/generate-json-schema.ts",
     "changeset": "changeset",
     "version": "changeset version",
-    "release": "pnpm run build && changeset publish"
+    "release": "pnpm run build && changeset publish",
+    "bench:compare": "tsx bench/compare/run.ts"
   }
 }

package/schemas/edge.schema.json

@@ -34,6 +34,14 @@
     "targetPort": {
       "type": "string"
     },
+    "mode": {
+      "type": "string",
+      "enum": [
+        "directed",
+        "undirected",
+        "bidirectional"
+      ]
+    },
     "data": {},
     "x": {
       "type": "number"
@@ -62,6 +70,9 @@
           },
           {
             "type": "number"
+          },
+          {
+            "type": "boolean"
           }
         ]
       }

package/schemas/graph.schema.json

@@ -5,11 +5,12 @@
     "id": {
       "type": "string"
     },
-    "type": {
+    "mode": {
       "type": "string",
       "enum": [
         "directed",
-        "undirected"
+        "undirected",
+        "bidirectional"
       ]
     },
     "initialNodeId": {
@@ -95,6 +96,9 @@
                 },
                 {
                   "type": "number"
+                },
+                {
+                  "type": "boolean"
                 }
               ]
             }
@@ -143,6 +147,9 @@
                       },
                       {
                         "type": "number"
+                      },
+                      {
+                        "type": "boolean"
                       }
                     ]
                   }
@@ -202,6 +209,14 @@
           "targetPort": {
             "type": "string"
           },
+          "mode": {
+            "type": "string",
+            "enum": [
+              "directed",
+              "undirected",
+              "bidirectional"
+            ]
+          },
           "data": {},
           "x": {
             "type": "number"
@@ -230,6 +245,9 @@
                 },
                 {
                   "type": "number"
+                },
+                {
+                  "type": "boolean"
                 }
               ]
             }
@@ -267,6 +285,9 @@
           },
           {
             "type": "number"
+          },
+          {
+            "type": "boolean"
           }
         ]
       }
@@ -274,7 +295,7 @@
   },
   "required": [
     "id",
-    "type",
+    "mode",
     "nodes",
     "edges",
     "data"

package/schemas/node.schema.json

@@ -70,6 +70,9 @@
           },
           {
             "type": "number"
+          },
+          {
+            "type": "boolean"
           }
         ]
       }
@@ -118,6 +121,9 @@
                 },
                 {
                   "type": "number"
+                },
+                {
+                  "type": "boolean"
                 }
               ]
             }

package/dist/indexing-DUl3kTqm.mjs

@@ -1,137 +0,0 @@
-//#region src/indexing.ts
-const indexes = /* @__PURE__ */ new WeakMap();
-/**
-* Get or lazily build the index for a graph.
-* Auto-rebuilds when node/edge count changes.
-*
-* @example
-* ```ts
-* import { createGraph, getIndex } from '@statelyai/graph';
-*
-* const graph = createGraph({
-*   nodes: [{ id: 'a' }, { id: 'b' }],
-*   edges: [{ id: 'e1', sourceId: 'a', targetId: 'b' }],
-* });
-*
-* const idx = getIndex(graph);
-* idx.nodeById.get('a'); // 0
-* idx.outEdges.get('a'); // ['e1']
-* ```
-*/
-function getIndex(graph) {
-	let idx = indexes.get(graph);
-	const sameStructure = idx && idx.nodeCount === graph.nodes.length && idx.edgeCount === graph.edges.length;
-	const signature = idx !== void 0 && sameStructure && idx.nodesRef === graph.nodes && idx.edgesRef === graph.edges ? getIndexSignature(graph) : void 0;
-	if (!idx || idx.nodeCount !== graph.nodes.length || idx.edgeCount !== graph.edges.length || signature !== void 0 && idx.signature !== signature) {
-		idx = buildIndex(graph, signature ?? getIndexSignature(graph));
-		indexes.set(graph, idx);
-	}
-	return idx;
-}
-/**
-* Clear the cached index. Call this if you mutate graph.nodes/edges directly.
-*
-* @example
-* ```ts
-* import { createGraph, invalidateIndex, getIndex } from '@statelyai/graph';
-*
-* const graph = createGraph({ nodes: [{ id: 'a' }], edges: [] });
-* // manually mutate nodes array
-* graph.nodes.push({ type: 'node', id: 'b', parentId: null, initialNodeId: null, label: '', data: undefined });
-* invalidateIndex(graph); // forces rebuild on next getIndex()
-* ```
-*/
-function invalidateIndex(graph) {
-	indexes.delete(graph);
-}
-function getIndexSignature(graph) {
-	const nodeParts = graph.nodes.map((node) => `${node.id}\u0000${node.parentId ?? ""}`);
-	const edgeParts = graph.edges.map((edge) => `${edge.id}\u0000${edge.sourceId}\u0000${edge.targetId}`);
-	return `${nodeParts.join("
")}\u0002${edgeParts.join("
")}`;
-}
-function buildIndex(graph, signature) {
-	const nodeById = /* @__PURE__ */ new Map();
-	const edgeById = /* @__PURE__ */ new Map();
-	const outEdges = /* @__PURE__ */ new Map();
-	const inEdges = /* @__PURE__ */ new Map();
-	const childNodes = /* @__PURE__ */ new Map();
-	for (let i = 0; i < graph.nodes.length; i++) {
-		const n = graph.nodes[i];
-		nodeById.set(n.id, i);
-		outEdges.set(n.id, []);
-		inEdges.set(n.id, []);
-		const parent = n.parentId ?? null;
-		if (!childNodes.has(parent)) childNodes.set(parent, []);
-		childNodes.get(parent).push(n.id);
-	}
-	for (let i = 0; i < graph.edges.length; i++) {
-		const e = graph.edges[i];
-		edgeById.set(e.id, i);
-		outEdges.get(e.sourceId)?.push(e.id);
-		inEdges.get(e.targetId)?.push(e.id);
-	}
-	return {
-		nodeById,
-		edgeById,
-		outEdges,
-		inEdges,
-		childNodes,
-		nodeCount: graph.nodes.length,
-		edgeCount: graph.edges.length,
-		signature,
-		nodesRef: graph.nodes,
-		edgesRef: graph.edges
-	};
-}
-function indexAddNode(idx, node, arrayIndex) {
-	idx.nodeById.set(node.id, arrayIndex);
-	idx.outEdges.set(node.id, []);
-	idx.inEdges.set(node.id, []);
-	const parent = node.parentId ?? null;
-	if (!idx.childNodes.has(parent)) idx.childNodes.set(parent, []);
-	idx.childNodes.get(parent).push(node.id);
-	idx.nodeCount++;
-	idx.signature = "";
-}
-function indexAddEdge(idx, edge, arrayIndex) {
-	idx.edgeById.set(edge.id, arrayIndex);
-	idx.outEdges.get(edge.sourceId)?.push(edge.id);
-	idx.inEdges.get(edge.targetId)?.push(edge.id);
-	idx.edgeCount++;
-	idx.signature = "";
-}
-/** Update childNodes index when a node's parentId changes. */
-function indexReparentNode(idx, nodeId, oldParentId, newParentId) {
-	const oldSiblings = idx.childNodes.get(oldParentId ?? null);
-	if (oldSiblings) {
-		const pos = oldSiblings.indexOf(nodeId);
-		if (pos !== -1) oldSiblings.splice(pos, 1);
-	}
-	const np = newParentId ?? null;
-	if (!idx.childNodes.has(np)) idx.childNodes.set(np, []);
-	idx.childNodes.get(np).push(nodeId);
-	idx.signature = "";
-}
-/** Update adjacency lists when an edge's sourceId/targetId changes. */
-function indexUpdateEdgeEndpoints(idx, edgeId, oldSourceId, oldTargetId, newSourceId, newTargetId) {
-	if (oldSourceId !== newSourceId) {
-		const oldOut = idx.outEdges.get(oldSourceId);
-		if (oldOut) {
-			const pos = oldOut.indexOf(edgeId);
-			if (pos !== -1) oldOut.splice(pos, 1);
-		}
-		idx.outEdges.get(newSourceId)?.push(edgeId);
-	}
-	if (oldTargetId !== newTargetId) {
-		const oldIn = idx.inEdges.get(oldTargetId);
-		if (oldIn) {
-			const pos = oldIn.indexOf(edgeId);
-			if (pos !== -1) oldIn.splice(pos, 1);
-		}
-		idx.inEdges.get(newTargetId)?.push(edgeId);
-	}
-	idx.signature = "";
-}
-
-//#endregion
-export { indexUpdateEdgeEndpoints as a, indexReparentNode as i, indexAddEdge as n, invalidateIndex as o, indexAddNode as r, getIndex as t };