@nicia-ai/typegraph 0.18.0 → 0.19.0

package/dist/index.d.cts

@@ -3,8 +3,8 @@ import { N as NodeType, E as EdgeType } from './types-DMzKq0d5.cjs';
 export { A as AnyEdgeType, C as Cardinality, a as Collation, D as DeleteBehavior, b as EdgeId, c as EdgeProps, d as EdgeRegistration, e as EdgeTypeWithEndpoints, f as EndpointExistence, G as GraphDefaults, g as NodeId, h as NodeProps, i as NodeRegistration, S as SqlDialect, T as TemporalMode, U as UniqueConstraint, j as UniquenessScope, k as isEdgeType, l as isEdgeTypeWithEndpoints, m as isNodeType } from './types-DMzKq0d5.cjs';
 import { I as InferenceType, M as MetaEdge, O as OntologyRelation } from './types-B3mmOMJV.cjs';
 export { D as DEFAULT_SQL_SCHEMA, G as GraphBackend, a as MetaEdgeProperties, S as SqlSchema, b as SqlTableNames, T as TransactionBackend, c as createSqlSchema, i as isMetaEdge } from './types-B3mmOMJV.cjs';
-import { A as AliasMap, E as EdgeAliasMap, Q as QueryBuilder, T as TraversalBuilder, C as CreateQueryBuilderOptions } from './store-B_JzzHwb.cjs';
-export { a as AggregateResult, b as AnyEdge, c as AnyNode, B as BatchResults, d as BatchableQuery, e as ConstraintNames, f as CreateEdgeInput, g as CreateNodeInput, D as DynamicEdgeCollection, h as DynamicNodeCollection, i as Edge, j as EdgeAccessor, k as EdgeCollection, l as EdgeFindByEndpointsOptions, m as EdgeGetOrCreateByEndpointsOptions, n as EdgeGetOrCreateByEndpointsResult, o as EmbeddingSchema, p as EmbeddingValue, q as ExecutableAggregateQuery, r as ExecutableQuery, F as FieldAccessor, G as GetOrCreateAction, s as GraphEdgeCollections, t as GraphNodeCollections, H as HookContext, I as IfExistsMode, N as Node, u as NodeAccessor, v as NodeAlias, w as NodeCollection, x as NodeGetOrCreateByConstraintOptions, y as NodeGetOrCreateByConstraintResult, z as NodeRef, O as OperationHookContext, P as PaginateOptions, J as PaginatedResult, K as Predicate, L as PreparedQuery, M as PropsAccessor, R as QueryHookContext, S as QueryOptions, U as RecursiveTraversalOptions, V as SelectContext, W as SelectableEdge, X as SelectableNode, Y as Store, Z as StoreHooks, _ as StoreOptions, $ as StoreProjection, a0 as StreamOptions, a1 as SubgraphOptions, a2 as SubgraphResult, a3 as SubsetEdge, a4 as SubsetNode, a5 as TransactionContext, a6 as TypedEdgeCollection, a7 as UnionableQuery, a8 as UpdateEdgeInput, a9 as UpdateNodeInput, aa as createStore, ab as createStoreWithSchema, ac as defineSubgraphProject, ad as embedding, ae as exists, af as fieldRef, ag as getEmbeddingDimensions, ah as inSubquery, ai as isEmbeddingSchema, aj as isParameterRef, ak as notExists, al as notInSubquery, am as param } from './store-B_JzzHwb.cjs';
+import { A as AliasMap, E as EdgeAliasMap, Q as QueryBuilder, T as TraversalBuilder, C as CreateQueryBuilderOptions } from './store-BnUu4qo5.cjs';
+export { a as AggregateResult, b as AnyEdge, c as AnyNode, B as BatchResults, d as BatchableQuery, e as ConstraintNames, f as CreateEdgeInput, g as CreateNodeInput, D as DynamicEdgeCollection, h as DynamicNodeCollection, i as Edge, j as EdgeAccessor, k as EdgeCollection, l as EdgeFindByEndpointsOptions, m as EdgeGetOrCreateByEndpointsOptions, n as EdgeGetOrCreateByEndpointsResult, o as EmbeddingSchema, p as EmbeddingValue, q as ExecutableAggregateQuery, r as ExecutableQuery, F as FieldAccessor, G as GetOrCreateAction, s as GraphEdgeCollections, t as GraphNodeCollections, H as HookContext, I as IfExistsMode, N as Node, u as NodeAccessor, v as NodeAlias, w as NodeCollection, x as NodeGetOrCreateByConstraintOptions, y as NodeGetOrCreateByConstraintResult, z as NodeRef, O as OperationHookContext, P as PaginateOptions, J as PaginatedResult, K as Predicate, L as PreparedQuery, M as PropsAccessor, R as QueryHookContext, S as QueryOptions, U as RecursiveTraversalOptions, V as SelectContext, W as SelectableEdge, X as SelectableNode, Y as Store, Z as StoreHooks, _ as StoreOptions, $ as StoreProjection, a0 as StreamOptions, a1 as SubgraphEdgeResult, a2 as SubgraphNodeResult, a3 as SubgraphOptions, a4 as SubgraphResult, a5 as SubsetEdge, a6 as SubsetNode, a7 as TransactionContext, a8 as TypedEdgeCollection, a9 as UnionableQuery, aa as UpdateEdgeInput, ab as UpdateNodeInput, ac as createStore, ad as createStoreWithSchema, ae as defineSubgraphProject, af as embedding, ag as exists, ah as fieldRef, ai as getEmbeddingDimensions, aj as inSubquery, ak as isEmbeddingSchema, al as isParameterRef, am as notExists, an as notInSubquery, ao as param } from './store-BnUu4qo5.cjs';
 import { G as GraphDef, K as KindRegistry } from './manager-Bj1UEnhE.cjs';
 export { A as AllEdgeTypes, a as AllNodeTypes, E as EdgeKinds, b as GetEdgeType, c as GetNodeType, N as NodeKinds, S as SchemaManagerOptions, d as SchemaValidationResult, e as defineGraph, g as getEdgeKinds, f as getNodeKinds, i as isGraphDef } from './manager-Bj1UEnhE.cjs';
 export { B as BackendDisposedError, C as CardinalityError, a as CompilerInvariantError, b as ConfigurationError, D as DatabaseOperationError, c as DisjointError, E as EdgeNotFoundError, d as EndpointError, e as EndpointNotFoundError, f as ErrorCategory, K as KindNotFoundError, M as MigrationError, N as NodeConstraintNotFoundError, g as NodeNotFoundError, R as RestrictedDeleteError, S as SchemaMismatchError, T as TypeGraphError, h as TypeGraphErrorOptions, U as UniquenessError, i as UnsupportedPredicateError, V as ValidationError, j as ValidationErrorDetails, k as ValidationIssue, l as VersionConflictError, m as getErrorSuggestion, n as isConstraintError, o as isSystemError, p as isTypeGraphError, q as isUserRecoverable } from './index-DXkEXpNz.cjs';

