@nebutra/graph-model 0.2.2 → 0.2.3

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@nebutra/graph-model",
-  "version": "0.2.2",
+  "version": "0.2.3",
   "description": "Neutral structural DAG contract: generic GraphNode/GraphEdge/Graph types + pure cycle/inbound algorithms. Depended on by reel and the ui node-graph editor; depends on neither.",
   "private": false,
   "license": "MIT",
@@ -10,10 +10,14 @@
     "category": "platform",
     "summary": "Generic acyclic graph types + pure traversal algorithms"
   },
-  "main": "./src/index.ts",
-  "types": "./src/index.ts",
+  "main": "./dist/index.js",
+  "types": "./dist/index.d.ts",
   "exports": {
-    ".": "./src/index.ts"
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js",
+      "default": "./dist/index.js"
+    }
   },
   "dependencies": {},
   "devDependencies": {
@@ -34,6 +38,12 @@
   "publishConfig": {
     "access": "public"
   },
+  "files": [
+    "dist",
+    "README.md",
+    "LICENSE",
+    "CHANGELOG.md"
+  ],
   "scripts": {
     "build": "tsup",
     "test": "vitest run",

package/.turbo/turbo-build.log

@@ -1,17 +0,0 @@
-
-> @nebutra/graph-model@0.2.2 build /Users/tseka_luk/Documents/Nebutra-SaaS-Lab/Nebutra-Sailor/packages/platform/graph-model
-> tsup
-
-CLI Building entry: src/index.ts
-CLI Using tsconfig: tsconfig.json
-CLI tsup v8.5.1
-CLI Using tsup config: /Users/tseka_luk/Documents/Nebutra-SaaS-Lab/Nebutra-Sailor/packages/platform/graph-model/tsup.config.ts
-CLI Target: es2022
-CLI Cleaning output folder
-ESM Build start
-ESM dist/index.js     911.00 B
-ESM dist/index.js.map 3.09 KB
-ESM ⚡️ Build success in 20ms
-DTS Build start
-DTS ⚡️ Build success in 2781ms
-DTS dist/index.d.ts 1.65 KB

package/.turbo/turbo-test.log

@@ -1,14 +0,0 @@
-
-> @nebutra/graph-model@0.2.1 test /Users/tseka_luk/Documents/Nebutra-SaaS-Lab/Nebutra-Sailor/packages/platform/graph-model
-> vitest run
-
-
- RUN  v4.1.4 /Users/tseka_luk/Documents/Nebutra-SaaS-Lab/Nebutra-Sailor/packages/platform/graph-model
-
- ✓ src/__tests__/graph-model.test.ts (10 tests) 6ms
-
- Test Files  1 passed (1)
-      Tests  10 passed (10)
-   Start at  09:38:27
-   Duration  205ms (transform 31ms, setup 0ms, import 42ms, tests 6ms, environment 0ms)
-

package/.turbo/turbo-typecheck.log

@@ -1,4 +0,0 @@
-
-> @nebutra/graph-model@0.2.2 typecheck /Users/tseka_luk/Documents/Nebutra-SaaS-Lab/Nebutra-Sailor/packages/platform/graph-model
-> tsc --noEmit
-

package/src/__tests__/graph-model.test.ts

@@ -1,78 +0,0 @@
-import { describe, expect, it } from "vitest";
-import { hasCycleFrom, inboundEdges, wouldCreateCycle } from "../index";
-
-const edges = [
-  { from: "a", to: "b" },
-  { from: "b", to: "c" },
-  { from: "a", to: "c" },
-];
-
-describe("inboundEdges", () => {
-  it("returns only edges whose target is the node", () => {
-    expect(inboundEdges(edges, "c")).toEqual([
-      { from: "b", to: "c" },
-      { from: "a", to: "c" },
-    ]);
-  });
-  it("returns empty for a source-only node", () => {
-    expect(inboundEdges(edges, "a")).toEqual([]);
-  });
-  it("preserves the concrete edge subtype", () => {
-    const typed = [{ from: "a", to: "b", inputType: "ctx" }];
-    expect(inboundEdges(typed, "b")[0]?.inputType).toBe("ctx");
-  });
-});
-
-describe("hasCycleFrom", () => {
-  it("is false for an acyclic graph", () => {
-    expect(hasCycleFrom(edges, "a")).toBe(false);
-  });
-  it("detects a direct cycle", () => {
-    expect(
-      hasCycleFrom(
-        [
-          { from: "a", to: "b" },
-          { from: "b", to: "a" },
-        ],
-        "a",
-      ),
-    ).toBe(true);
-  });
-  it("detects an indirect cycle", () => {
-    expect(
-      hasCycleFrom(
-        [
-          { from: "a", to: "b" },
-          { from: "b", to: "c" },
-          { from: "c", to: "a" },
-        ],
-        "a",
-      ),
-    ).toBe(true);
-  });
-  it("is false starting from a node not on the cycle", () => {
-    expect(
-      hasCycleFrom(
-        [
-          { from: "b", to: "c" },
-          { from: "c", to: "b" },
-        ],
-        "a",
-      ),
-    ).toBe(false);
-  });
-});
-
-describe("wouldCreateCycle", () => {
-  it("rejects an edge that closes a loop", () => {
-    expect(wouldCreateCycle(edges, "c", "a")).toBe(true);
-  });
-  it("accepts an edge that keeps the graph acyclic", () => {
-    expect(wouldCreateCycle(edges, "c", "d")).toBe(false);
-  });
-  it("does not mutate the input edges array", () => {
-    const input = [{ from: "a", to: "b" }];
-    wouldCreateCycle(input, "b", "a");
-    expect(input).toEqual([{ from: "a", to: "b" }]);
-  });
-});

package/src/index.ts

@@ -1,69 +0,0 @@
-/**
- * @nebutra/graph-model — neutral structural DAG contract.
- *
- * The minimal shape every node-graph feature shares: positioned nodes, plain
- * directed edges, and the two pure traversals (`inboundEdges`, `hasCycleFrom`)
- * plus the `wouldCreateCycle` guard used by interactive editors. Domain
- * packages (`@nebutra/reel`) specialize these types; the generic
- * `@nebutra/ui` node-graph editor depends on this contract — neither depends
- * on the other.
- */
-
-/** A positioned graph node. Domain nodes extend this. */
-export interface GraphNode {
-  readonly id: string;
-  readonly x: number;
-  readonly y: number;
-}
-
-/** A directed edge. Domain edges extend this (e.g. add an input-port tag). */
-export interface GraphEdge {
-  readonly from: string;
-  readonly to: string;
-}
-
-/** A structural graph; `N`/`E` carry the domain specialization. */
-export interface Graph<N extends GraphNode = GraphNode, E extends GraphEdge = GraphEdge> {
-  readonly nodes: readonly N[];
-  readonly edges: readonly E[];
-}
-
-/** Edges whose target is `nodeId`. Preserves the concrete edge subtype. */
-export function inboundEdges<E extends GraphEdge>(
-  edges: readonly E[],
-  nodeId: string,
-): readonly E[] {
-  return edges.filter((e) => e.to === nodeId);
-}
-
-/** Detect a cycle reachable from `nodeId` (depth-first, edge-following). */
-export function hasCycleFrom(edges: readonly GraphEdge[], nodeId: string): boolean {
-  const adjacency = new Map<string, string[]>();
-  for (const e of edges) {
-    const list = adjacency.get(e.from) ?? [];
-    list.push(e.to);
-    adjacency.set(e.from, list);
-  }
-  const visiting = new Set<string>();
-  const done = new Set<string>();
-  const walk = (id: string): boolean => {
-    if (visiting.has(id)) return true;
-    if (done.has(id)) return false;
-    visiting.add(id);
-    for (const next of adjacency.get(id) ?? []) {
-      if (walk(next)) return true;
-    }
-    visiting.delete(id);
-    done.add(id);
-    return false;
-  };
-  return walk(nodeId);
-}
-
-/**
- * Would adding `from → to` make the graph cyclic? Pure: never mutates the
- * passed `edges`. The canonical guard for interactive edge creation.
- */
-export function wouldCreateCycle(edges: readonly GraphEdge[], from: string, to: string): boolean {
-  return hasCycleFrom([...edges, { from, to }], from);
-}

package/tsconfig.json

@@ -1,10 +0,0 @@
-{
-  "extends": "../../../tsconfig.base.json",
-  "compilerOptions": {
-    "outDir": "dist",
-    "rootDir": "src",
-    "incremental": false
-  },
-  "include": ["src/**/*.ts"],
-  "exclude": ["node_modules", "dist"]
-}

package/tsup.config.ts

@@ -1,10 +0,0 @@
-import { defineConfig } from "tsup";
-
-export default defineConfig({
-  entry: ["src/index.ts"],
-  format: ["esm"],
-  dts: true,
-  clean: true,
-  sourcemap: true,
-  target: "es2022",
-});