@nicia-ai/typegraph 0.17.0 → 0.19.0

package/dist/interchange/index.d.cts

@@ -1,6 +1,6 @@
 import { z } from 'zod';
 import { G as GraphDef } from '../manager-Bj1UEnhE.cjs';
-import { Y as Store } from '../store-B_JzzHwb.cjs';
+import { Y as Store } from '../store-BnUu4qo5.cjs';
 import '../types-DMzKq0d5.cjs';
 import '../types-B3mmOMJV.cjs';
 import 'drizzle-orm';

package/dist/interchange/index.d.ts

@@ -1,6 +1,6 @@
 import { z } from 'zod';
 import { G as GraphDef } from '../manager-Chhrq1vl.js';
-import { Y as Store } from '../store-DkY1pDfu.js';
+import { Y as Store } from '../store-CCOwNft_.js';
 import '../types-DMzKq0d5.js';
 import '../types-ThB4cFLp.js';
 import 'drizzle-orm';

package/dist/profiler/index.d.cts

@@ -1,6 +1,6 @@
 import { G as GraphDef } from '../manager-Bj1UEnhE.cjs';
 import { Q as QueryAst } from '../ast-Bh2NDeaK.cjs';
-import { Y as Store } from '../store-B_JzzHwb.cjs';
+import { Y as Store } from '../store-BnUu4qo5.cjs';
 import { P as ProfilerOptions, a as ProfileReport } from '../types-CVtGFpB9.cjs';
 export { D as DeclaredIndex, I as IndexRecommendation, b as ProfileSummary, c as PropertyAccessStats, d as PropertyPath, R as RecommendationPriority, U as UsageContext } from '../types-CVtGFpB9.cjs';
 import '../types-DMzKq0d5.cjs';

package/dist/profiler/index.d.ts

@@ -1,6 +1,6 @@
 import { G as GraphDef } from '../manager-Chhrq1vl.js';
 import { Q as QueryAst } from '../ast-COMyNeMn.js';
-import { Y as Store } from '../store-DkY1pDfu.js';
+import { Y as Store } from '../store-CCOwNft_.js';
 import { P as ProfilerOptions, a as ProfileReport } from '../types-COPePE8_.js';
 export { D as DeclaredIndex, I as IndexRecommendation, b as ProfileSummary, c as PropertyAccessStats, d as PropertyPath, R as RecommendationPriority, U as UsageContext } from '../types-COPePE8_.js';
 import '../types-DMzKq0d5.js';

package/dist/{store-B_JzzHwb.d.cts → store-BnUu4qo5.d.cts}

@@ -1497,13 +1497,26 @@ type SubgraphOptions<G extends GraphDef, EK extends EdgeKinds<G>, NK extends Nod
      */
     project?: P;
 }>;