package/dist/index.d.ts

@@ -3,8 +3,8 @@ import { N as NodeType, E as EdgeType } from './types-DMzKq0d5.js';
 export { A as AnyEdgeType, C as Cardinality, a as Collation, D as DeleteBehavior, b as EdgeId, c as EdgeProps, d as EdgeRegistration, e as EdgeTypeWithEndpoints, f as EndpointExistence, G as GraphDefaults, g as NodeId, h as NodeProps, i as NodeRegistration, S as SqlDialect, T as TemporalMode, U as UniqueConstraint, j as UniquenessScope, k as isEdgeType, l as isEdgeTypeWithEndpoints, m as isNodeType } from './types-DMzKq0d5.js';
 import { I as InferenceType, M as MetaEdge, O as OntologyRelation } from './types-ThB4cFLp.js';
 export { D as DEFAULT_SQL_SCHEMA, G as GraphBackend, a as MetaEdgeProperties, S as SqlSchema, b as SqlTableNames, T as TransactionBackend, c as createSqlSchema, i as isMetaEdge } from './types-ThB4cFLp.js';
-import { A as AliasMap, E as EdgeAliasMap, Q as QueryBuilder, T as TraversalBuilder, C as CreateQueryBuilderOptions } from './store-DkY1pDfu.js';
-export { a as AggregateResult, b as AnyEdge, c as AnyNode, B as BatchResults, d as BatchableQuery, e as ConstraintNames, f as CreateEdgeInput, g as CreateNodeInput, D as DynamicEdgeCollection, h as DynamicNodeCollection, i as Edge, j as EdgeAccessor, k as EdgeCollection, l as EdgeFindByEndpointsOptions, m as EdgeGetOrCreateByEndpointsOptions, n as EdgeGetOrCreateByEndpointsResult, o as EmbeddingSchema, p as EmbeddingValue, q as ExecutableAggregateQuery, r as ExecutableQuery, F as FieldAccessor, G as GetOrCreateAction, s as GraphEdgeCollections, t as GraphNodeCollections, H as HookContext, I as IfExistsMode, N as Node, u as NodeAccessor, v as NodeAlias, w as NodeCollection, x as NodeGetOrCreateByConstraintOptions, y as NodeGetOrCreateByConstraintResult, z as NodeRef, O as OperationHookContext, P as PaginateOptions, J as PaginatedResult, K as Predicate, L as PreparedQuery, M as PropsAccessor, R as QueryHookContext, S as QueryOptions, U as RecursiveTraversalOptions, V as SelectContext, W as SelectableEdge, X as SelectableNode, Y as Store, Z as StoreHooks, _ as StoreOptions, $ as StoreProjection, a0 as StreamOptions, a1 as SubgraphOptions, a2 as SubgraphResult, a3 as SubsetEdge, a4 as SubsetNode, a5 as TransactionContext, a6 as TypedEdgeCollection, a7 as UnionableQuery, a8 as UpdateEdgeInput, a9 as UpdateNodeInput, aa as createStore, ab as createStoreWithSchema, ac as defineSubgraphProject, ad as embedding, ae as exists, af as fieldRef, ag as getEmbeddingDimensions, ah as inSubquery, ai as isEmbeddingSchema, aj as isParameterRef, ak as notExists, al as notInSubquery, am as param } from './store-DkY1pDfu.js';
+import { A as AliasMap, E as EdgeAliasMap, Q as QueryBuilder, T as TraversalBuilder, C as CreateQueryBuilderOptions } from './store-CCOwNft_.js';
+export { a as AggregateResult, b as AnyEdge, c as AnyNode, B as BatchResults, d as BatchableQuery, e as ConstraintNames, f as CreateEdgeInput, g as CreateNodeInput, D as DynamicEdgeCollection, h as DynamicNodeCollection, i as Edge, j as EdgeAccessor, k as EdgeCollection, l as EdgeFindByEndpointsOptions, m as EdgeGetOrCreateByEndpointsOptions, n as EdgeGetOrCreateByEndpointsResult, o as EmbeddingSchema, p as EmbeddingValue, q as ExecutableAggregateQuery, r as ExecutableQuery, F as FieldAccessor, G as GetOrCreateAction, s as GraphEdgeCollections, t as GraphNodeCollections, H as HookContext, I as IfExistsMode, N as Node, u as NodeAccessor, v as NodeAlias, w as NodeCollection, x as NodeGetOrCreateByConstraintOptions, y as NodeGetOrCreateByConstraintResult, z as NodeRef, O as OperationHookContext, P as PaginateOptions, J as PaginatedResult, K as Predicate, L as PreparedQuery, M as PropsAccessor, R as QueryHookContext, S as QueryOptions, U as RecursiveTraversalOptions, V as SelectContext, W as SelectableEdge, X as SelectableNode, Y as Store, Z as StoreHooks, _ as StoreOptions, $ as StoreProjection, a0 as StreamOptions, a1 as SubgraphEdgeResult, a2 as SubgraphNodeResult, a3 as SubgraphOptions, a4 as SubgraphResult, a5 as SubsetEdge, a6 as SubsetNode, a7 as TransactionContext, a8 as TypedEdgeCollection, a9 as UnionableQuery, aa as UpdateEdgeInput, ab as UpdateNodeInput, ac as createStore, ad as createStoreWithSchema, ae as defineSubgraphProject, af as embedding, ag as exists, ah as fieldRef, ai as getEmbeddingDimensions, aj as inSubquery, ak as isEmbeddingSchema, al as isParameterRef, am as notExists, an as notInSubquery, ao as param } from './store-CCOwNft_.js';
 import { G as GraphDef, K as KindRegistry } from './manager-Chhrq1vl.js';
 export { A as AllEdgeTypes, a as AllNodeTypes, E as EdgeKinds, b as GetEdgeType, c as GetNodeType, N as NodeKinds, S as SchemaManagerOptions, d as SchemaValidationResult, e as defineGraph, g as getEdgeKinds, f as getNodeKinds, i as isGraphDef } from './manager-Chhrq1vl.js';
 export { B as BackendDisposedError, C as CardinalityError, a as CompilerInvariantError, b as ConfigurationError, D as DatabaseOperationError, c as DisjointError, E as EdgeNotFoundError, d as EndpointError, e as EndpointNotFoundError, f as ErrorCategory, K as KindNotFoundError, M as MigrationError, N as NodeConstraintNotFoundError, g as NodeNotFoundError, R as RestrictedDeleteError, S as SchemaMismatchError, T as TypeGraphError, h as TypeGraphErrorOptions, U as UniquenessError, i as UnsupportedPredicateError, V as ValidationError, j as ValidationErrorDetails, k as ValidationIssue, l as VersionConflictError, m as getErrorSuggestion, n as isConstraintError, o as isSystemError, p as isTypeGraphError, q as isUserRecoverable } from './index-DXkEXpNz.js';

package/dist/index.js

@@ -3528,9 +3528,6 @@ function defineSubgraphProject(_graph) {
 }
 async function executeSubgraph(params) {
   const { options } = params;
-  if (options.edges.length === 0) {
-    return { nodes: [], edges: [] };
-  }
   const maxDepth = Math.min(
     options.maxDepth ?? DEFAULT_SUBGRAPH_MAX_DEPTH,
     MAX_EXPLICIT_RECURSIVE_DEPTH
@@ -3567,15 +3564,29 @@ async function executeSubgraph(params) {
     fetchSubgraphNodes(ctx, reachableCte, includedIdsCte, nodeProjectionPlan),
     fetchSubgraphEdges(ctx, reachableCte, includedIdsCte, edgeProjectionPlan)
   ]);
-  const nodes = nodeRows.map(
-    (row) => mapSubgraphNodeRow(row, nodeProjectionPlan)
-  );
-  const edges = edgeRows.map(
-    (row) => mapSubgraphEdgeRow(row, edgeProjectionPlan)
-  );
+  const nodesMap = /* @__PURE__ */ new Map();
+  for (const row of nodeRows) {
+    const node = mapSubgraphNodeRow(row, nodeProjectionPlan);
+    nodesMap.set(node.id, node);
+  }
+  const adjacency = /* @__PURE__ */ new Map();
+  const reverseAdjacency = /* @__PURE__ */ new Map();
+  for (const row of edgeRows) {
+    const edge = mapSubgraphEdgeRow(row, edgeProjectionPlan);
+    insertAdjacencyEntry(adjacency, edge.fromId, edge.kind, edge);
+    insertAdjacencyEntry(
+      reverseAdjacency,
+      edge.toId,
+      edge.kind,
+      edge
+    );
+  }
+  const root = nodesMap.get(ctx.rootId);
   return {
-    nodes,
-    edges
+    root,
+    nodes: nodesMap,
+    adjacency,
+    reverseAdjacency
   };
 }
 var introspectorCache = /* @__PURE__ */ new WeakMap();
@@ -3815,6 +3826,19 @@ function buildProjectedPropertyColumns(alias, plan, dialect) {
   }
   return columns;
 }
+function insertAdjacencyEntry(index, nodeId, edgeKind, edge) {
+  let kindMap = index.get(nodeId);
+  if (kindMap === void 0) {
+    kindMap = /* @__PURE__ */ new Map();
+    index.set(nodeId, kindMap);
+  }
+  const edges = kindMap.get(edgeKind);
+  if (edges === void 0) {
+    kindMap.set(edgeKind, [edge]);
+  } else {
+    edges.push(edge);
+  }
+}
 function applyProjectedFields(target, row, kindPlan) {
   for (const fieldPlan of kindPlan.propertyFields) {
     target[fieldPlan.field] = decodeSelectedValue(
@@ -11926,22 +11950,26 @@ var Store = class {
    * 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") ?? [];
    * ```
    */
   async subgraph(rootId, options) {