+/**
+ * Union of all node result types in a subgraph, respecting projection.
+ */
+type SubgraphNodeResult<G extends GraphDef, NK extends NodeKinds<G> = NodeKinds<G>, P = undefined> = {
+    [Kind in NK]: SubgraphNodeResultForKind<G, Kind, P>;
+}[NK];
+/**
+ * Union of all edge result types in a subgraph, respecting projection.
+ */
+type SubgraphEdgeResult<G extends GraphDef, EK extends EdgeKinds<G> = EdgeKinds<G>, P = undefined> = {
+    [Kind in EK]: SubgraphEdgeResultForKind<G, Kind, P>;
+}[EK];
 type SubgraphResult<G extends GraphDef, NK extends NodeKinds<G> = NodeKinds<G>, EK extends EdgeKinds<G> = EdgeKinds<G>, P extends SubgraphProject<G, NK, EK> | undefined = undefined> = Readonly<{
-    nodes: readonly {
-        [Kind in NK]: SubgraphNodeResultForKind<G, Kind, P>;
-    }[NK][];
-    edges: readonly {
-        [Kind in EK]: SubgraphEdgeResultForKind<G, Kind, P>;
-    }[EK][];
+    /** The root node, or undefined if the root was not found or excluded. */
+    root: SubgraphNodeResult<G, NK, P> | undefined;
+    nodes: ReadonlyMap<string, SubgraphNodeResult<G, NK, P>>;
+    /** Forward adjacency: fromId → edgeKind → edges to targets. */
+    adjacency: ReadonlyMap<string, ReadonlyMap<EK, readonly SubgraphEdgeResult<G, EK, P>[]>>;
+    /** Reverse adjacency: toId → edgeKind → edges from sources. */
+    reverseAdjacency: ReadonlyMap<string, ReadonlyMap<EK, readonly SubgraphEdgeResult<G, EK, P>[]>>;
 }>;
 
 /**
@@ -2216,22 +2229,26 @@ declare class Store<G extends GraphDef> {
      * Extracts a typed subgraph by traversing from a root node.
      *
      * Performs a BFS traversal from `rootId` following the specified edge kinds,
-     * then returns all reachable nodes and the edges connecting them.
+     * returning an indexed result with adjacency maps for immediate traversal.
      *
      * @example
      * ```typescript
-     * const result = await store.subgraph(run.id, {
+     * const sg = await store.subgraph(run.id, {
      *   edges: ["has_task", "runs_agent", "uses_skill"],
      *   maxDepth: 4,
-     *   includeKinds: ["Run", "Task", "Agent", "Skill"],
      * });
      *
-     * for (const node of result.nodes) {
-     *   switch (node.kind) {
-     *     case "Task": console.log(node.name); break;
-     *     case "Agent": console.log(node.model); break;
-     *   }
-     * }
+     * // Root node (the traversal starting point)
+     * console.log(sg.root?.kind);
+     *
+     * // Lookup by ID
+     * const task = sg.nodes.get(taskId);
+     *
+     * // Forward adjacency: edges of a kind from a node
+     * const taskEdges = sg.adjacency.get(run.id)?.get("has_task") ?? [];
+     *
+     * // Reverse adjacency: edges of a kind pointing to a node
+     * const parentEdges = sg.reverseAdjacency.get(taskId)?.get("has_task") ?? [];
      * ```
      */
     subgraph<const EK extends EdgeKinds<G>, const NK extends NodeKinds<G> = NodeKinds<G>, const P extends SubgraphProject<G, NK, EK> | undefined = undefined>(rootId: NodeId<AllNodeTypes<G>>, options: SubgraphOptions<G, EK, NK, P>): Promise<SubgraphResult<G, NK, EK, P>>;
@@ -2337,4 +2354,4 @@ declare function createStore<G extends GraphDef>(graph: G, backend: GraphBackend
  */
 declare function createStoreWithSchema<G extends GraphDef>(graph: G, backend: GraphBackend, options?: StoreOptions & SchemaManagerOptions): Promise<[Store<G>, SchemaValidationResult]>;
 
-export { type StoreProjection as $, type AliasMap as A, type BatchResults as B, type CreateQueryBuilderOptions as C, type DynamicEdgeCollection as D, type EdgeAliasMap as E, type FieldAccessor as F, type GetOrCreateAction as G, type HookContext as H, type IfExistsMode as I, type PaginatedResult as J, type Predicate as K, PreparedQuery as L, type PropsAccessor as M, type Node as N, type OperationHookContext as O, type PaginateOptions as P, QueryBuilder as Q, type QueryHookContext as R, type QueryOptions as S, TraversalBuilder as T, type RecursiveTraversalOptions as U, type SelectContext as V, type SelectableEdge as W, type SelectableNode as X, Store as Y, type StoreHooks as Z, type StoreOptions as _, type AggregateResult as a, type StreamOptions as a0, type SubgraphOptions as a1, type SubgraphResult as a2, type SubsetEdge as a3, type SubsetNode as a4, type TransactionContext as a5, type TypedEdgeCollection as a6, UnionableQuery as a7, type UpdateEdgeInput as a8, type UpdateNodeInput as a9, createStore as aa, createStoreWithSchema as ab, defineSubgraphProject as ac, embedding as ad, exists as ae, fieldRef as af, getEmbeddingDimensions as ag, inSubquery as ah, isEmbeddingSchema as ai, isParameterRef as aj, notExists as ak, notInSubquery as al, param as am, type AnyEdge as b, type AnyNode as c, type BatchableQuery as d, type ConstraintNames as e, type CreateEdgeInput as f, type CreateNodeInput as g, type DynamicNodeCollection as h, type Edge as i, type EdgeAccessor as j, type EdgeCollection as k, type EdgeFindByEndpointsOptions as l, type EdgeGetOrCreateByEndpointsOptions as m, type EdgeGetOrCreateByEndpointsResult as n, type EmbeddingSchema as o, type EmbeddingValue as p, ExecutableAggregateQuery as q, ExecutableQuery as r, type GraphEdgeCollections as s, type GraphNodeCollections as t, type NodeAccessor as u, type NodeAlias as v, type NodeCollection as w, type NodeGetOrCreateByConstraintOptions as x, type NodeGetOrCreateByConstraintResult as y, type NodeRef as z };
+export { type StoreProjection as $, type AliasMap as A, type BatchResults as B, type CreateQueryBuilderOptions as C, type DynamicEdgeCollection as D, type EdgeAliasMap as E, type FieldAccessor as F, type GetOrCreateAction as G, type HookContext as H, type IfExistsMode as I, type PaginatedResult as J, type Predicate as K, PreparedQuery as L, type PropsAccessor as M, type Node as N, type OperationHookContext as O, type PaginateOptions as P, QueryBuilder as Q, type QueryHookContext as R, type QueryOptions as S, TraversalBuilder as T, type RecursiveTraversalOptions as U, type SelectContext as V, type SelectableEdge as W, type SelectableNode as X, Store as Y, type StoreHooks as Z, type StoreOptions as _, type AggregateResult as a, type StreamOptions as a0, type SubgraphEdgeResult as a1, type SubgraphNodeResult as a2, type SubgraphOptions as a3, type SubgraphResult as a4, type SubsetEdge as a5, type SubsetNode as a6, type TransactionContext as a7, type TypedEdgeCollection as a8, UnionableQuery as a9, type UpdateEdgeInput as aa, type UpdateNodeInput as ab, createStore as ac, createStoreWithSchema as ad, defineSubgraphProject as ae, embedding as af, exists as ag, fieldRef as ah, getEmbeddingDimensions as ai, inSubquery as aj, isEmbeddingSchema as ak, isParameterRef as al, notExists as am, notInSubquery as an, param as ao, type AnyEdge as b, type AnyNode as c, type BatchableQuery as d, type ConstraintNames as e, type CreateEdgeInput as f, type CreateNodeInput as g, type DynamicNodeCollection as h, type Edge as i, type EdgeAccessor as j, type EdgeCollection as k, type EdgeFindByEndpointsOptions as l, type EdgeGetOrCreateByEndpointsOptions as m, type EdgeGetOrCreateByEndpointsResult as n, type EmbeddingSchema as o, type EmbeddingValue as p, ExecutableAggregateQuery as q, ExecutableQuery as r, type GraphEdgeCollections as s, type GraphNodeCollections as t, type NodeAccessor as u, type NodeAlias as v, type NodeCollection as w, type NodeGetOrCreateByConstraintOptions as x, type NodeGetOrCreateByConstraintResult as y, type NodeRef as z };

package/dist/{store-DkY1pDfu.d.ts → store-CCOwNft_.d.ts}

@@ -1497,13 +1497,26 @@ type SubgraphOptions<G extends GraphDef, EK extends EdgeKinds<G>, NK extends Nod
      */
     project?: P;
 }>;
+/**
+ * Union of all node result types in a subgraph, respecting projection.
+ */
+type SubgraphNodeResult<G extends GraphDef, NK extends NodeKinds<G> = NodeKinds<G>, P = undefined> = {
+    [Kind in NK]: SubgraphNodeResultForKind<G, Kind, P>;
+}[NK];
+/**
+ * Union of all edge result types in a subgraph, respecting projection.
+ */
+type SubgraphEdgeResult<G extends GraphDef, EK extends EdgeKinds<G> = EdgeKinds<G>, P = undefined> = {
+    [Kind in EK]: SubgraphEdgeResultForKind<G, Kind, P>;
+}[EK];
 type SubgraphResult<G extends GraphDef, NK extends NodeKinds<G> = NodeKinds<G>, EK extends EdgeKinds<G> = EdgeKinds<G>, P extends SubgraphProject<G, NK, EK> | undefined = undefined> = Readonly<{
-    nodes: readonly {
-        [Kind in NK]: SubgraphNodeResultForKind<G, Kind, P>;
-    }[NK][];
-    edges: readonly {
-        [Kind in EK]: SubgraphEdgeResultForKind<G, Kind, P>;
-    }[EK][];
+    /** The root node, or undefined if the root was not found or excluded. */
+    root: SubgraphNodeResult<G, NK, P> | undefined;
+    nodes: ReadonlyMap<string, SubgraphNodeResult<G, NK, P>>;
+    /** Forward adjacency: fromId → edgeKind → edges to targets. */
+    adjacency: ReadonlyMap<string, ReadonlyMap<EK, readonly SubgraphEdgeResult<G, EK, P>[]>>;
+    /** Reverse adjacency: toId → edgeKind → edges from sources. */
+    reverseAdjacency: ReadonlyMap<string, ReadonlyMap<EK, readonly SubgraphEdgeResult<G, EK, P>[]>>;
 }>;
 
 /**
@@ -2216,22 +2229,26 @@ declare class Store<G extends GraphDef> {
      * Extracts a typed subgraph by traversing from a root node.
      *
      * Performs a BFS traversal from `rootId` following the specified edge kinds,
-     * then returns all reachable nodes and the edges connecting them.
+     * returning an indexed result with adjacency maps for immediate traversal.
      *
      * @example
      * ```typescript
-     * const result = await store.subgraph(run.id, {
+     * const sg = await store.subgraph(run.id, {
      *   edges: ["has_task", "runs_agent", "uses_skill"],
      *   maxDepth: 4,
-     *   includeKinds: ["Run", "Task", "Agent", "Skill"],
      * });
      *
-     * for (const node of result.nodes) {
-     *   switch (node.kind) {
-     *     case "Task": console.log(node.name); break;
-     *     case "Agent": console.log(node.model); break;
-     *   }
-     * }
+     * // Root node (the traversal starting point)
+     * console.log(sg.root?.kind);
+     *
+     * // Lookup by ID
+     * const task = sg.nodes.get(taskId);
+     *
+     * // Forward adjacency: edges of a kind from a node
+     * const taskEdges = sg.adjacency.get(run.id)?.get("has_task") ?? [];
+     *
+     * // Reverse adjacency: edges of a kind pointing to a node
+     * const parentEdges = sg.reverseAdjacency.get(taskId)?.get("has_task") ?? [];
      * ```
      */
     subgraph<const EK extends EdgeKinds<G>, const NK extends NodeKinds<G> = NodeKinds<G>, const P extends SubgraphProject<G, NK, EK> | undefined = undefined>(rootId: NodeId<AllNodeTypes<G>>, options: SubgraphOptions<G, EK, NK, P>): Promise<SubgraphResult<G, NK, EK, P>>;
@@ -2337,4 +2354,4 @@ declare function createStore<G extends GraphDef>(graph: G, backend: GraphBackend
  */
 declare function createStoreWithSchema<G extends GraphDef>(graph: G, backend: GraphBackend, options?: StoreOptions & SchemaManagerOptions): Promise<[Store<G>, SchemaValidationResult]>;
 
-export { type StoreProjection as $, type AliasMap as A, type BatchResults as B, type CreateQueryBuilderOptions as C, type DynamicEdgeCollection as D, type EdgeAliasMap as E, type FieldAccessor as F, type GetOrCreateAction as G, type HookContext as H, type IfExistsMode as I, type PaginatedResult as J, type Predicate as K, PreparedQuery as L, type PropsAccessor as M, type Node as N, type OperationHookContext as O, type PaginateOptions as P, QueryBuilder as Q, type QueryHookContext as R, type QueryOptions as S, TraversalBuilder as T, type RecursiveTraversalOptions as U, type SelectContext as V, type SelectableEdge as W, type SelectableNode as X, Store as Y, type StoreHooks as Z, type StoreOptions as _, type AggregateResult as a, type StreamOptions as a0, type SubgraphOptions as a1, type SubgraphResult as a2, type SubsetEdge as a3, type SubsetNode as a4, type TransactionContext as a5, type TypedEdgeCollection as a6, UnionableQuery as a7, type UpdateEdgeInput as a8, type UpdateNodeInput as a9, createStore as aa, createStoreWithSchema as ab, defineSubgraphProject as ac, embedding as ad, exists as ae, fieldRef as af, getEmbeddingDimensions as ag, inSubquery as ah, isEmbeddingSchema as ai, isParameterRef as aj, notExists as ak, notInSubquery as al, param as am, type AnyEdge as b, type AnyNode as c, type BatchableQuery as d, type ConstraintNames as e, type CreateEdgeInput as f, type CreateNodeInput as g, type DynamicNodeCollection as h, type Edge as i, type EdgeAccessor as j, type EdgeCollection as k, type EdgeFindByEndpointsOptions as l, type EdgeGetOrCreateByEndpointsOptions as m, type EdgeGetOrCreateByEndpointsResult as n, type EmbeddingSchema as o, type EmbeddingValue as p, ExecutableAggregateQuery as q, ExecutableQuery as r, type GraphEdgeCollections as s, type GraphNodeCollections as t, type NodeAccessor as u, type NodeAlias as v, type NodeCollection as w, type NodeGetOrCreateByConstraintOptions as x, type NodeGetOrCreateByConstraintResult as y, type NodeRef as z };
+export { type StoreProjection as $, type AliasMap as A, type BatchResults as B, type CreateQueryBuilderOptions as C, type DynamicEdgeCollection as D, type EdgeAliasMap as E, type FieldAccessor as F, type GetOrCreateAction as G, type HookContext as H, type IfExistsMode as I, type PaginatedResult as J, type Predicate as K, PreparedQuery as L, type PropsAccessor as M, type Node as N, type OperationHookContext as O, type PaginateOptions as P, QueryBuilder as Q, type QueryHookContext as R, type QueryOptions as S, TraversalBuilder as T, type RecursiveTraversalOptions as U, type SelectContext as V, type SelectableEdge as W, type SelectableNode as X, Store as Y, type StoreHooks as Z, type StoreOptions as _, type AggregateResult as a, type StreamOptions as a0, type SubgraphEdgeResult as a1, type SubgraphNodeResult as a2, type SubgraphOptions as a3, type SubgraphResult as a4, type SubsetEdge as a5, type SubsetNode as a6, type TransactionContext as a7, type TypedEdgeCollection as a8, UnionableQuery as a9, type UpdateEdgeInput as aa, type UpdateNodeInput as ab, createStore as ac, createStoreWithSchema as ad, defineSubgraphProject as ae, embedding as af, exists as ag, fieldRef as ah, getEmbeddingDimensions as ai, inSubquery as aj, isEmbeddingSchema as ak, isParameterRef as al, notExists as am, notInSubquery as an, param as ao, type AnyEdge as b, type AnyNode as c, type BatchableQuery as d, type ConstraintNames as e, type CreateEdgeInput as f, type CreateNodeInput as g, type DynamicNodeCollection as h, type Edge as i, type EdgeAccessor as j, type EdgeCollection as k, type EdgeFindByEndpointsOptions as l, type EdgeGetOrCreateByEndpointsOptions as m, type EdgeGetOrCreateByEndpointsResult as n, type EmbeddingSchema as o, type EmbeddingValue as p, ExecutableAggregateQuery as q, ExecutableQuery as r, type GraphEdgeCollections as s, type GraphNodeCollections as t, type NodeAccessor as u, type NodeAlias as v, type NodeCollection as w, type NodeGetOrCreateByConstraintOptions as x, type NodeGetOrCreateByConstraintResult as y, type NodeRef as z };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@nicia-ai/typegraph",
-  "version": "0.17.0",
+  "version": "0.19.0",
   "description": "TypeScript-first embedded knowledge graph library with ontological reasoning",
   "type": "module",
   "main": "./dist/index.cjs",
@@ -86,6 +86,16 @@
         "types": "./dist/backend/sqlite/local.d.cts",
         "default": "./dist/backend/sqlite/local.cjs"
       }
+    },
+    "./sqlite/libsql": {
+      "import": {
+        "types": "./dist/backend/sqlite/libsql.d.ts",
+        "default": "./dist/backend/sqlite/libsql.js"
+      },
+      "require": {
+        "types": "./dist/backend/sqlite/libsql.d.cts",
+        "default": "./dist/backend/sqlite/libsql.cjs"
+      }
     }
   },
   "files": [
@@ -122,11 +132,15 @@
     "node": ">=22"
   },
   "peerDependencies": {
+    "@libsql/client": ">=0.6.0",
     "better-sqlite3": ">=9.0.0 <13.0.0",
     "drizzle-orm": ">=0.35.0 <1.0.0",
     "zod": "^4.0.0"
   },
   "peerDependenciesMeta": {
+    "@libsql/client": {
+      "optional": true
+    },
     "better-sqlite3": {
       "optional": true
     }
@@ -135,6 +149,7 @@
     "nanoid": "^5.1.7"
   },
   "devDependencies": {
+    "@libsql/client": "^0.17.2",
     "@stryker-mutator/core": "^9.6.0",
     "@stryker-mutator/vitest-runner": "^9.6.0",
     "@types/better-sqlite3": "^7.6.13",