@dxos/app-graph 0.5.9-next.a50ff17 → 0.6.0

package/dist/lib/browser/index.mjs

@@ -69,7 +69,7 @@ var Graph = class {
   * Convert the graph to a JSON object.
   */
   toJSON({ id = ROOT_ID, maxLength = 32 } = {}) {
-    const toJSON = (node) => {
+    const toJSON = (node, seen = []) => {
       const nodes = node.nodes();
       const obj = {
         id: node.id.length > maxLength ? `${node.id.slice(0, maxLength - 3)}...` : node.id
@@ -78,14 +78,20 @@ var Graph = class {
         obj.label = node.properties.label;
       }
       if (nodes.length) {
-        obj.nodes = nodes.map((node2) => toJSON(node2));
+        obj.nodes = nodes.map((n) => {
+          const nextSeen = [
+            ...seen,
+            node.id
+          ];
+          return nextSeen.includes(n.id) ? void 0 : toJSON(n, nextSeen);
+        }).filter(nonNullable);
       }
       return obj;
     };
     const root = this.findNode(id);
     invariant(root, `Node not found: ${id}`, {
       F: __dxlog_file,
-      L: 85,
+      L: 91,
       S: this,
       A: [
         "root",

package/dist/lib/browser/index.mjs.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/graph.ts", "../../../src/node.ts", "../../../src/graph-builder.ts", "../../../src/helpers.ts"],
-  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport { untracked } from '@preact/signals-core';\n\nimport { create } from '@dxos/echo-schema';\nimport { invariant } from '@dxos/invariant';\nimport { nonNullable } from '@dxos/util';\n\nimport { isActionLike, type EdgeDirection, type Node, type NodeArg, type NodeBase } from './node';\n\nexport const ROOT_ID = 'root';\n\nexport type TraversalOptions = {\n  /**\n   * The node to start traversing from.\n   *\n   * @default root\n   */\n  node?: Node;\n\n  /**\n   * The direction to traverse graph edges.\n   *\n   * @default 'outbound'\n   */\n  direction?: EdgeDirection;\n\n  /**\n   * A predicate to filter nodes which are passed to the `visitor` callback.\n   */\n  filter?: (node: Node) => boolean;\n\n  /**\n   * A callback which is called for each node visited during traversal.\n   */\n  visitor?: (node: Node, path: string[]) => void;\n};\n\n/**\n * The Graph represents the structure of the application constructed via plugins.\n */\nexport class Graph {\n  /**\n   * @internal\n   */\n  readonly _nodes = create<Record<string, NodeBase>>({\n    [ROOT_ID]: { id: ROOT_ID, properties: {}, data: null },\n  });\n\n  /**\n   * @internal\n   */\n  // Key is the `${node.id}-${direction}` and value is an ordered list of node ids.\n  // Explicit type required because TS says this is not portable.\n  readonly _edges = create<Record<string, string[]>>({});\n\n  /**\n   * Alias for `findNode('root')`.\n   */\n  get root() {\n    return this.findNode(ROOT_ID)!;\n  }\n\n  /**\n   * Convert the graph to a JSON object.\n   */\n  toJSON({ id = ROOT_ID, maxLength = 32 }: { id?: string; maxLength?: number } = {}) {\n    const toJSON = (node: Node): any => {\n      const nodes = node.nodes();\n      const obj: Record<string, any> = {\n        id: node.id.length > maxLength ? `${node.id.slice(0, maxLength - 3)}...` : node.id,\n      };\n      if (node.properties.label) {\n        obj.label = node.properties.label;\n      }\n      if (nodes.length) {\n        obj.nodes = nodes.map((node) => toJSON(node));\n      }\n      return obj;\n    };\n\n    const root = this.findNode(id);\n    invariant(root, `Node not found: ${id}`);\n    return toJSON(root);\n  }\n\n  /**\n   * Find the node with the given id in the graph.\n   */\n  findNode(id: string): Node | undefined {\n    const nodeBase = this._nodes[id];\n    if (!nodeBase) {\n      return undefined;\n    }\n\n    return this._constructNode(nodeBase);\n  }\n\n  private _constructNode = (nodeBase: NodeBase): Node => {\n    const node: Node = {\n      ...nodeBase,\n      edges: ({ direction = 'outbound' } = {}) => {\n        return this._edges[this.getEdgeKey(node.id, direction)];\n      },\n      nodes: ({ direction, filter } = {}) => {\n        const nodes = this._getNodes({ id: node.id, direction }).filter((n) => !isActionLike(n));\n        return filter ? nodes.filter((n) => filter(n, node)) : nodes;\n      },\n      node: (id: string) => {\n        return this._getNodes({ id }).find((node) => node.id === id);\n      },\n      actions: () => {\n        return this._getNodes({ id: node.id }).filter(isActionLike);\n      },\n    };\n\n    return node;\n  };\n\n  private _getNodes({ id, direction = 'outbound' }: { id: string; direction?: EdgeDirection }): Node[] {\n    const edges = this._edges[this.getEdgeKey(id, direction)];\n    if (!edges) {\n      return [];\n    }\n\n    return edges.map((id) => this.findNode(id)).filter(nonNullable);\n  }\n\n  private getEdgeKey(id: string, direction: EdgeDirection) {\n    return `${id}-${direction}`;\n  }\n\n  /**\n   * Add nodes to the graph.\n   */\n  addNodes<TData = null, TProperties extends Record<string, any> = Record<string, any>>(\n    ...nodes: NodeArg<TData, TProperties>[]\n  ): Node<TData, TProperties>[] {\n    return nodes.map((node) => this._addNode(node));\n  }\n\n  private _addNode<TData, TProperties extends Record<string, any> = Record<string, any>>({\n    nodes,\n    edges,\n    ..._node\n  }: NodeArg<TData, TProperties>): Node<TData, TProperties> {\n    return untracked(() => {\n      const node = { data: null, properties: {}, ..._node };\n      this._nodes[node.id] = node;\n\n      if (nodes) {\n        nodes.forEach((subNode) => {\n          this._addNode(subNode);\n          this.addEdge({ source: node.id, target: subNode.id });\n        });\n      }\n\n      if (edges) {\n        edges.forEach(([id, direction]) =>\n          direction === 'outbound'\n            ? this.addEdge({ source: node.id, target: id })\n            : this.addEdge({ source: id, target: node.id }),\n        );\n      }\n\n      return this._constructNode(node) as Node<TData, TProperties>;\n    });\n  }\n\n  /**\n   * Remove nodes from the graph.\n   *\n   * @param id The id of the node to remove.\n   * @param edges Whether to remove edges connected to the node from the graph as well.\n   */\n  removeNode(id: string, edges = false) {\n    untracked(() => {\n      const node = this.findNode(id);\n      if (!node) {\n        return;\n      }\n\n      if (edges) {\n        // Remove edges from node.\n        delete this._edges[this.getEdgeKey(id, 'outbound')];\n        delete this._edges[this.getEdgeKey(id, 'inbound')];\n\n        // Remove edges from connected nodes.\n        this._getNodes({ id }).forEach((node) => this.removeEdge({ source: id, target: node.id }));\n        this._getNodes({ id, direction: 'inbound' }).forEach((node) =>\n          this.removeEdge({ source: node.id, target: id }),\n        );\n      }\n\n      // Remove node.\n      delete this._nodes[id];\n    });\n  }\n\n  /**\n   * Add an edge to the graph.\n   */\n  addEdge({ source, target }: { source: string; target: string }) {\n    untracked(() => {\n      const outbound = this._edges[this.getEdgeKey(source, 'outbound')];\n      if (!outbound) {\n        this._edges[this.getEdgeKey(source, 'outbound')] = [target];\n      } else if (!outbound.includes(target)) {\n        outbound.push(target);\n      }\n\n      const inbound = this._edges[this.getEdgeKey(target, 'inbound')];\n      if (!inbound) {\n        this._edges[this.getEdgeKey(target, 'inbound')] = [source];\n      } else if (!inbound.includes(source)) {\n        inbound.push(source);\n      }\n    });\n  }\n\n  /**\n   * Sort edges for a node.\n   *\n   * Edges not included in the sorted list are appended to the end of the list.\n   *\n   * @param nodeId The id of the node to sort edges for.\n   * @param direction The direction of the edges from the node to sort.\n   * @param edges The ordered list of edges.\n   */\n  sortEdges(nodeId: string, direction: EdgeDirection, edges: string[]) {\n    untracked(() => {\n      const current = this._edges[this.getEdgeKey(nodeId, direction)];\n      if (current) {\n        const unsorted = current.filter((id) => !edges.includes(id)) ?? [];\n        const sorted = edges.filter((id) => current.includes(id)) ?? [];\n        current.splice(0, current.length, ...[...sorted, ...unsorted]);\n      }\n    });\n  }\n\n  /**\n   * Remove an edge from the graph.\n   */\n  removeEdge({ source, target }: { source: string; target: string }) {\n    untracked(() => {\n      const outboundIndex = this._edges[this.getEdgeKey(source, 'outbound')]?.findIndex((id) => id === target);\n      if (outboundIndex !== -1) {\n        this._edges[this.getEdgeKey(source, 'outbound')].splice(outboundIndex, 1);\n      }\n\n      const inboundIndex = this._edges[this.getEdgeKey(target, 'inbound')]?.findIndex((id) => id === source);\n      if (inboundIndex !== -1) {\n        this._edges[this.getEdgeKey(target, 'inbound')].splice(inboundIndex, 1);\n      }\n    });\n  }\n\n  /**\n   * Recursive depth-first traversal.\n   *\n   * @param options.node The node to start traversing from.\n   * @param options.direction The direction to traverse graph edges.\n   * @param options.filter A predicate to filter nodes which are passed to the `visitor` callback.\n   * @param options.visitor A callback which is called for each node visited during traversal.\n   */\n  traverse({ node = this.root, direction = 'outbound', filter, visitor }: TraversalOptions, path: string[] = []): void {\n    // Break cycles.\n    if (path.includes(node.id)) {\n      return;\n    }\n\n    if (!filter || filter(node)) {\n      visitor?.(node, [...path, node.id]);\n    }\n\n    Object.values(this._getNodes({ id: node.id, direction })).forEach((child) =>\n      this.traverse({ node: child, direction, filter, visitor }, [...path, node.id]),\n    );\n  }\n\n  /**\n   * Get the path between two nodes in the graph.\n   */\n  getPath({ source = 'root', target }: { source?: string; target: string }): string[] | undefined {\n    const start = this.findNode(source);\n    if (!start) {\n      return undefined;\n    }\n\n    let found: string[] | undefined;\n    this.traverse({\n      node: start,\n      filter: () => !found,\n      visitor: (node, path) => {\n        if (node.id === target) {\n          found = path;\n        }\n      },\n    });\n\n    return found;\n  }\n}\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { type MaybePromise, type MakeOptional } from '@dxos/util';\n\n/**\n * Represents a node in the graph.\n */\n// TODO(wittjosiah): Use Effect Schema.\nexport type NodeBase<TData = any, TProperties extends Record<string, any> = Record<string, any>> = {\n  /**\n   * Globally unique ID.\n   */\n  id: string;\n\n  /**\n   * Properties of the node relevant to displaying the node.\n   */\n  properties: TProperties;\n\n  /**\n   * Data the node represents.\n   */\n  // TODO(burdon): Type system (e.g., minimally provide identifier string vs. TypedObject vs. Graph mixin type system)?\n  //  type field would prevent convoluted sniffing of object properties. And allow direct pass-through for ECHO TypedObjects.\n  data: TData;\n};\n\nexport type NodeFilter<T = any, U extends Record<string, any> = Record<string, any>> = (\n  node: Node<unknown, Record<string, any>>,\n  connectedNode: Node,\n) => node is Node<T, U>;\n\nexport type EdgeDirection = 'outbound' | 'inbound';\n\nexport type ConnectedNodes = {\n  /**\n   * Edges that this node is connected to in default order.\n   */\n  edges(params?: { direction?: EdgeDirection }): Readonly<string[]>;\n\n  /**\n   * Nodes that this node is connected to in default order.\n   */\n  nodes<T = any, U extends Record<string, any> = Record<string, any>>(params?: {\n    direction?: EdgeDirection;\n    filter?: NodeFilter<T, U>;\n  }): Node<T>[];\n\n  /**\n   * Get a specific connected node by id.\n   */\n  node(id: string): Node | undefined;\n};\n\nexport type ConnectedActions = {\n  /**\n   * Actions or action groups that this node is connected to in default order.\n   */\n  actions(): ActionLike[];\n};\n\nexport type Node<TData = any, TProperties extends Record<string, any> = Record<string, any>> = Readonly<\n  Omit<NodeBase<TData, TProperties>, 'properties'> & { properties: Readonly<TProperties> } & ConnectedNodes &\n    ConnectedActions\n>;\n\nexport const isGraphNode = (data: unknown): data is Node =>\n  data && typeof data === 'object' && 'id' in data && 'properties' in data && data.properties\n    ? typeof data.properties === 'object' && 'data' in data\n    : false;\n\nexport type NodeArg<TData, TProperties extends Record<string, any> = Record<string, any>> = MakeOptional<\n  NodeBase<TData, TProperties>,\n  'data' | 'properties'\n> & {\n  /** Will automatically add nodes with an edge from this node to each. */\n  nodes?: NodeArg<unknown>[];\n\n  /** Will automatically add specified edges. */\n  edges?: [string, EdgeDirection][];\n};\n\n//\n// Actions\n//\n\nexport type InvokeParams = {\n  /** Node the invoked action is connected to. */\n  node: Node;\n\n  caller?: string;\n};\n\nexport type ActionData = (params: InvokeParams) => MaybePromise<void>;\n\nexport type Action<TProperties extends Record<string, any> = Record<string, any>> = Readonly<\n  Omit<NodeBase<ActionData, TProperties>, 'properties'> & {\n    properties: Readonly<TProperties>;\n  } & ConnectedNodes\n>;\n\nexport const isAction = (data: unknown): data is Action =>\n  isGraphNode(data) ? typeof data.data === 'function' : false;\n\nexport const actionGroupSymbol = Symbol('ActionGroup');\n\nexport type ActionGroup = Readonly<\n  Omit<NodeBase<typeof actionGroupSymbol, Record<string, any>>, 'properties'> & {\n    properties: Readonly<Record<string, any>>;\n  } & ConnectedActions\n>;\n\nexport const isActionGroup = (data: unknown): data is ActionGroup =>\n  isGraphNode(data) ? data.data === actionGroupSymbol : false;\n\nexport type ActionLike = Action | ActionGroup;\n\nexport const isActionLike = (data: unknown): data is Action | ActionGroup => isAction(data) || isActionGroup(data);\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { EventSubscriptions, type UnsubscribeCallback } from '@dxos/async';\n\nimport { Graph } from './graph';\n\nexport type BuilderExtension = (graph: Graph) => UnsubscribeCallback | void;\n\n/**\n * The builder provides an extensible way to compose the construction of the graph.\n */\nexport class GraphBuilder {\n  private readonly _extensions = new Map<string, BuilderExtension>();\n  private readonly _unsubscribe = new EventSubscriptions();\n\n  /**\n   * Register a node builder which will be called in order to construct the graph.\n   */\n  addExtension(id: string, extension: BuilderExtension): GraphBuilder {\n    this._extensions.set(id, extension);\n    return this;\n  }\n\n  /**\n   * Remove a node builder from the graph builder.\n   */\n  removeExtension(id: string): GraphBuilder {\n    this._extensions.delete(id);\n    return this;\n  }\n\n  /**\n   * Construct the graph, starting by calling all registered extensions.\n   * @param previousGraph If provided, the graph will be updated in place.\n   */\n  build(previousGraph?: Graph): Graph {\n    // Clear previous extension subscriptions.\n    this._unsubscribe.clear();\n\n    const graph: Graph = previousGraph ?? new Graph();\n\n    Array.from(this._extensions.values()).forEach((builder) => {\n      const unsubscribe = builder(graph);\n      unsubscribe && this._unsubscribe.add(unsubscribe);\n    });\n\n    return graph;\n  }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { type Graph } from './graph';\nimport { type Node, type NodeArg } from './node';\n\n/**\n * If the condition is true, adds the nodes to the graph, otherwise removes the nodes from the graph.\n */\nexport const manageNodes = <TData = null, TProperties extends Record<string, any> = Record<string, any>>({\n  graph,\n  condition,\n  nodes,\n  removeEdges,\n}: {\n  graph: Graph;\n  condition: boolean;\n  nodes: NodeArg<TData, TProperties>[];\n  removeEdges?: boolean;\n}): Node<TData, TProperties>[] | void => {\n  if (condition) {\n    return graph.addNodes(...nodes);\n  } else {\n    nodes.forEach(({ id }) => graph.removeNode(id, removeEdges));\n  }\n};\n"],
-  "mappings": ";AAIA,SAASA,iBAAiB;AAE1B,SAASC,cAAc;AACvB,SAASC,iBAAiB;AAC1B,SAASC,mBAAmB;;;AC4DrB,IAAMC,cAAc,CAACC,SAC1BA,QAAQ,OAAOA,SAAS,YAAY,QAAQA,QAAQ,gBAAgBA,QAAQA,KAAKC,aAC7E,OAAOD,KAAKC,eAAe,YAAY,UAAUD,OACjD;AAgCC,IAAME,WAAW,CAACF,SACvBD,YAAYC,IAAAA,IAAQ,OAAOA,KAAKA,SAAS,aAAa;AAEjD,IAAMG,oBAAoBC,OAAO,aAAA;AAQjC,IAAMC,gBAAgB,CAACL,SAC5BD,YAAYC,IAAAA,IAAQA,KAAKA,SAASG,oBAAoB;AAIjD,IAAMG,eAAe,CAACN,SAAgDE,SAASF,IAAAA,KAASK,cAAcL,IAAAA;;;;AD3GtG,IAAMO,UAAU;AA+BhB,IAAMC,QAAN,MAAMA;EAAN;AAIIC;;;kBAASC,OAAiC;MACjD,CAACH,OAAAA,GAAU;QAAEI,IAAIJ;QAASK,YAAY,CAAC;QAAGC,MAAM;MAAK;IACvD,CAAA;AAOSC;;;;;kBAASJ,OAAiC,CAAC,CAAA;AA4C5CK,0BAAiB,CAACC,aAAAA;AACxB,YAAMC,OAAa;QACjB,GAAGD;QACHE,OAAO,CAAC,EAAEC,YAAY,WAAU,IAAK,CAAC,MAAC;AACrC,iBAAO,KAAKL,OAAO,KAAKM,WAAWH,KAAKN,IAAIQ,SAAAA,CAAAA;QAC9C;QACAE,OAAO,CAAC,EAAEF,WAAWG,OAAM,IAAK,CAAC,MAAC;AAChC,gBAAMD,QAAQ,KAAKE,UAAU;YAAEZ,IAAIM,KAAKN;YAAIQ;UAAU,CAAA,EAAGG,OAAO,CAACE,MAAM,CAACC,aAAaD,CAAAA,CAAAA;AACrF,iBAAOF,SAASD,MAAMC,OAAO,CAACE,MAAMF,OAAOE,GAAGP,IAAAA,CAAAA,IAASI;QACzD;QACAJ,MAAM,CAACN,OAAAA;AACL,iBAAO,KAAKY,UAAU;YAAEZ;UAAG,CAAA,EAAGe,KAAK,CAACT,UAASA,MAAKN,OAAOA,EAAAA;QAC3D;QACAgB,SAAS,MAAA;AACP,iBAAO,KAAKJ,UAAU;YAAEZ,IAAIM,KAAKN;UAAG,CAAA,EAAGW,OAAOG,YAAAA;QAChD;MACF;AAEA,aAAOR;IACT;;;;;EA1DA,IAAIW,OAAO;AACT,WAAO,KAAKC,SAAStB,OAAAA;EACvB;;;;EAKAuB,OAAO,EAAEnB,KAAKJ,SAASwB,YAAY,GAAE,IAA0C,CAAC,GAAG;AACjF,UAAMD,SAAS,CAACb,SAAAA;AACd,YAAMI,QAAQJ,KAAKI,MAAK;AACxB,YAAMW,MAA2B;QAC/BrB,IAAIM,KAAKN,GAAGsB,SAASF,YAAY,GAAGd,KAAKN,GAAGuB,MAAM,GAAGH,YAAY,CAAA,CAAA,QAAUd,KAAKN;MAClF;AACA,UAAIM,KAAKL,WAAWuB,OAAO;AACzBH,YAAIG,QAAQlB,KAAKL,WAAWuB;MAC9B;AACA,UAAId,MAAMY,QAAQ;AAChBD,YAAIX,QAAQA,MAAMe,IAAI,CAACnB,UAASa,OAAOb,KAAAA,CAAAA;MACzC;AACA,aAAOe;IACT;AAEA,UAAMJ,OAAO,KAAKC,SAASlB,EAAAA;AAC3B0B,cAAUT,MAAM,mBAAmBjB,EAAAA,IAAI;;;;;;;;;AACvC,WAAOmB,OAAOF,IAAAA;EAChB;;;;EAKAC,SAASlB,IAA8B;AACrC,UAAMK,WAAW,KAAKP,OAAOE,EAAAA;AAC7B,QAAI,CAACK,UAAU;AACb,aAAOsB;IACT;AAEA,WAAO,KAAKvB,eAAeC,QAAAA;EAC7B;EAuBQO,UAAU,EAAEZ,IAAIQ,YAAY,WAAU,GAAuD;AACnG,UAAMD,QAAQ,KAAKJ,OAAO,KAAKM,WAAWT,IAAIQ,SAAAA,CAAAA;AAC9C,QAAI,CAACD,OAAO;AACV,aAAO,CAAA;IACT;AAEA,WAAOA,MAAMkB,IAAI,CAACzB,QAAO,KAAKkB,SAASlB,GAAAA,CAAAA,EAAKW,OAAOiB,WAAAA;EACrD;EAEQnB,WAAWT,IAAYQ,WAA0B;AACvD,WAAO,GAAGR,EAAAA,IAAMQ,SAAAA;EAClB;;;;EAKAqB,YACKnB,OACyB;AAC5B,WAAOA,MAAMe,IAAI,CAACnB,SAAS,KAAKwB,SAASxB,IAAAA,CAAAA;EAC3C;EAEQwB,SAA+E,EACrFpB,OACAH,OACA,GAAGwB,MAAAA,GACqD;AACxD,WAAOC,UAAU,MAAA;AACf,YAAM1B,OAAO;QAAEJ,MAAM;QAAMD,YAAY,CAAC;QAAG,GAAG8B;MAAM;AACpD,WAAKjC,OAAOQ,KAAKN,EAAE,IAAIM;AAEvB,UAAII,OAAO;AACTA,cAAMuB,QAAQ,CAACC,YAAAA;AACb,eAAKJ,SAASI,OAAAA;AACd,eAAKC,QAAQ;YAAEC,QAAQ9B,KAAKN;YAAIqC,QAAQH,QAAQlC;UAAG,CAAA;QACrD,CAAA;MACF;AAEA,UAAIO,OAAO;AACTA,cAAM0B,QAAQ,CAAC,CAACjC,IAAIQ,SAAAA,MAClBA,cAAc,aACV,KAAK2B,QAAQ;UAAEC,QAAQ9B,KAAKN;UAAIqC,QAAQrC;QAAG,CAAA,IAC3C,KAAKmC,QAAQ;UAAEC,QAAQpC;UAAIqC,QAAQ/B,KAAKN;QAAG,CAAA,CAAA;MAEnD;AAEA,aAAO,KAAKI,eAAeE,IAAAA;IAC7B,CAAA;EACF;;;;;;;EAQAgC,WAAWtC,IAAYO,QAAQ,OAAO;AACpCyB,cAAU,MAAA;AACR,YAAM1B,OAAO,KAAKY,SAASlB,EAAAA;AAC3B,UAAI,CAACM,MAAM;AACT;MACF;AAEA,UAAIC,OAAO;AAET,eAAO,KAAKJ,OAAO,KAAKM,WAAWT,IAAI,UAAA,CAAA;AACvC,eAAO,KAAKG,OAAO,KAAKM,WAAWT,IAAI,SAAA,CAAA;AAGvC,aAAKY,UAAU;UAAEZ;QAAG,CAAA,EAAGiC,QAAQ,CAAC3B,UAAS,KAAKiC,WAAW;UAAEH,QAAQpC;UAAIqC,QAAQ/B,MAAKN;QAAG,CAAA,CAAA;AACvF,aAAKY,UAAU;UAAEZ;UAAIQ,WAAW;QAAU,CAAA,EAAGyB,QAAQ,CAAC3B,UACpD,KAAKiC,WAAW;UAAEH,QAAQ9B,MAAKN;UAAIqC,QAAQrC;QAAG,CAAA,CAAA;MAElD;AAGA,aAAO,KAAKF,OAAOE,EAAAA;IACrB,CAAA;EACF;;;;EAKAmC,QAAQ,EAAEC,QAAQC,OAAM,GAAwC;AAC9DL,cAAU,MAAA;AACR,YAAMQ,WAAW,KAAKrC,OAAO,KAAKM,WAAW2B,QAAQ,UAAA,CAAA;AACrD,UAAI,CAACI,UAAU;AACb,aAAKrC,OAAO,KAAKM,WAAW2B,QAAQ,UAAA,CAAA,IAAe;UAACC;;MACtD,WAAW,CAACG,SAASC,SAASJ,MAAAA,GAAS;AACrCG,iBAASE,KAAKL,MAAAA;MAChB;AAEA,YAAMM,UAAU,KAAKxC,OAAO,KAAKM,WAAW4B,QAAQ,SAAA,CAAA;AACpD,UAAI,CAACM,SAAS;AACZ,aAAKxC,OAAO,KAAKM,WAAW4B,QAAQ,SAAA,CAAA,IAAc;UAACD;;MACrD,WAAW,CAACO,QAAQF,SAASL,MAAAA,GAAS;AACpCO,gBAAQD,KAAKN,MAAAA;MACf;IACF,CAAA;EACF;;;;;;;;;;EAWAQ,UAAUC,QAAgBrC,WAA0BD,OAAiB;AACnEyB,cAAU,MAAA;AACR,YAAMc,UAAU,KAAK3C,OAAO,KAAKM,WAAWoC,QAAQrC,SAAAA,CAAAA;AACpD,UAAIsC,SAAS;AACX,cAAMC,WAAWD,QAAQnC,OAAO,CAACX,OAAO,CAACO,MAAMkC,SAASzC,EAAAA,CAAAA,KAAQ,CAAA;AAChE,cAAMgD,SAASzC,MAAMI,OAAO,CAACX,OAAO8C,QAAQL,SAASzC,EAAAA,CAAAA,KAAQ,CAAA;AAC7D8C,gBAAQG,OAAO,GAAGH,QAAQxB,QAAM,GAAK;aAAI0B;aAAWD;SAAS;MAC/D;IACF,CAAA;EACF;;;;EAKAR,WAAW,EAAEH,QAAQC,OAAM,GAAwC;AACjEL,cAAU,MAAA;AACR,YAAMkB,gBAAgB,KAAK/C,OAAO,KAAKM,WAAW2B,QAAQ,UAAA,CAAA,GAAce,UAAU,CAACnD,OAAOA,OAAOqC,MAAAA;AACjG,UAAIa,kBAAkB,IAAI;AACxB,aAAK/C,OAAO,KAAKM,WAAW2B,QAAQ,UAAA,CAAA,EAAaa,OAAOC,eAAe,CAAA;MACzE;AAEA,YAAME,eAAe,KAAKjD,OAAO,KAAKM,WAAW4B,QAAQ,SAAA,CAAA,GAAac,UAAU,CAACnD,OAAOA,OAAOoC,MAAAA;AAC/F,UAAIgB,iBAAiB,IAAI;AACvB,aAAKjD,OAAO,KAAKM,WAAW4B,QAAQ,SAAA,CAAA,EAAYY,OAAOG,cAAc,CAAA;MACvE;IACF,CAAA;EACF;;;;;;;;;EAUAC,SAAS,EAAE/C,OAAO,KAAKW,MAAMT,YAAY,YAAYG,QAAQ2C,QAAO,GAAsBC,OAAiB,CAAA,GAAU;AAEnH,QAAIA,KAAKd,SAASnC,KAAKN,EAAE,GAAG;AAC1B;IACF;AAEA,QAAI,CAACW,UAAUA,OAAOL,IAAAA,GAAO;AAC3BgD,gBAAUhD,MAAM;WAAIiD;QAAMjD,KAAKN;OAAG;IACpC;AAEAwD,WAAOC,OAAO,KAAK7C,UAAU;MAAEZ,IAAIM,KAAKN;MAAIQ;IAAU,CAAA,CAAA,EAAIyB,QAAQ,CAACyB,UACjE,KAAKL,SAAS;MAAE/C,MAAMoD;MAAOlD;MAAWG;MAAQ2C;IAAQ,GAAG;SAAIC;MAAMjD,KAAKN;KAAG,CAAA;EAEjF;;;;EAKA2D,QAAQ,EAAEvB,SAAS,QAAQC,OAAM,GAA+D;AAC9F,UAAMuB,QAAQ,KAAK1C,SAASkB,MAAAA;AAC5B,QAAI,CAACwB,OAAO;AACV,aAAOjC;IACT;AAEA,QAAIkC;AACJ,SAAKR,SAAS;MACZ/C,MAAMsD;MACNjD,QAAQ,MAAM,CAACkD;MACfP,SAAS,CAAChD,MAAMiD,SAAAA;AACd,YAAIjD,KAAKN,OAAOqC,QAAQ;AACtBwB,kBAAQN;QACV;MACF;IACF,CAAA;AAEA,WAAOM;EACT;AACF;;;AE5SA,SAASC,0BAAoD;AAStD,IAAMC,eAAN,MAAMA;EAAN;AACYC,uBAAc,oBAAIC,IAAAA;AAClBC,wBAAe,IAAIC,mBAAAA;;;;;EAKpCC,aAAaC,IAAYC,WAA2C;AAClE,SAAKN,YAAYO,IAAIF,IAAIC,SAAAA;AACzB,WAAO;EACT;;;;EAKAE,gBAAgBH,IAA0B;AACxC,SAAKL,YAAYS,OAAOJ,EAAAA;AACxB,WAAO;EACT;;;;;EAMAK,MAAMC,eAA8B;AAElC,SAAKT,aAAaU,MAAK;AAEvB,UAAMC,QAAeF,iBAAiB,IAAIG,MAAAA;AAE1CC,UAAMC,KAAK,KAAKhB,YAAYiB,OAAM,CAAA,EAAIC,QAAQ,CAACC,YAAAA;AAC7C,YAAMC,cAAcD,QAAQN,KAAAA;AAC5BO,qBAAe,KAAKlB,aAAamB,IAAID,WAAAA;IACvC,CAAA;AAEA,WAAOP;EACT;AACF;;;ACxCO,IAAMS,cAAc,CAA8E,EACvGC,OACAC,WACAC,OACAC,YAAW,MAMZ;AACC,MAAIF,WAAW;AACb,WAAOD,MAAMI,SAAQ,GAAIF,KAAAA;EAC3B,OAAO;AACLA,UAAMG,QAAQ,CAAC,EAAEC,GAAE,MAAON,MAAMO,WAAWD,IAAIH,WAAAA,CAAAA;EACjD;AACF;",
-  "names": ["untracked", "create", "invariant", "nonNullable", "isGraphNode", "data", "properties", "isAction", "actionGroupSymbol", "Symbol", "isActionGroup", "isActionLike", "ROOT_ID", "Graph", "_nodes", "create", "id", "properties", "data", "_edges", "_constructNode", "nodeBase", "node", "edges", "direction", "getEdgeKey", "nodes", "filter", "_getNodes", "n", "isActionLike", "find", "actions", "root", "findNode", "toJSON", "maxLength", "obj", "length", "slice", "label", "map", "invariant", "undefined", "nonNullable", "addNodes", "_addNode", "_node", "untracked", "forEach", "subNode", "addEdge", "source", "target", "removeNode", "removeEdge", "outbound", "includes", "push", "inbound", "sortEdges", "nodeId", "current", "unsorted", "sorted", "splice", "outboundIndex", "findIndex", "inboundIndex", "traverse", "visitor", "path", "Object", "values", "child", "getPath", "start", "found", "EventSubscriptions", "GraphBuilder", "_extensions", "Map", "_unsubscribe", "EventSubscriptions", "addExtension", "id", "extension", "set", "removeExtension", "delete", "build", "previousGraph", "clear", "graph", "Graph", "Array", "from", "values", "forEach", "builder", "unsubscribe", "add", "manageNodes", "graph", "condition", "nodes", "removeEdges", "addNodes", "forEach", "id", "removeNode"]
+  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport { untracked } from '@preact/signals-core';\n\nimport { create } from '@dxos/echo-schema';\nimport { invariant } from '@dxos/invariant';\nimport { nonNullable } from '@dxos/util';\n\nimport { isActionLike, type EdgeDirection, type Node, type NodeArg, type NodeBase } from './node';\n\nexport const ROOT_ID = 'root';\n\nexport type TraversalOptions = {\n  /**\n   * The node to start traversing from.\n   *\n   * @default root\n   */\n  node?: Node;\n\n  /**\n   * The direction to traverse graph edges.\n   *\n   * @default 'outbound'\n   */\n  direction?: EdgeDirection;\n\n  /**\n   * A predicate to filter nodes which are passed to the `visitor` callback.\n   */\n  filter?: (node: Node) => boolean;\n\n  /**\n   * A callback which is called for each node visited during traversal.\n   */\n  visitor?: (node: Node, path: string[]) => void;\n};\n\n/**\n * The Graph represents the structure of the application constructed via plugins.\n */\nexport class Graph {\n  /**\n   * @internal\n   */\n  readonly _nodes = create<Record<string, NodeBase>>({\n    [ROOT_ID]: { id: ROOT_ID, properties: {}, data: null },\n  });\n\n  /**\n   * @internal\n   */\n  // Key is the `${node.id}-${direction}` and value is an ordered list of node ids.\n  // Explicit type required because TS says this is not portable.\n  readonly _edges = create<Record<string, string[]>>({});\n\n  /**\n   * Alias for `findNode('root')`.\n   */\n  get root() {\n    return this.findNode(ROOT_ID)!;\n  }\n\n  /**\n   * Convert the graph to a JSON object.\n   */\n  toJSON({ id = ROOT_ID, maxLength = 32 }: { id?: string; maxLength?: number } = {}) {\n    const toJSON = (node: Node, seen: string[] = []): any => {\n      const nodes = node.nodes();\n      const obj: Record<string, any> = {\n        id: node.id.length > maxLength ? `${node.id.slice(0, maxLength - 3)}...` : node.id,\n      };\n      if (node.properties.label) {\n        obj.label = node.properties.label;\n      }\n      if (nodes.length) {\n        obj.nodes = nodes\n          .map((n) => {\n            // Break cycles.\n            const nextSeen = [...seen, node.id];\n            return nextSeen.includes(n.id) ? undefined : toJSON(n, nextSeen);\n          })\n          .filter(nonNullable);\n      }\n      return obj;\n    };\n\n    const root = this.findNode(id);\n    invariant(root, `Node not found: ${id}`);\n    return toJSON(root);\n  }\n\n  /**\n   * Find the node with the given id in the graph.\n   */\n  findNode(id: string): Node | undefined {\n    const nodeBase = this._nodes[id];\n    if (!nodeBase) {\n      return undefined;\n    }\n\n    return this._constructNode(nodeBase);\n  }\n\n  private _constructNode = (nodeBase: NodeBase): Node => {\n    const node: Node = {\n      ...nodeBase,\n      edges: ({ direction = 'outbound' } = {}) => {\n        return this._edges[this.getEdgeKey(node.id, direction)];\n      },\n      nodes: ({ direction, filter } = {}) => {\n        const nodes = this._getNodes({ id: node.id, direction }).filter((n) => !isActionLike(n));\n        return filter ? nodes.filter((n) => filter(n, node)) : nodes;\n      },\n      node: (id: string) => {\n        return this._getNodes({ id }).find((node) => node.id === id);\n      },\n      actions: () => {\n        return this._getNodes({ id: node.id }).filter(isActionLike);\n      },\n    };\n\n    return node;\n  };\n\n  private _getNodes({ id, direction = 'outbound' }: { id: string; direction?: EdgeDirection }): Node[] {\n    const edges = this._edges[this.getEdgeKey(id, direction)];\n    if (!edges) {\n      return [];\n    }\n\n    return edges.map((id) => this.findNode(id)).filter(nonNullable);\n  }\n\n  private getEdgeKey(id: string, direction: EdgeDirection) {\n    return `${id}-${direction}`;\n  }\n\n  /**\n   * Add nodes to the graph.\n   */\n  addNodes<TData = null, TProperties extends Record<string, any> = Record<string, any>>(\n    ...nodes: NodeArg<TData, TProperties>[]\n  ): Node<TData, TProperties>[] {\n    return nodes.map((node) => this._addNode(node));\n  }\n\n  private _addNode<TData, TProperties extends Record<string, any> = Record<string, any>>({\n    nodes,\n    edges,\n    ..._node\n  }: NodeArg<TData, TProperties>): Node<TData, TProperties> {\n    return untracked(() => {\n      const node = { data: null, properties: {}, ..._node };\n      this._nodes[node.id] = node;\n\n      if (nodes) {\n        nodes.forEach((subNode) => {\n          this._addNode(subNode);\n          this.addEdge({ source: node.id, target: subNode.id });\n        });\n      }\n\n      if (edges) {\n        edges.forEach(([id, direction]) =>\n          direction === 'outbound'\n            ? this.addEdge({ source: node.id, target: id })\n            : this.addEdge({ source: id, target: node.id }),\n        );\n      }\n\n      return this._constructNode(node) as Node<TData, TProperties>;\n    });\n  }\n\n  /**\n   * Remove nodes from the graph.\n   *\n   * @param id The id of the node to remove.\n   * @param edges Whether to remove edges connected to the node from the graph as well.\n   */\n  removeNode(id: string, edges = false) {\n    untracked(() => {\n      const node = this.findNode(id);\n      if (!node) {\n        return;\n      }\n\n      if (edges) {\n        // Remove edges from node.\n        delete this._edges[this.getEdgeKey(id, 'outbound')];\n        delete this._edges[this.getEdgeKey(id, 'inbound')];\n\n        // Remove edges from connected nodes.\n        this._getNodes({ id }).forEach((node) => this.removeEdge({ source: id, target: node.id }));\n        this._getNodes({ id, direction: 'inbound' }).forEach((node) =>\n          this.removeEdge({ source: node.id, target: id }),\n        );\n      }\n\n      // Remove node.\n      delete this._nodes[id];\n    });\n  }\n\n  /**\n   * Add an edge to the graph.\n   */\n  addEdge({ source, target }: { source: string; target: string }) {\n    untracked(() => {\n      const outbound = this._edges[this.getEdgeKey(source, 'outbound')];\n      if (!outbound) {\n        this._edges[this.getEdgeKey(source, 'outbound')] = [target];\n      } else if (!outbound.includes(target)) {\n        outbound.push(target);\n      }\n\n      const inbound = this._edges[this.getEdgeKey(target, 'inbound')];\n      if (!inbound) {\n        this._edges[this.getEdgeKey(target, 'inbound')] = [source];\n      } else if (!inbound.includes(source)) {\n        inbound.push(source);\n      }\n    });\n  }\n\n  /**\n   * Sort edges for a node.\n   *\n   * Edges not included in the sorted list are appended to the end of the list.\n   *\n   * @param nodeId The id of the node to sort edges for.\n   * @param direction The direction of the edges from the node to sort.\n   * @param edges The ordered list of edges.\n   */\n  sortEdges(nodeId: string, direction: EdgeDirection, edges: string[]) {\n    untracked(() => {\n      const current = this._edges[this.getEdgeKey(nodeId, direction)];\n      if (current) {\n        const unsorted = current.filter((id) => !edges.includes(id)) ?? [];\n        const sorted = edges.filter((id) => current.includes(id)) ?? [];\n        current.splice(0, current.length, ...[...sorted, ...unsorted]);\n      }\n    });\n  }\n\n  /**\n   * Remove an edge from the graph.\n   */\n  removeEdge({ source, target }: { source: string; target: string }) {\n    untracked(() => {\n      const outboundIndex = this._edges[this.getEdgeKey(source, 'outbound')]?.findIndex((id) => id === target);\n      if (outboundIndex !== -1) {\n        this._edges[this.getEdgeKey(source, 'outbound')].splice(outboundIndex, 1);\n      }\n\n      const inboundIndex = this._edges[this.getEdgeKey(target, 'inbound')]?.findIndex((id) => id === source);\n      if (inboundIndex !== -1) {\n        this._edges[this.getEdgeKey(target, 'inbound')].splice(inboundIndex, 1);\n      }\n    });\n  }\n\n  /**\n   * Recursive depth-first traversal.\n   *\n   * @param options.node The node to start traversing from.\n   * @param options.direction The direction to traverse graph edges.\n   * @param options.filter A predicate to filter nodes which are passed to the `visitor` callback.\n   * @param options.visitor A callback which is called for each node visited during traversal.\n   */\n  traverse({ node = this.root, direction = 'outbound', filter, visitor }: TraversalOptions, path: string[] = []): void {\n    // Break cycles.\n    if (path.includes(node.id)) {\n      return;\n    }\n\n    if (!filter || filter(node)) {\n      visitor?.(node, [...path, node.id]);\n    }\n\n    Object.values(this._getNodes({ id: node.id, direction })).forEach((child) =>\n      this.traverse({ node: child, direction, filter, visitor }, [...path, node.id]),\n    );\n  }\n\n  /**\n   * Get the path between two nodes in the graph.\n   */\n  getPath({ source = 'root', target }: { source?: string; target: string }): string[] | undefined {\n    const start = this.findNode(source);\n    if (!start) {\n      return undefined;\n    }\n\n    let found: string[] | undefined;\n    this.traverse({\n      node: start,\n      filter: () => !found,\n      visitor: (node, path) => {\n        if (node.id === target) {\n          found = path;\n        }\n      },\n    });\n\n    return found;\n  }\n}\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { type MaybePromise, type MakeOptional } from '@dxos/util';\n\n/**\n * Represents a node in the graph.\n */\n// TODO(wittjosiah): Use Effect Schema.\nexport type NodeBase<TData = any, TProperties extends Record<string, any> = Record<string, any>> = {\n  /**\n   * Globally unique ID.\n   */\n  id: string;\n\n  /**\n   * Properties of the node relevant to displaying the node.\n   */\n  properties: TProperties;\n\n  /**\n   * Data the node represents.\n   */\n  // TODO(burdon): Type system (e.g., minimally provide identifier string vs. TypedObject vs. Graph mixin type system)?\n  //  type field would prevent convoluted sniffing of object properties. And allow direct pass-through for ECHO TypedObjects.\n  data: TData;\n};\n\nexport type NodeFilter<T = any, U extends Record<string, any> = Record<string, any>> = (\n  node: Node<unknown, Record<string, any>>,\n  connectedNode: Node,\n) => node is Node<T, U>;\n\nexport type EdgeDirection = 'outbound' | 'inbound';\n\nexport type ConnectedNodes = {\n  /**\n   * Edges that this node is connected to in default order.\n   */\n  edges(params?: { direction?: EdgeDirection }): Readonly<string[]>;\n\n  /**\n   * Nodes that this node is connected to in default order.\n   */\n  nodes<T = any, U extends Record<string, any> = Record<string, any>>(params?: {\n    direction?: EdgeDirection;\n    filter?: NodeFilter<T, U>;\n  }): Node<T>[];\n\n  /**\n   * Get a specific connected node by id.\n   */\n  node(id: string): Node | undefined;\n};\n\nexport type ConnectedActions = {\n  /**\n   * Actions or action groups that this node is connected to in default order.\n   */\n  actions(): ActionLike[];\n};\n\nexport type Node<TData = any, TProperties extends Record<string, any> = Record<string, any>> = Readonly<\n  Omit<NodeBase<TData, TProperties>, 'properties'> & { properties: Readonly<TProperties> } & ConnectedNodes &\n    ConnectedActions\n>;\n\nexport const isGraphNode = (data: unknown): data is Node =>\n  data && typeof data === 'object' && 'id' in data && 'properties' in data && data.properties\n    ? typeof data.properties === 'object' && 'data' in data\n    : false;\n\nexport type NodeArg<TData, TProperties extends Record<string, any> = Record<string, any>> = MakeOptional<\n  NodeBase<TData, TProperties>,\n  'data' | 'properties'\n> & {\n  /** Will automatically add nodes with an edge from this node to each. */\n  nodes?: NodeArg<unknown>[];\n\n  /** Will automatically add specified edges. */\n  edges?: [string, EdgeDirection][];\n};\n\n//\n// Actions\n//\n\nexport type InvokeParams = {\n  /** Node the invoked action is connected to. */\n  node: Node;\n\n  caller?: string;\n};\n\nexport type ActionData = (params: InvokeParams) => MaybePromise<void>;\n\nexport type Action<TProperties extends Record<string, any> = Record<string, any>> = Readonly<\n  Omit<NodeBase<ActionData, TProperties>, 'properties'> & {\n    properties: Readonly<TProperties>;\n  } & ConnectedNodes\n>;\n\nexport const isAction = (data: unknown): data is Action =>\n  isGraphNode(data) ? typeof data.data === 'function' : false;\n\nexport const actionGroupSymbol = Symbol('ActionGroup');\n\nexport type ActionGroup = Readonly<\n  Omit<NodeBase<typeof actionGroupSymbol, Record<string, any>>, 'properties'> & {\n    properties: Readonly<Record<string, any>>;\n  } & ConnectedActions\n>;\n\nexport const isActionGroup = (data: unknown): data is ActionGroup =>\n  isGraphNode(data) ? data.data === actionGroupSymbol : false;\n\nexport type ActionLike = Action | ActionGroup;\n\nexport const isActionLike = (data: unknown): data is Action | ActionGroup => isAction(data) || isActionGroup(data);\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { EventSubscriptions, type UnsubscribeCallback } from '@dxos/async';\n\nimport { Graph } from './graph';\n\nexport type BuilderExtension = (graph: Graph) => UnsubscribeCallback | void;\n\n/**\n * The builder provides an extensible way to compose the construction of the graph.\n */\nexport class GraphBuilder {\n  private readonly _extensions = new Map<string, BuilderExtension>();\n  private readonly _unsubscribe = new EventSubscriptions();\n\n  /**\n   * Register a node builder which will be called in order to construct the graph.\n   */\n  addExtension(id: string, extension: BuilderExtension): GraphBuilder {\n    this._extensions.set(id, extension);\n    return this;\n  }\n\n  /**\n   * Remove a node builder from the graph builder.\n   */\n  removeExtension(id: string): GraphBuilder {\n    this._extensions.delete(id);\n    return this;\n  }\n\n  /**\n   * Construct the graph, starting by calling all registered extensions.\n   * @param previousGraph If provided, the graph will be updated in place.\n   */\n  build(previousGraph?: Graph): Graph {\n    // Clear previous extension subscriptions.\n    this._unsubscribe.clear();\n\n    const graph: Graph = previousGraph ?? new Graph();\n\n    Array.from(this._extensions.values()).forEach((builder) => {\n      const unsubscribe = builder(graph);\n      unsubscribe && this._unsubscribe.add(unsubscribe);\n    });\n\n    return graph;\n  }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { type Graph } from './graph';\nimport { type Node, type NodeArg } from './node';\n\n/**\n * If the condition is true, adds the nodes to the graph, otherwise removes the nodes from the graph.\n */\nexport const manageNodes = <TData = null, TProperties extends Record<string, any> = Record<string, any>>({\n  graph,\n  condition,\n  nodes,\n  removeEdges,\n}: {\n  graph: Graph;\n  condition: boolean;\n  nodes: NodeArg<TData, TProperties>[];\n  removeEdges?: boolean;\n}): Node<TData, TProperties>[] | void => {\n  if (condition) {\n    return graph.addNodes(...nodes);\n  } else {\n    nodes.forEach(({ id }) => graph.removeNode(id, removeEdges));\n  }\n};\n"],
+  "mappings": ";AAIA,SAASA,iBAAiB;AAE1B,SAASC,cAAc;AACvB,SAASC,iBAAiB;AAC1B,SAASC,mBAAmB;;;AC4DrB,IAAMC,cAAc,CAACC,SAC1BA,QAAQ,OAAOA,SAAS,YAAY,QAAQA,QAAQ,gBAAgBA,QAAQA,KAAKC,aAC7E,OAAOD,KAAKC,eAAe,YAAY,UAAUD,OACjD;AAgCC,IAAME,WAAW,CAACF,SACvBD,YAAYC,IAAAA,IAAQ,OAAOA,KAAKA,SAAS,aAAa;AAEjD,IAAMG,oBAAoBC,OAAO,aAAA;AAQjC,IAAMC,gBAAgB,CAACL,SAC5BD,YAAYC,IAAAA,IAAQA,KAAKA,SAASG,oBAAoB;AAIjD,IAAMG,eAAe,CAACN,SAAgDE,SAASF,IAAAA,KAASK,cAAcL,IAAAA;;;;AD3GtG,IAAMO,UAAU;AA+BhB,IAAMC,QAAN,MAAMA;EAAN;AAIIC;;;kBAASC,OAAiC;MACjD,CAACH,OAAAA,GAAU;QAAEI,IAAIJ;QAASK,YAAY,CAAC;QAAGC,MAAM;MAAK;IACvD,CAAA;AAOSC;;;;;kBAASJ,OAAiC,CAAC,CAAA;AAkD5CK,0BAAiB,CAACC,aAAAA;AACxB,YAAMC,OAAa;QACjB,GAAGD;QACHE,OAAO,CAAC,EAAEC,YAAY,WAAU,IAAK,CAAC,MAAC;AACrC,iBAAO,KAAKL,OAAO,KAAKM,WAAWH,KAAKN,IAAIQ,SAAAA,CAAAA;QAC9C;QACAE,OAAO,CAAC,EAAEF,WAAWG,OAAM,IAAK,CAAC,MAAC;AAChC,gBAAMD,QAAQ,KAAKE,UAAU;YAAEZ,IAAIM,KAAKN;YAAIQ;UAAU,CAAA,EAAGG,OAAO,CAACE,MAAM,CAACC,aAAaD,CAAAA,CAAAA;AACrF,iBAAOF,SAASD,MAAMC,OAAO,CAACE,MAAMF,OAAOE,GAAGP,IAAAA,CAAAA,IAASI;QACzD;QACAJ,MAAM,CAACN,OAAAA;AACL,iBAAO,KAAKY,UAAU;YAAEZ;UAAG,CAAA,EAAGe,KAAK,CAACT,UAASA,MAAKN,OAAOA,EAAAA;QAC3D;QACAgB,SAAS,MAAA;AACP,iBAAO,KAAKJ,UAAU;YAAEZ,IAAIM,KAAKN;UAAG,CAAA,EAAGW,OAAOG,YAAAA;QAChD;MACF;AAEA,aAAOR;IACT;;;;;EAhEA,IAAIW,OAAO;AACT,WAAO,KAAKC,SAAStB,OAAAA;EACvB;;;;EAKAuB,OAAO,EAAEnB,KAAKJ,SAASwB,YAAY,GAAE,IAA0C,CAAC,GAAG;AACjF,UAAMD,SAAS,CAACb,MAAYe,OAAiB,CAAA,MAAE;AAC7C,YAAMX,QAAQJ,KAAKI,MAAK;AACxB,YAAMY,MAA2B;QAC/BtB,IAAIM,KAAKN,GAAGuB,SAASH,YAAY,GAAGd,KAAKN,GAAGwB,MAAM,GAAGJ,YAAY,CAAA,CAAA,QAAUd,KAAKN;MAClF;AACA,UAAIM,KAAKL,WAAWwB,OAAO;AACzBH,YAAIG,QAAQnB,KAAKL,WAAWwB;MAC9B;AACA,UAAIf,MAAMa,QAAQ;AAChBD,YAAIZ,QAAQA,MACTgB,IAAI,CAACb,MAAAA;AAEJ,gBAAMc,WAAW;eAAIN;YAAMf,KAAKN;;AAChC,iBAAO2B,SAASC,SAASf,EAAEb,EAAE,IAAI6B,SAAYV,OAAON,GAAGc,QAAAA;QACzD,CAAA,EACChB,OAAOmB,WAAAA;MACZ;AACA,aAAOR;IACT;AAEA,UAAML,OAAO,KAAKC,SAASlB,EAAAA;AAC3B+B,cAAUd,MAAM,mBAAmBjB,EAAAA,IAAI;;;;;;;;;AACvC,WAAOmB,OAAOF,IAAAA;EAChB;;;;EAKAC,SAASlB,IAA8B;AACrC,UAAMK,WAAW,KAAKP,OAAOE,EAAAA;AAC7B,QAAI,CAACK,UAAU;AACb,aAAOwB;IACT;AAEA,WAAO,KAAKzB,eAAeC,QAAAA;EAC7B;EAuBQO,UAAU,EAAEZ,IAAIQ,YAAY,WAAU,GAAuD;AACnG,UAAMD,QAAQ,KAAKJ,OAAO,KAAKM,WAAWT,IAAIQ,SAAAA,CAAAA;AAC9C,QAAI,CAACD,OAAO;AACV,aAAO,CAAA;IACT;AAEA,WAAOA,MAAMmB,IAAI,CAAC1B,QAAO,KAAKkB,SAASlB,GAAAA,CAAAA,EAAKW,OAAOmB,WAAAA;EACrD;EAEQrB,WAAWT,IAAYQ,WAA0B;AACvD,WAAO,GAAGR,EAAAA,IAAMQ,SAAAA;EAClB;;;;EAKAwB,YACKtB,OACyB;AAC5B,WAAOA,MAAMgB,IAAI,CAACpB,SAAS,KAAK2B,SAAS3B,IAAAA,CAAAA;EAC3C;EAEQ2B,SAA+E,EACrFvB,OACAH,OACA,GAAG2B,MAAAA,GACqD;AACxD,WAAOC,UAAU,MAAA;AACf,YAAM7B,OAAO;QAAEJ,MAAM;QAAMD,YAAY,CAAC;QAAG,GAAGiC;MAAM;AACpD,WAAKpC,OAAOQ,KAAKN,EAAE,IAAIM;AAEvB,UAAII,OAAO;AACTA,cAAM0B,QAAQ,CAACC,YAAAA;AACb,eAAKJ,SAASI,OAAAA;AACd,eAAKC,QAAQ;YAAEC,QAAQjC,KAAKN;YAAIwC,QAAQH,QAAQrC;UAAG,CAAA;QACrD,CAAA;MACF;AAEA,UAAIO,OAAO;AACTA,cAAM6B,QAAQ,CAAC,CAACpC,IAAIQ,SAAAA,MAClBA,cAAc,aACV,KAAK8B,QAAQ;UAAEC,QAAQjC,KAAKN;UAAIwC,QAAQxC;QAAG,CAAA,IAC3C,KAAKsC,QAAQ;UAAEC,QAAQvC;UAAIwC,QAAQlC,KAAKN;QAAG,CAAA,CAAA;MAEnD;AAEA,aAAO,KAAKI,eAAeE,IAAAA;IAC7B,CAAA;EACF;;;;;;;EAQAmC,WAAWzC,IAAYO,QAAQ,OAAO;AACpC4B,cAAU,MAAA;AACR,YAAM7B,OAAO,KAAKY,SAASlB,EAAAA;AAC3B,UAAI,CAACM,MAAM;AACT;MACF;AAEA,UAAIC,OAAO;AAET,eAAO,KAAKJ,OAAO,KAAKM,WAAWT,IAAI,UAAA,CAAA;AACvC,eAAO,KAAKG,OAAO,KAAKM,WAAWT,IAAI,SAAA,CAAA;AAGvC,aAAKY,UAAU;UAAEZ;QAAG,CAAA,EAAGoC,QAAQ,CAAC9B,UAAS,KAAKoC,WAAW;UAAEH,QAAQvC;UAAIwC,QAAQlC,MAAKN;QAAG,CAAA,CAAA;AACvF,aAAKY,UAAU;UAAEZ;UAAIQ,WAAW;QAAU,CAAA,EAAG4B,QAAQ,CAAC9B,UACpD,KAAKoC,WAAW;UAAEH,QAAQjC,MAAKN;UAAIwC,QAAQxC;QAAG,CAAA,CAAA;MAElD;AAGA,aAAO,KAAKF,OAAOE,EAAAA;IACrB,CAAA;EACF;;;;EAKAsC,QAAQ,EAAEC,QAAQC,OAAM,GAAwC;AAC9DL,cAAU,MAAA;AACR,YAAMQ,WAAW,KAAKxC,OAAO,KAAKM,WAAW8B,QAAQ,UAAA,CAAA;AACrD,UAAI,CAACI,UAAU;AACb,aAAKxC,OAAO,KAAKM,WAAW8B,QAAQ,UAAA,CAAA,IAAe;UAACC;;MACtD,WAAW,CAACG,SAASf,SAASY,MAAAA,GAAS;AACrCG,iBAASC,KAAKJ,MAAAA;MAChB;AAEA,YAAMK,UAAU,KAAK1C,OAAO,KAAKM,WAAW+B,QAAQ,SAAA,CAAA;AACpD,UAAI,CAACK,SAAS;AACZ,aAAK1C,OAAO,KAAKM,WAAW+B,QAAQ,SAAA,CAAA,IAAc;UAACD;;MACrD,WAAW,CAACM,QAAQjB,SAASW,MAAAA,GAAS;AACpCM,gBAAQD,KAAKL,MAAAA;MACf;IACF,CAAA;EACF;;;;;;;;;;EAWAO,UAAUC,QAAgBvC,WAA0BD,OAAiB;AACnE4B,cAAU,MAAA;AACR,YAAMa,UAAU,KAAK7C,OAAO,KAAKM,WAAWsC,QAAQvC,SAAAA,CAAAA;AACpD,UAAIwC,SAAS;AACX,cAAMC,WAAWD,QAAQrC,OAAO,CAACX,OAAO,CAACO,MAAMqB,SAAS5B,EAAAA,CAAAA,KAAQ,CAAA;AAChE,cAAMkD,SAAS3C,MAAMI,OAAO,CAACX,OAAOgD,QAAQpB,SAAS5B,EAAAA,CAAAA,KAAQ,CAAA;AAC7DgD,gBAAQG,OAAO,GAAGH,QAAQzB,QAAM,GAAK;aAAI2B;aAAWD;SAAS;MAC/D;IACF,CAAA;EACF;;;;EAKAP,WAAW,EAAEH,QAAQC,OAAM,GAAwC;AACjEL,cAAU,MAAA;AACR,YAAMiB,gBAAgB,KAAKjD,OAAO,KAAKM,WAAW8B,QAAQ,UAAA,CAAA,GAAcc,UAAU,CAACrD,OAAOA,OAAOwC,MAAAA;AACjG,UAAIY,kBAAkB,IAAI;AACxB,aAAKjD,OAAO,KAAKM,WAAW8B,QAAQ,UAAA,CAAA,EAAaY,OAAOC,eAAe,CAAA;MACzE;AAEA,YAAME,eAAe,KAAKnD,OAAO,KAAKM,WAAW+B,QAAQ,SAAA,CAAA,GAAaa,UAAU,CAACrD,OAAOA,OAAOuC,MAAAA;AAC/F,UAAIe,iBAAiB,IAAI;AACvB,aAAKnD,OAAO,KAAKM,WAAW+B,QAAQ,SAAA,CAAA,EAAYW,OAAOG,cAAc,CAAA;MACvE;IACF,CAAA;EACF;;;;;;;;;EAUAC,SAAS,EAAEjD,OAAO,KAAKW,MAAMT,YAAY,YAAYG,QAAQ6C,QAAO,GAAsBC,OAAiB,CAAA,GAAU;AAEnH,QAAIA,KAAK7B,SAAStB,KAAKN,EAAE,GAAG;AAC1B;IACF;AAEA,QAAI,CAACW,UAAUA,OAAOL,IAAAA,GAAO;AAC3BkD,gBAAUlD,MAAM;WAAImD;QAAMnD,KAAKN;OAAG;IACpC;AAEA0D,WAAOC,OAAO,KAAK/C,UAAU;MAAEZ,IAAIM,KAAKN;MAAIQ;IAAU,CAAA,CAAA,EAAI4B,QAAQ,CAACwB,UACjE,KAAKL,SAAS;MAAEjD,MAAMsD;MAAOpD;MAAWG;MAAQ6C;IAAQ,GAAG;SAAIC;MAAMnD,KAAKN;KAAG,CAAA;EAEjF;;;;EAKA6D,QAAQ,EAAEtB,SAAS,QAAQC,OAAM,GAA+D;AAC9F,UAAMsB,QAAQ,KAAK5C,SAASqB,MAAAA;AAC5B,QAAI,CAACuB,OAAO;AACV,aAAOjC;IACT;AAEA,QAAIkC;AACJ,SAAKR,SAAS;MACZjD,MAAMwD;MACNnD,QAAQ,MAAM,CAACoD;MACfP,SAAS,CAAClD,MAAMmD,SAAAA;AACd,YAAInD,KAAKN,OAAOwC,QAAQ;AACtBuB,kBAAQN;QACV;MACF;IACF,CAAA;AAEA,WAAOM;EACT;AACF;;;AElTA,SAASC,0BAAoD;AAStD,IAAMC,eAAN,MAAMA;EAAN;AACYC,uBAAc,oBAAIC,IAAAA;AAClBC,wBAAe,IAAIC,mBAAAA;;;;;EAKpCC,aAAaC,IAAYC,WAA2C;AAClE,SAAKN,YAAYO,IAAIF,IAAIC,SAAAA;AACzB,WAAO;EACT;;;;EAKAE,gBAAgBH,IAA0B;AACxC,SAAKL,YAAYS,OAAOJ,EAAAA;AACxB,WAAO;EACT;;;;;EAMAK,MAAMC,eAA8B;AAElC,SAAKT,aAAaU,MAAK;AAEvB,UAAMC,QAAeF,iBAAiB,IAAIG,MAAAA;AAE1CC,UAAMC,KAAK,KAAKhB,YAAYiB,OAAM,CAAA,EAAIC,QAAQ,CAACC,YAAAA;AAC7C,YAAMC,cAAcD,QAAQN,KAAAA;AAC5BO,qBAAe,KAAKlB,aAAamB,IAAID,WAAAA;IACvC,CAAA;AAEA,WAAOP;EACT;AACF;;;ACxCO,IAAMS,cAAc,CAA8E,EACvGC,OACAC,WACAC,OACAC,YAAW,MAMZ;AACC,MAAIF,WAAW;AACb,WAAOD,MAAMI,SAAQ,GAAIF,KAAAA;EAC3B,OAAO;AACLA,UAAMG,QAAQ,CAAC,EAAEC,GAAE,MAAON,MAAMO,WAAWD,IAAIH,WAAAA,CAAAA;EACjD;AACF;",
+  "names": ["untracked", "create", "invariant", "nonNullable", "isGraphNode", "data", "properties", "isAction", "actionGroupSymbol", "Symbol", "isActionGroup", "isActionLike", "ROOT_ID", "Graph", "_nodes", "create", "id", "properties", "data", "_edges", "_constructNode", "nodeBase", "node", "edges", "direction", "getEdgeKey", "nodes", "filter", "_getNodes", "n", "isActionLike", "find", "actions", "root", "findNode", "toJSON", "maxLength", "seen", "obj", "length", "slice", "label", "map", "nextSeen", "includes", "undefined", "nonNullable", "invariant", "addNodes", "_addNode", "_node", "untracked", "forEach", "subNode", "addEdge", "source", "target", "removeNode", "removeEdge", "outbound", "push", "inbound", "sortEdges", "nodeId", "current", "unsorted", "sorted", "splice", "outboundIndex", "findIndex", "inboundIndex", "traverse", "visitor", "path", "Object", "values", "child", "getPath", "start", "found", "EventSubscriptions", "GraphBuilder", "_extensions", "Map", "_unsubscribe", "EventSubscriptions", "addExtension", "id", "extension", "set", "removeExtension", "delete", "build", "previousGraph", "clear", "graph", "Graph", "Array", "from", "values", "forEach", "builder", "unsubscribe", "add", "manageNodes", "graph", "condition", "nodes", "removeEdges", "addNodes", "forEach", "id", "removeNode"]
 }

package/dist/lib/browser/meta.json

@@ -1 +1 @@
-{"inputs":{"packages/sdk/app-graph/src/node.ts":{"bytes":6447,"imports":[],"format":"esm"},"packages/sdk/app-graph/src/graph.ts":{"bytes":30735,"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"},"packages/sdk/app-graph/src/graph-builder.ts":{"bytes":4684,"imports":[{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"}],"format":"esm"},"packages/sdk/app-graph/src/helpers.ts":{"bytes":2079,"imports":[],"format":"esm"},"packages/sdk/app-graph/src/index.ts":{"bytes":759,"imports":[{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"packages/sdk/app-graph/src/graph-builder.ts","kind":"import-statement","original":"./graph-builder"},{"path":"packages/sdk/app-graph/src/helpers.ts","kind":"import-statement","original":"./helpers"},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"}},"outputs":{"packages/sdk/app-graph/dist/lib/browser/index.mjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":22525},"packages/sdk/app-graph/dist/lib/browser/index.mjs":{"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true}],"exports":["Graph","GraphBuilder","ROOT_ID","actionGroupSymbol","isAction","isActionGroup","isActionLike","isGraphNode","manageNodes"],"entryPoint":"packages/sdk/app-graph/src/index.ts","inputs":{"packages/sdk/app-graph/src/graph.ts":{"bytesInOutput":7674},"packages/sdk/app-graph/src/node.ts":{"bytesInOutput":477},"packages/sdk/app-graph/src/index.ts":{"bytesInOutput":0},"packages/sdk/app-graph/src/graph-builder.ts":{"bytesInOutput":983},"packages/sdk/app-graph/src/helpers.ts":{"bytesInOutput":206}},"bytes":9726}}}
+{"inputs":{"packages/sdk/app-graph/src/node.ts":{"bytes":6447,"imports":[],"format":"esm"},"packages/sdk/app-graph/src/graph.ts":{"bytes":31580,"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"},"packages/sdk/app-graph/src/graph-builder.ts":{"bytes":4684,"imports":[{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"}],"format":"esm"},"packages/sdk/app-graph/src/helpers.ts":{"bytes":2079,"imports":[],"format":"esm"},"packages/sdk/app-graph/src/index.ts":{"bytes":759,"imports":[{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"packages/sdk/app-graph/src/graph-builder.ts","kind":"import-statement","original":"./graph-builder"},{"path":"packages/sdk/app-graph/src/helpers.ts","kind":"import-statement","original":"./helpers"},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"}},"outputs":{"packages/sdk/app-graph/dist/lib/browser/index.mjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":22904},"packages/sdk/app-graph/dist/lib/browser/index.mjs":{"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true}],"exports":["Graph","GraphBuilder","ROOT_ID","actionGroupSymbol","isAction","isActionGroup","isActionLike","isGraphNode","manageNodes"],"entryPoint":"packages/sdk/app-graph/src/index.ts","inputs":{"packages/sdk/app-graph/src/graph.ts":{"bytesInOutput":7855},"packages/sdk/app-graph/src/node.ts":{"bytesInOutput":477},"packages/sdk/app-graph/src/index.ts":{"bytesInOutput":0},"packages/sdk/app-graph/src/graph-builder.ts":{"bytesInOutput":983},"packages/sdk/app-graph/src/helpers.ts":{"bytesInOutput":206}},"bytes":9907}}}

package/dist/lib/node/index.cjs

@@ -88,7 +88,7 @@ var Graph = class {
   * Convert the graph to a JSON object.
   */
   toJSON({ id = ROOT_ID, maxLength = 32 } = {}) {
-    const toJSON = (node) => {
+    const toJSON = (node, seen = []) => {
       const nodes = node.nodes();
       const obj = {
         id: node.id.length > maxLength ? `${node.id.slice(0, maxLength - 3)}...` : node.id
@@ -97,14 +97,20 @@ var Graph = class {
         obj.label = node.properties.label;
       }
       if (nodes.length) {
-        obj.nodes = nodes.map((node2) => toJSON(node2));
+        obj.nodes = nodes.map((n) => {
+          const nextSeen = [
+            ...seen,
+            node.id
+          ];
+          return nextSeen.includes(n.id) ? void 0 : toJSON(n, nextSeen);
+        }).filter(import_util.nonNullable);
       }
       return obj;
     };
     const root = this.findNode(id);
     (0, import_invariant.invariant)(root, `Node not found: ${id}`, {
       F: __dxlog_file,
-      L: 85,
+      L: 91,
       S: this,
       A: [
         "root",

package/dist/lib/node/index.cjs.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/graph.ts", "../../../src/node.ts", "../../../src/graph-builder.ts", "../../../src/helpers.ts"],
-  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport { untracked } from '@preact/signals-core';\n\nimport { create } from '@dxos/echo-schema';\nimport { invariant } from '@dxos/invariant';\nimport { nonNullable } from '@dxos/util';\n\nimport { isActionLike, type EdgeDirection, type Node, type NodeArg, type NodeBase } from './node';\n\nexport const ROOT_ID = 'root';\n\nexport type TraversalOptions = {\n  /**\n   * The node to start traversing from.\n   *\n   * @default root\n   */\n  node?: Node;\n\n  /**\n   * The direction to traverse graph edges.\n   *\n   * @default 'outbound'\n   */\n  direction?: EdgeDirection;\n\n  /**\n   * A predicate to filter nodes which are passed to the `visitor` callback.\n   */\n  filter?: (node: Node) => boolean;\n\n  /**\n   * A callback which is called for each node visited during traversal.\n   */\n  visitor?: (node: Node, path: string[]) => void;\n};\n\n/**\n * The Graph represents the structure of the application constructed via plugins.\n */\nexport class Graph {\n  /**\n   * @internal\n   */\n  readonly _nodes = create<Record<string, NodeBase>>({\n    [ROOT_ID]: { id: ROOT_ID, properties: {}, data: null },\n  });\n\n  /**\n   * @internal\n   */\n  // Key is the `${node.id}-${direction}` and value is an ordered list of node ids.\n  // Explicit type required because TS says this is not portable.\n  readonly _edges = create<Record<string, string[]>>({});\n\n  /**\n   * Alias for `findNode('root')`.\n   */\n  get root() {\n    return this.findNode(ROOT_ID)!;\n  }\n\n  /**\n   * Convert the graph to a JSON object.\n   */\n  toJSON({ id = ROOT_ID, maxLength = 32 }: { id?: string; maxLength?: number } = {}) {\n    const toJSON = (node: Node): any => {\n      const nodes = node.nodes();\n      const obj: Record<string, any> = {\n        id: node.id.length > maxLength ? `${node.id.slice(0, maxLength - 3)}...` : node.id,\n      };\n      if (node.properties.label) {\n        obj.label = node.properties.label;\n      }\n      if (nodes.length) {\n        obj.nodes = nodes.map((node) => toJSON(node));\n      }\n      return obj;\n    };\n\n    const root = this.findNode(id);\n    invariant(root, `Node not found: ${id}`);\n    return toJSON(root);\n  }\n\n  /**\n   * Find the node with the given id in the graph.\n   */\n  findNode(id: string): Node | undefined {\n    const nodeBase = this._nodes[id];\n    if (!nodeBase) {\n      return undefined;\n    }\n\n    return this._constructNode(nodeBase);\n  }\n\n  private _constructNode = (nodeBase: NodeBase): Node => {\n    const node: Node = {\n      ...nodeBase,\n      edges: ({ direction = 'outbound' } = {}) => {\n        return this._edges[this.getEdgeKey(node.id, direction)];\n      },\n      nodes: ({ direction, filter } = {}) => {\n        const nodes = this._getNodes({ id: node.id, direction }).filter((n) => !isActionLike(n));\n        return filter ? nodes.filter((n) => filter(n, node)) : nodes;\n      },\n      node: (id: string) => {\n        return this._getNodes({ id }).find((node) => node.id === id);\n      },\n      actions: () => {\n        return this._getNodes({ id: node.id }).filter(isActionLike);\n      },\n    };\n\n    return node;\n  };\n\n  private _getNodes({ id, direction = 'outbound' }: { id: string; direction?: EdgeDirection }): Node[] {\n    const edges = this._edges[this.getEdgeKey(id, direction)];\n    if (!edges) {\n      return [];\n    }\n\n    return edges.map((id) => this.findNode(id)).filter(nonNullable);\n  }\n\n  private getEdgeKey(id: string, direction: EdgeDirection) {\n    return `${id}-${direction}`;\n  }\n\n  /**\n   * Add nodes to the graph.\n   */\n  addNodes<TData = null, TProperties extends Record<string, any> = Record<string, any>>(\n    ...nodes: NodeArg<TData, TProperties>[]\n  ): Node<TData, TProperties>[] {\n    return nodes.map((node) => this._addNode(node));\n  }\n\n  private _addNode<TData, TProperties extends Record<string, any> = Record<string, any>>({\n    nodes,\n    edges,\n    ..._node\n  }: NodeArg<TData, TProperties>): Node<TData, TProperties> {\n    return untracked(() => {\n      const node = { data: null, properties: {}, ..._node };\n      this._nodes[node.id] = node;\n\n      if (nodes) {\n        nodes.forEach((subNode) => {\n          this._addNode(subNode);\n          this.addEdge({ source: node.id, target: subNode.id });\n        });\n      }\n\n      if (edges) {\n        edges.forEach(([id, direction]) =>\n          direction === 'outbound'\n            ? this.addEdge({ source: node.id, target: id })\n            : this.addEdge({ source: id, target: node.id }),\n        );\n      }\n\n      return this._constructNode(node) as Node<TData, TProperties>;\n    });\n  }\n\n  /**\n   * Remove nodes from the graph.\n   *\n   * @param id The id of the node to remove.\n   * @param edges Whether to remove edges connected to the node from the graph as well.\n   */\n  removeNode(id: string, edges = false) {\n    untracked(() => {\n      const node = this.findNode(id);\n      if (!node) {\n        return;\n      }\n\n      if (edges) {\n        // Remove edges from node.\n        delete this._edges[this.getEdgeKey(id, 'outbound')];\n        delete this._edges[this.getEdgeKey(id, 'inbound')];\n\n        // Remove edges from connected nodes.\n        this._getNodes({ id }).forEach((node) => this.removeEdge({ source: id, target: node.id }));\n        this._getNodes({ id, direction: 'inbound' }).forEach((node) =>\n          this.removeEdge({ source: node.id, target: id }),\n        );\n      }\n\n      // Remove node.\n      delete this._nodes[id];\n    });\n  }\n\n  /**\n   * Add an edge to the graph.\n   */\n  addEdge({ source, target }: { source: string; target: string }) {\n    untracked(() => {\n      const outbound = this._edges[this.getEdgeKey(source, 'outbound')];\n      if (!outbound) {\n        this._edges[this.getEdgeKey(source, 'outbound')] = [target];\n      } else if (!outbound.includes(target)) {\n        outbound.push(target);\n      }\n\n      const inbound = this._edges[this.getEdgeKey(target, 'inbound')];\n      if (!inbound) {\n        this._edges[this.getEdgeKey(target, 'inbound')] = [source];\n      } else if (!inbound.includes(source)) {\n        inbound.push(source);\n      }\n    });\n  }\n\n  /**\n   * Sort edges for a node.\n   *\n   * Edges not included in the sorted list are appended to the end of the list.\n   *\n   * @param nodeId The id of the node to sort edges for.\n   * @param direction The direction of the edges from the node to sort.\n   * @param edges The ordered list of edges.\n   */\n  sortEdges(nodeId: string, direction: EdgeDirection, edges: string[]) {\n    untracked(() => {\n      const current = this._edges[this.getEdgeKey(nodeId, direction)];\n      if (current) {\n        const unsorted = current.filter((id) => !edges.includes(id)) ?? [];\n        const sorted = edges.filter((id) => current.includes(id)) ?? [];\n        current.splice(0, current.length, ...[...sorted, ...unsorted]);\n      }\n    });\n  }\n\n  /**\n   * Remove an edge from the graph.\n   */\n  removeEdge({ source, target }: { source: string; target: string }) {\n    untracked(() => {\n      const outboundIndex = this._edges[this.getEdgeKey(source, 'outbound')]?.findIndex((id) => id === target);\n      if (outboundIndex !== -1) {\n        this._edges[this.getEdgeKey(source, 'outbound')].splice(outboundIndex, 1);\n      }\n\n      const inboundIndex = this._edges[this.getEdgeKey(target, 'inbound')]?.findIndex((id) => id === source);\n      if (inboundIndex !== -1) {\n        this._edges[this.getEdgeKey(target, 'inbound')].splice(inboundIndex, 1);\n      }\n    });\n  }\n\n  /**\n   * Recursive depth-first traversal.\n   *\n   * @param options.node The node to start traversing from.\n   * @param options.direction The direction to traverse graph edges.\n   * @param options.filter A predicate to filter nodes which are passed to the `visitor` callback.\n   * @param options.visitor A callback which is called for each node visited during traversal.\n   */\n  traverse({ node = this.root, direction = 'outbound', filter, visitor }: TraversalOptions, path: string[] = []): void {\n    // Break cycles.\n    if (path.includes(node.id)) {\n      return;\n    }\n\n    if (!filter || filter(node)) {\n      visitor?.(node, [...path, node.id]);\n    }\n\n    Object.values(this._getNodes({ id: node.id, direction })).forEach((child) =>\n      this.traverse({ node: child, direction, filter, visitor }, [...path, node.id]),\n    );\n  }\n\n  /**\n   * Get the path between two nodes in the graph.\n   */\n  getPath({ source = 'root', target }: { source?: string; target: string }): string[] | undefined {\n    const start = this.findNode(source);\n    if (!start) {\n      return undefined;\n    }\n\n    let found: string[] | undefined;\n    this.traverse({\n      node: start,\n      filter: () => !found,\n      visitor: (node, path) => {\n        if (node.id === target) {\n          found = path;\n        }\n      },\n    });\n\n    return found;\n  }\n}\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { type MaybePromise, type MakeOptional } from '@dxos/util';\n\n/**\n * Represents a node in the graph.\n */\n// TODO(wittjosiah): Use Effect Schema.\nexport type NodeBase<TData = any, TProperties extends Record<string, any> = Record<string, any>> = {\n  /**\n   * Globally unique ID.\n   */\n  id: string;\n\n  /**\n   * Properties of the node relevant to displaying the node.\n   */\n  properties: TProperties;\n\n  /**\n   * Data the node represents.\n   */\n  // TODO(burdon): Type system (e.g., minimally provide identifier string vs. TypedObject vs. Graph mixin type system)?\n  //  type field would prevent convoluted sniffing of object properties. And allow direct pass-through for ECHO TypedObjects.\n  data: TData;\n};\n\nexport type NodeFilter<T = any, U extends Record<string, any> = Record<string, any>> = (\n  node: Node<unknown, Record<string, any>>,\n  connectedNode: Node,\n) => node is Node<T, U>;\n\nexport type EdgeDirection = 'outbound' | 'inbound';\n\nexport type ConnectedNodes = {\n  /**\n   * Edges that this node is connected to in default order.\n   */\n  edges(params?: { direction?: EdgeDirection }): Readonly<string[]>;\n\n  /**\n   * Nodes that this node is connected to in default order.\n   */\n  nodes<T = any, U extends Record<string, any> = Record<string, any>>(params?: {\n    direction?: EdgeDirection;\n    filter?: NodeFilter<T, U>;\n  }): Node<T>[];\n\n  /**\n   * Get a specific connected node by id.\n   */\n  node(id: string): Node | undefined;\n};\n\nexport type ConnectedActions = {\n  /**\n   * Actions or action groups that this node is connected to in default order.\n   */\n  actions(): ActionLike[];\n};\n\nexport type Node<TData = any, TProperties extends Record<string, any> = Record<string, any>> = Readonly<\n  Omit<NodeBase<TData, TProperties>, 'properties'> & { properties: Readonly<TProperties> } & ConnectedNodes &\n    ConnectedActions\n>;\n\nexport const isGraphNode = (data: unknown): data is Node =>\n  data && typeof data === 'object' && 'id' in data && 'properties' in data && data.properties\n    ? typeof data.properties === 'object' && 'data' in data\n    : false;\n\nexport type NodeArg<TData, TProperties extends Record<string, any> = Record<string, any>> = MakeOptional<\n  NodeBase<TData, TProperties>,\n  'data' | 'properties'\n> & {\n  /** Will automatically add nodes with an edge from this node to each. */\n  nodes?: NodeArg<unknown>[];\n\n  /** Will automatically add specified edges. */\n  edges?: [string, EdgeDirection][];\n};\n\n//\n// Actions\n//\n\nexport type InvokeParams = {\n  /** Node the invoked action is connected to. */\n  node: Node;\n\n  caller?: string;\n};\n\nexport type ActionData = (params: InvokeParams) => MaybePromise<void>;\n\nexport type Action<TProperties extends Record<string, any> = Record<string, any>> = Readonly<\n  Omit<NodeBase<ActionData, TProperties>, 'properties'> & {\n    properties: Readonly<TProperties>;\n  } & ConnectedNodes\n>;\n\nexport const isAction = (data: unknown): data is Action =>\n  isGraphNode(data) ? typeof data.data === 'function' : false;\n\nexport const actionGroupSymbol = Symbol('ActionGroup');\n\nexport type ActionGroup = Readonly<\n  Omit<NodeBase<typeof actionGroupSymbol, Record<string, any>>, 'properties'> & {\n    properties: Readonly<Record<string, any>>;\n  } & ConnectedActions\n>;\n\nexport const isActionGroup = (data: unknown): data is ActionGroup =>\n  isGraphNode(data) ? data.data === actionGroupSymbol : false;\n\nexport type ActionLike = Action | ActionGroup;\n\nexport const isActionLike = (data: unknown): data is Action | ActionGroup => isAction(data) || isActionGroup(data);\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { EventSubscriptions, type UnsubscribeCallback } from '@dxos/async';\n\nimport { Graph } from './graph';\n\nexport type BuilderExtension = (graph: Graph) => UnsubscribeCallback | void;\n\n/**\n * The builder provides an extensible way to compose the construction of the graph.\n */\nexport class GraphBuilder {\n  private readonly _extensions = new Map<string, BuilderExtension>();\n  private readonly _unsubscribe = new EventSubscriptions();\n\n  /**\n   * Register a node builder which will be called in order to construct the graph.\n   */\n  addExtension(id: string, extension: BuilderExtension): GraphBuilder {\n    this._extensions.set(id, extension);\n    return this;\n  }\n\n  /**\n   * Remove a node builder from the graph builder.\n   */\n  removeExtension(id: string): GraphBuilder {\n    this._extensions.delete(id);\n    return this;\n  }\n\n  /**\n   * Construct the graph, starting by calling all registered extensions.\n   * @param previousGraph If provided, the graph will be updated in place.\n   */\n  build(previousGraph?: Graph): Graph {\n    // Clear previous extension subscriptions.\n    this._unsubscribe.clear();\n\n    const graph: Graph = previousGraph ?? new Graph();\n\n    Array.from(this._extensions.values()).forEach((builder) => {\n      const unsubscribe = builder(graph);\n      unsubscribe && this._unsubscribe.add(unsubscribe);\n    });\n\n    return graph;\n  }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { type Graph } from './graph';\nimport { type Node, type NodeArg } from './node';\n\n/**\n * If the condition is true, adds the nodes to the graph, otherwise removes the nodes from the graph.\n */\nexport const manageNodes = <TData = null, TProperties extends Record<string, any> = Record<string, any>>({\n  graph,\n  condition,\n  nodes,\n  removeEdges,\n}: {\n  graph: Graph;\n  condition: boolean;\n  nodes: NodeArg<TData, TProperties>[];\n  removeEdges?: boolean;\n}): Node<TData, TProperties>[] | void => {\n  if (condition) {\n    return graph.addNodes(...nodes);\n  } else {\n    nodes.forEach(({ id }) => graph.removeNode(id, removeEdges));\n  }\n};\n"],
-  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAIA,0BAA0B;AAE1B,yBAAuB;AACvB,uBAA0B;AAC1B,kBAA4B;AEJ5B,mBAA6D;ADgEtD,IAAMA,cAAc,CAACC,SAC1BA,QAAQ,OAAOA,SAAS,YAAY,QAAQA,QAAQ,gBAAgBA,QAAQA,KAAKC,aAC7E,OAAOD,KAAKC,eAAe,YAAY,UAAUD,OACjD;AAgCC,IAAME,WAAW,CAACF,SACvBD,YAAYC,IAAAA,IAAQ,OAAOA,KAAKA,SAAS,aAAa;AAEjD,IAAMG,oBAAoBC,OAAO,aAAA;AAQjC,IAAMC,gBAAgB,CAACL,SAC5BD,YAAYC,IAAAA,IAAQA,KAAKA,SAASG,oBAAoB;AAIjD,IAAMG,eAAe,CAACN,SAAgDE,SAASF,IAAAA,KAASK,cAAcL,IAAAA;;AD3GtG,IAAMO,UAAU;AA+BhB,IAAMC,QAAN,MAAMA;EAAN,cAAA;sBAIaC,2BAAiC;MACjD,CAACF,OAAAA,GAAU;QAAEG,IAAIH;QAASN,YAAY,CAAC;QAAGD,MAAM;MAAK;IACvD,CAAA;sBAOkBS,2BAAiC,CAAC,CAAA;AA4C5CE,SAAAA,iBAAiB,CAACC,aAAAA;AACxB,YAAMC,OAAa;QACjB,GAAGD;QACHE,OAAO,CAAC,EAAEC,YAAY,WAAU,IAAK,CAAC,MAAC;AACrC,iBAAO,KAAKC,OAAO,KAAKC,WAAWJ,KAAKH,IAAIK,SAAAA,CAAAA;QAC9C;QACAG,OAAO,CAAC,EAAEH,WAAWI,OAAM,IAAK,CAAC,MAAC;AAChC,gBAAMD,QAAQ,KAAKE,UAAU;YAAEV,IAAIG,KAAKH;YAAIK;UAAU,CAAA,EAAGI,OAAO,CAACE,MAAM,CAACf,aAAae,CAAAA,CAAAA;AACrF,iBAAOF,SAASD,MAAMC,OAAO,CAACE,MAAMF,OAAOE,GAAGR,IAAAA,CAAAA,IAASK;QACzD;QACAL,MAAM,CAACH,OAAAA;AACL,iBAAO,KAAKU,UAAU;YAAEV;UAAG,CAAA,EAAGY,KAAK,CAACT,UAASA,MAAKH,OAAOA,EAAAA;QAC3D;QACAa,SAAS,MAAA;AACP,iBAAO,KAAKH,UAAU;YAAEV,IAAIG,KAAKH;UAAG,CAAA,EAAGS,OAAOb,YAAAA;QAChD;MACF;AAEA,aAAOO;IACT;;;;;EA1DA,IAAIW,OAAO;AACT,WAAO,KAAKC,SAASlB,OAAAA;EACvB;;;;EAKAmB,OAAO,EAAEhB,KAAKH,SAASoB,YAAY,GAAE,IAA0C,CAAC,GAAG;AACjF,UAAMD,SAAS,CAACb,SAAAA;AACd,YAAMK,QAAQL,KAAKK,MAAK;AACxB,YAAMU,MAA2B;QAC/BlB,IAAIG,KAAKH,GAAGmB,SAASF,YAAY,GAAGd,KAAKH,GAAGoB,MAAM,GAAGH,YAAY,CAAA,CAAA,QAAUd,KAAKH;MAClF;AACA,UAAIG,KAAKZ,WAAW8B,OAAO;AACzBH,YAAIG,QAAQlB,KAAKZ,WAAW8B;MAC9B;AACA,UAAIb,MAAMW,QAAQ;AAChBD,YAAIV,QAAQA,MAAMc,IAAI,CAACnB,UAASa,OAAOb,KAAAA,CAAAA;MACzC;AACA,aAAOe;IACT;AAEA,UAAMJ,OAAO,KAAKC,SAASf,EAAAA;AAC3BuB,oCAAUT,MAAM,mBAAmBd,EAAAA,IAAI;;;;;;;;;AACvC,WAAOgB,OAAOF,IAAAA;EAChB;;;;EAKAC,SAASf,IAA8B;AACrC,UAAME,WAAW,KAAKsB,OAAOxB,EAAAA;AAC7B,QAAI,CAACE,UAAU;AACb,aAAOuB;IACT;AAEA,WAAO,KAAKxB,eAAeC,QAAAA;EAC7B;EAuBQQ,UAAU,EAAEV,IAAIK,YAAY,WAAU,GAAuD;AACnG,UAAMD,QAAQ,KAAKE,OAAO,KAAKC,WAAWP,IAAIK,SAAAA,CAAAA;AAC9C,QAAI,CAACD,OAAO;AACV,aAAO,CAAA;IACT;AAEA,WAAOA,MAAMkB,IAAI,CAACtB,QAAO,KAAKe,SAASf,GAAAA,CAAAA,EAAKS,OAAOiB,uBAAAA;EACrD;EAEQnB,WAAWP,IAAYK,WAA0B;AACvD,WAAO,GAAGL,EAAAA,IAAMK,SAAAA;EAClB;;;;EAKAsB,YACKnB,OACyB;AAC5B,WAAOA,MAAMc,IAAI,CAACnB,SAAS,KAAKyB,SAASzB,IAAAA,CAAAA;EAC3C;EAEQyB,SAA+E,EACrFpB,OACAJ,OACA,GAAGyB,MAAAA,GACqD;AACxD,eAAOC,+BAAU,MAAA;AACf,YAAM3B,OAAO;QAAEb,MAAM;QAAMC,YAAY,CAAC;QAAG,GAAGsC;MAAM;AACpD,WAAKL,OAAOrB,KAAKH,EAAE,IAAIG;AAEvB,UAAIK,OAAO;AACTA,cAAMuB,QAAQ,CAACC,YAAAA;AACb,eAAKJ,SAASI,OAAAA;AACd,eAAKC,QAAQ;YAAEC,QAAQ/B,KAAKH;YAAImC,QAAQH,QAAQhC;UAAG,CAAA;QACrD,CAAA;MACF;AAEA,UAAII,OAAO;AACTA,cAAM2B,QAAQ,CAAC,CAAC/B,IAAIK,SAAAA,MAClBA,cAAc,aACV,KAAK4B,QAAQ;UAAEC,QAAQ/B,KAAKH;UAAImC,QAAQnC;QAAG,CAAA,IAC3C,KAAKiC,QAAQ;UAAEC,QAAQlC;UAAImC,QAAQhC,KAAKH;QAAG,CAAA,CAAA;MAEnD;AAEA,aAAO,KAAKC,eAAeE,IAAAA;IAC7B,CAAA;EACF;;;;;;;EAQAiC,WAAWpC,IAAYI,QAAQ,OAAO;AACpC0B,uCAAU,MAAA;AACR,YAAM3B,OAAO,KAAKY,SAASf,EAAAA;AAC3B,UAAI,CAACG,MAAM;AACT;MACF;AAEA,UAAIC,OAAO;AAET,eAAO,KAAKE,OAAO,KAAKC,WAAWP,IAAI,UAAA,CAAA;AACvC,eAAO,KAAKM,OAAO,KAAKC,WAAWP,IAAI,SAAA,CAAA;AAGvC,aAAKU,UAAU;UAAEV;QAAG,CAAA,EAAG+B,QAAQ,CAAC5B,UAAS,KAAKkC,WAAW;UAAEH,QAAQlC;UAAImC,QAAQhC,MAAKH;QAAG,CAAA,CAAA;AACvF,aAAKU,UAAU;UAAEV;UAAIK,WAAW;QAAU,CAAA,EAAG0B,QAAQ,CAAC5B,UACpD,KAAKkC,WAAW;UAAEH,QAAQ/B,MAAKH;UAAImC,QAAQnC;QAAG,CAAA,CAAA;MAElD;AAGA,aAAO,KAAKwB,OAAOxB,EAAAA;IACrB,CAAA;EACF;;;;EAKAiC,QAAQ,EAAEC,QAAQC,OAAM,GAAwC;AAC9DL,uCAAU,MAAA;AACR,YAAMQ,WAAW,KAAKhC,OAAO,KAAKC,WAAW2B,QAAQ,UAAA,CAAA;AACrD,UAAI,CAACI,UAAU;AACb,aAAKhC,OAAO,KAAKC,WAAW2B,QAAQ,UAAA,CAAA,IAAe;UAACC;;MACtD,WAAW,CAACG,SAASC,SAASJ,MAAAA,GAAS;AACrCG,iBAASE,KAAKL,MAAAA;MAChB;AAEA,YAAMM,UAAU,KAAKnC,OAAO,KAAKC,WAAW4B,QAAQ,SAAA,CAAA;AACpD,UAAI,CAACM,SAAS;AACZ,aAAKnC,OAAO,KAAKC,WAAW4B,QAAQ,SAAA,CAAA,IAAc;UAACD;;MACrD,WAAW,CAACO,QAAQF,SAASL,MAAAA,GAAS;AACpCO,gBAAQD,KAAKN,MAAAA;MACf;IACF,CAAA;EACF;;;;;;;;;;EAWAQ,UAAUC,QAAgBtC,WAA0BD,OAAiB;AACnE0B,uCAAU,MAAA;AACR,YAAMc,UAAU,KAAKtC,OAAO,KAAKC,WAAWoC,QAAQtC,SAAAA,CAAAA;AACpD,UAAIuC,SAAS;AACX,cAAMC,WAAWD,QAAQnC,OAAO,CAACT,OAAO,CAACI,MAAMmC,SAASvC,EAAAA,CAAAA,KAAQ,CAAA;AAChE,cAAM8C,SAAS1C,MAAMK,OAAO,CAACT,OAAO4C,QAAQL,SAASvC,EAAAA,CAAAA,KAAQ,CAAA;AAC7D4C,gBAAQG,OAAO,GAAGH,QAAQzB,QAAM,GAAK;aAAI2B;aAAWD;SAAS;MAC/D;IACF,CAAA;EACF;;;;EAKAR,WAAW,EAAEH,QAAQC,OAAM,GAAwC;AACjEL,uCAAU,MAAA;AACR,YAAMkB,gBAAgB,KAAK1C,OAAO,KAAKC,WAAW2B,QAAQ,UAAA,CAAA,GAAce,UAAU,CAACjD,OAAOA,OAAOmC,MAAAA;AACjG,UAAIa,kBAAkB,IAAI;AACxB,aAAK1C,OAAO,KAAKC,WAAW2B,QAAQ,UAAA,CAAA,EAAaa,OAAOC,eAAe,CAAA;MACzE;AAEA,YAAME,eAAe,KAAK5C,OAAO,KAAKC,WAAW4B,QAAQ,SAAA,CAAA,GAAac,UAAU,CAACjD,OAAOA,OAAOkC,MAAAA;AAC/F,UAAIgB,iBAAiB,IAAI;AACvB,aAAK5C,OAAO,KAAKC,WAAW4B,QAAQ,SAAA,CAAA,EAAYY,OAAOG,cAAc,CAAA;MACvE;IACF,CAAA;EACF;;;;;;;;;EAUAC,SAAS,EAAEhD,OAAO,KAAKW,MAAMT,YAAY,YAAYI,QAAQ2C,QAAO,GAAsBC,OAAiB,CAAA,GAAU;AAEnH,QAAIA,KAAKd,SAASpC,KAAKH,EAAE,GAAG;AAC1B;IACF;AAEA,QAAI,CAACS,UAAUA,OAAON,IAAAA,GAAO;AAC3BiD,gBAAUjD,MAAM;WAAIkD;QAAMlD,KAAKH;OAAG;IACpC;AAEAsD,WAAOC,OAAO,KAAK7C,UAAU;MAAEV,IAAIG,KAAKH;MAAIK;IAAU,CAAA,CAAA,EAAI0B,QAAQ,CAACyB,UACjE,KAAKL,SAAS;MAAEhD,MAAMqD;MAAOnD;MAAWI;MAAQ2C;IAAQ,GAAG;SAAIC;MAAMlD,KAAKH;KAAG,CAAA;EAEjF;;;;EAKAyD,QAAQ,EAAEvB,SAAS,QAAQC,OAAM,GAA+D;AAC9F,UAAMuB,QAAQ,KAAK3C,SAASmB,MAAAA;AAC5B,QAAI,CAACwB,OAAO;AACV,aAAOjC;IACT;AAEA,QAAIkC;AACJ,SAAKR,SAAS;MACZhD,MAAMuD;MACNjD,QAAQ,MAAM,CAACkD;MACfP,SAAS,CAACjD,MAAMkD,SAAAA;AACd,YAAIlD,KAAKH,OAAOmC,QAAQ;AACtBwB,kBAAQN;QACV;MACF;IACF,CAAA;AAEA,WAAOM;EACT;AACF;AEnSO,IAAMC,eAAN,MAAMA;EAAN,cAAA;AACYC,SAAAA,cAAc,oBAAIC,IAAAA;AAClBC,SAAAA,eAAe,IAAIC,gCAAAA;;;;;EAKpCC,aAAajE,IAAYkE,WAA2C;AAClE,SAAKL,YAAYM,IAAInE,IAAIkE,SAAAA;AACzB,WAAO;EACT;;;;EAKAE,gBAAgBpE,IAA0B;AACxC,SAAK6D,YAAYQ,OAAOrE,EAAAA;AACxB,WAAO;EACT;;;;;EAMAsE,MAAMC,eAA8B;AAElC,SAAKR,aAAaS,MAAK;AAEvB,UAAMC,QAAeF,iBAAiB,IAAIzE,MAAAA;AAE1C4E,UAAMC,KAAK,KAAKd,YAAYN,OAAM,CAAA,EAAIxB,QAAQ,CAAC6C,YAAAA;AAC7C,YAAMC,cAAcD,QAAQH,KAAAA;AAC5BI,qBAAe,KAAKd,aAAae,IAAID,WAAAA;IACvC,CAAA;AAEA,WAAOJ;EACT;AACF;ACxCO,IAAMM,cAAc,CAA8E,EACvGN,OACAO,WACAxE,OACAyE,YAAW,MAMZ;AACC,MAAID,WAAW;AACb,WAAOP,MAAM9C,SAAQ,GAAInB,KAAAA;EAC3B,OAAO;AACLA,UAAMuB,QAAQ,CAAC,EAAE/B,GAAE,MAAOyE,MAAMrC,WAAWpC,IAAIiF,WAAAA,CAAAA;EACjD;AACF;",
-  "names": ["isGraphNode", "data", "properties", "isAction", "actionGroupSymbol", "Symbol", "isActionGroup", "isActionLike", "ROOT_ID", "Graph", "create", "id", "_constructNode", "nodeBase", "node", "edges", "direction", "_edges", "getEdgeKey", "nodes", "filter", "_getNodes", "n", "find", "actions", "root", "findNode", "toJSON", "maxLength", "obj", "length", "slice", "label", "map", "invariant", "_nodes", "undefined", "nonNullable", "addNodes", "_addNode", "_node", "untracked", "forEach", "subNode", "addEdge", "source", "target", "removeNode", "removeEdge", "outbound", "includes", "push", "inbound", "sortEdges", "nodeId", "current", "unsorted", "sorted", "splice", "outboundIndex", "findIndex", "inboundIndex", "traverse", "visitor", "path", "Object", "values", "child", "getPath", "start", "found", "GraphBuilder", "_extensions", "Map", "_unsubscribe", "EventSubscriptions", "addExtension", "extension", "set", "removeExtension", "delete", "build", "previousGraph", "clear", "graph", "Array", "from", "builder", "unsubscribe", "add", "manageNodes", "condition", "removeEdges"]
+  "sourcesContent": ["//\n// Copyright 2023 DXOS.org\n//\n\nimport { untracked } from '@preact/signals-core';\n\nimport { create } from '@dxos/echo-schema';\nimport { invariant } from '@dxos/invariant';\nimport { nonNullable } from '@dxos/util';\n\nimport { isActionLike, type EdgeDirection, type Node, type NodeArg, type NodeBase } from './node';\n\nexport const ROOT_ID = 'root';\n\nexport type TraversalOptions = {\n  /**\n   * The node to start traversing from.\n   *\n   * @default root\n   */\n  node?: Node;\n\n  /**\n   * The direction to traverse graph edges.\n   *\n   * @default 'outbound'\n   */\n  direction?: EdgeDirection;\n\n  /**\n   * A predicate to filter nodes which are passed to the `visitor` callback.\n   */\n  filter?: (node: Node) => boolean;\n\n  /**\n   * A callback which is called for each node visited during traversal.\n   */\n  visitor?: (node: Node, path: string[]) => void;\n};\n\n/**\n * The Graph represents the structure of the application constructed via plugins.\n */\nexport class Graph {\n  /**\n   * @internal\n   */\n  readonly _nodes = create<Record<string, NodeBase>>({\n    [ROOT_ID]: { id: ROOT_ID, properties: {}, data: null },\n  });\n\n  /**\n   * @internal\n   */\n  // Key is the `${node.id}-${direction}` and value is an ordered list of node ids.\n  // Explicit type required because TS says this is not portable.\n  readonly _edges = create<Record<string, string[]>>({});\n\n  /**\n   * Alias for `findNode('root')`.\n   */\n  get root() {\n    return this.findNode(ROOT_ID)!;\n  }\n\n  /**\n   * Convert the graph to a JSON object.\n   */\n  toJSON({ id = ROOT_ID, maxLength = 32 }: { id?: string; maxLength?: number } = {}) {\n    const toJSON = (node: Node, seen: string[] = []): any => {\n      const nodes = node.nodes();\n      const obj: Record<string, any> = {\n        id: node.id.length > maxLength ? `${node.id.slice(0, maxLength - 3)}...` : node.id,\n      };\n      if (node.properties.label) {\n        obj.label = node.properties.label;\n      }\n      if (nodes.length) {\n        obj.nodes = nodes\n          .map((n) => {\n            // Break cycles.\n            const nextSeen = [...seen, node.id];\n            return nextSeen.includes(n.id) ? undefined : toJSON(n, nextSeen);\n          })\n          .filter(nonNullable);\n      }\n      return obj;\n    };\n\n    const root = this.findNode(id);\n    invariant(root, `Node not found: ${id}`);\n    return toJSON(root);\n  }\n\n  /**\n   * Find the node with the given id in the graph.\n   */\n  findNode(id: string): Node | undefined {\n    const nodeBase = this._nodes[id];\n    if (!nodeBase) {\n      return undefined;\n    }\n\n    return this._constructNode(nodeBase);\n  }\n\n  private _constructNode = (nodeBase: NodeBase): Node => {\n    const node: Node = {\n      ...nodeBase,\n      edges: ({ direction = 'outbound' } = {}) => {\n        return this._edges[this.getEdgeKey(node.id, direction)];\n      },\n      nodes: ({ direction, filter } = {}) => {\n        const nodes = this._getNodes({ id: node.id, direction }).filter((n) => !isActionLike(n));\n        return filter ? nodes.filter((n) => filter(n, node)) : nodes;\n      },\n      node: (id: string) => {\n        return this._getNodes({ id }).find((node) => node.id === id);\n      },\n      actions: () => {\n        return this._getNodes({ id: node.id }).filter(isActionLike);\n      },\n    };\n\n    return node;\n  };\n\n  private _getNodes({ id, direction = 'outbound' }: { id: string; direction?: EdgeDirection }): Node[] {\n    const edges = this._edges[this.getEdgeKey(id, direction)];\n    if (!edges) {\n      return [];\n    }\n\n    return edges.map((id) => this.findNode(id)).filter(nonNullable);\n  }\n\n  private getEdgeKey(id: string, direction: EdgeDirection) {\n    return `${id}-${direction}`;\n  }\n\n  /**\n   * Add nodes to the graph.\n   */\n  addNodes<TData = null, TProperties extends Record<string, any> = Record<string, any>>(\n    ...nodes: NodeArg<TData, TProperties>[]\n  ): Node<TData, TProperties>[] {\n    return nodes.map((node) => this._addNode(node));\n  }\n\n  private _addNode<TData, TProperties extends Record<string, any> = Record<string, any>>({\n    nodes,\n    edges,\n    ..._node\n  }: NodeArg<TData, TProperties>): Node<TData, TProperties> {\n    return untracked(() => {\n      const node = { data: null, properties: {}, ..._node };\n      this._nodes[node.id] = node;\n\n      if (nodes) {\n        nodes.forEach((subNode) => {\n          this._addNode(subNode);\n          this.addEdge({ source: node.id, target: subNode.id });\n        });\n      }\n\n      if (edges) {\n        edges.forEach(([id, direction]) =>\n          direction === 'outbound'\n            ? this.addEdge({ source: node.id, target: id })\n            : this.addEdge({ source: id, target: node.id }),\n        );\n      }\n\n      return this._constructNode(node) as Node<TData, TProperties>;\n    });\n  }\n\n  /**\n   * Remove nodes from the graph.\n   *\n   * @param id The id of the node to remove.\n   * @param edges Whether to remove edges connected to the node from the graph as well.\n   */\n  removeNode(id: string, edges = false) {\n    untracked(() => {\n      const node = this.findNode(id);\n      if (!node) {\n        return;\n      }\n\n      if (edges) {\n        // Remove edges from node.\n        delete this._edges[this.getEdgeKey(id, 'outbound')];\n        delete this._edges[this.getEdgeKey(id, 'inbound')];\n\n        // Remove edges from connected nodes.\n        this._getNodes({ id }).forEach((node) => this.removeEdge({ source: id, target: node.id }));\n        this._getNodes({ id, direction: 'inbound' }).forEach((node) =>\n          this.removeEdge({ source: node.id, target: id }),\n        );\n      }\n\n      // Remove node.\n      delete this._nodes[id];\n    });\n  }\n\n  /**\n   * Add an edge to the graph.\n   */\n  addEdge({ source, target }: { source: string; target: string }) {\n    untracked(() => {\n      const outbound = this._edges[this.getEdgeKey(source, 'outbound')];\n      if (!outbound) {\n        this._edges[this.getEdgeKey(source, 'outbound')] = [target];\n      } else if (!outbound.includes(target)) {\n        outbound.push(target);\n      }\n\n      const inbound = this._edges[this.getEdgeKey(target, 'inbound')];\n      if (!inbound) {\n        this._edges[this.getEdgeKey(target, 'inbound')] = [source];\n      } else if (!inbound.includes(source)) {\n        inbound.push(source);\n      }\n    });\n  }\n\n  /**\n   * Sort edges for a node.\n   *\n   * Edges not included in the sorted list are appended to the end of the list.\n   *\n   * @param nodeId The id of the node to sort edges for.\n   * @param direction The direction of the edges from the node to sort.\n   * @param edges The ordered list of edges.\n   */\n  sortEdges(nodeId: string, direction: EdgeDirection, edges: string[]) {\n    untracked(() => {\n      const current = this._edges[this.getEdgeKey(nodeId, direction)];\n      if (current) {\n        const unsorted = current.filter((id) => !edges.includes(id)) ?? [];\n        const sorted = edges.filter((id) => current.includes(id)) ?? [];\n        current.splice(0, current.length, ...[...sorted, ...unsorted]);\n      }\n    });\n  }\n\n  /**\n   * Remove an edge from the graph.\n   */\n  removeEdge({ source, target }: { source: string; target: string }) {\n    untracked(() => {\n      const outboundIndex = this._edges[this.getEdgeKey(source, 'outbound')]?.findIndex((id) => id === target);\n      if (outboundIndex !== -1) {\n        this._edges[this.getEdgeKey(source, 'outbound')].splice(outboundIndex, 1);\n      }\n\n      const inboundIndex = this._edges[this.getEdgeKey(target, 'inbound')]?.findIndex((id) => id === source);\n      if (inboundIndex !== -1) {\n        this._edges[this.getEdgeKey(target, 'inbound')].splice(inboundIndex, 1);\n      }\n    });\n  }\n\n  /**\n   * Recursive depth-first traversal.\n   *\n   * @param options.node The node to start traversing from.\n   * @param options.direction The direction to traverse graph edges.\n   * @param options.filter A predicate to filter nodes which are passed to the `visitor` callback.\n   * @param options.visitor A callback which is called for each node visited during traversal.\n   */\n  traverse({ node = this.root, direction = 'outbound', filter, visitor }: TraversalOptions, path: string[] = []): void {\n    // Break cycles.\n    if (path.includes(node.id)) {\n      return;\n    }\n\n    if (!filter || filter(node)) {\n      visitor?.(node, [...path, node.id]);\n    }\n\n    Object.values(this._getNodes({ id: node.id, direction })).forEach((child) =>\n      this.traverse({ node: child, direction, filter, visitor }, [...path, node.id]),\n    );\n  }\n\n  /**\n   * Get the path between two nodes in the graph.\n   */\n  getPath({ source = 'root', target }: { source?: string; target: string }): string[] | undefined {\n    const start = this.findNode(source);\n    if (!start) {\n      return undefined;\n    }\n\n    let found: string[] | undefined;\n    this.traverse({\n      node: start,\n      filter: () => !found,\n      visitor: (node, path) => {\n        if (node.id === target) {\n          found = path;\n        }\n      },\n    });\n\n    return found;\n  }\n}\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { type MaybePromise, type MakeOptional } from '@dxos/util';\n\n/**\n * Represents a node in the graph.\n */\n// TODO(wittjosiah): Use Effect Schema.\nexport type NodeBase<TData = any, TProperties extends Record<string, any> = Record<string, any>> = {\n  /**\n   * Globally unique ID.\n   */\n  id: string;\n\n  /**\n   * Properties of the node relevant to displaying the node.\n   */\n  properties: TProperties;\n\n  /**\n   * Data the node represents.\n   */\n  // TODO(burdon): Type system (e.g., minimally provide identifier string vs. TypedObject vs. Graph mixin type system)?\n  //  type field would prevent convoluted sniffing of object properties. And allow direct pass-through for ECHO TypedObjects.\n  data: TData;\n};\n\nexport type NodeFilter<T = any, U extends Record<string, any> = Record<string, any>> = (\n  node: Node<unknown, Record<string, any>>,\n  connectedNode: Node,\n) => node is Node<T, U>;\n\nexport type EdgeDirection = 'outbound' | 'inbound';\n\nexport type ConnectedNodes = {\n  /**\n   * Edges that this node is connected to in default order.\n   */\n  edges(params?: { direction?: EdgeDirection }): Readonly<string[]>;\n\n  /**\n   * Nodes that this node is connected to in default order.\n   */\n  nodes<T = any, U extends Record<string, any> = Record<string, any>>(params?: {\n    direction?: EdgeDirection;\n    filter?: NodeFilter<T, U>;\n  }): Node<T>[];\n\n  /**\n   * Get a specific connected node by id.\n   */\n  node(id: string): Node | undefined;\n};\n\nexport type ConnectedActions = {\n  /**\n   * Actions or action groups that this node is connected to in default order.\n   */\n  actions(): ActionLike[];\n};\n\nexport type Node<TData = any, TProperties extends Record<string, any> = Record<string, any>> = Readonly<\n  Omit<NodeBase<TData, TProperties>, 'properties'> & { properties: Readonly<TProperties> } & ConnectedNodes &\n    ConnectedActions\n>;\n\nexport const isGraphNode = (data: unknown): data is Node =>\n  data && typeof data === 'object' && 'id' in data && 'properties' in data && data.properties\n    ? typeof data.properties === 'object' && 'data' in data\n    : false;\n\nexport type NodeArg<TData, TProperties extends Record<string, any> = Record<string, any>> = MakeOptional<\n  NodeBase<TData, TProperties>,\n  'data' | 'properties'\n> & {\n  /** Will automatically add nodes with an edge from this node to each. */\n  nodes?: NodeArg<unknown>[];\n\n  /** Will automatically add specified edges. */\n  edges?: [string, EdgeDirection][];\n};\n\n//\n// Actions\n//\n\nexport type InvokeParams = {\n  /** Node the invoked action is connected to. */\n  node: Node;\n\n  caller?: string;\n};\n\nexport type ActionData = (params: InvokeParams) => MaybePromise<void>;\n\nexport type Action<TProperties extends Record<string, any> = Record<string, any>> = Readonly<\n  Omit<NodeBase<ActionData, TProperties>, 'properties'> & {\n    properties: Readonly<TProperties>;\n  } & ConnectedNodes\n>;\n\nexport const isAction = (data: unknown): data is Action =>\n  isGraphNode(data) ? typeof data.data === 'function' : false;\n\nexport const actionGroupSymbol = Symbol('ActionGroup');\n\nexport type ActionGroup = Readonly<\n  Omit<NodeBase<typeof actionGroupSymbol, Record<string, any>>, 'properties'> & {\n    properties: Readonly<Record<string, any>>;\n  } & ConnectedActions\n>;\n\nexport const isActionGroup = (data: unknown): data is ActionGroup =>\n  isGraphNode(data) ? data.data === actionGroupSymbol : false;\n\nexport type ActionLike = Action | ActionGroup;\n\nexport const isActionLike = (data: unknown): data is Action | ActionGroup => isAction(data) || isActionGroup(data);\n", "//\n// Copyright 2023 DXOS.org\n//\n\nimport { EventSubscriptions, type UnsubscribeCallback } from '@dxos/async';\n\nimport { Graph } from './graph';\n\nexport type BuilderExtension = (graph: Graph) => UnsubscribeCallback | void;\n\n/**\n * The builder provides an extensible way to compose the construction of the graph.\n */\nexport class GraphBuilder {\n  private readonly _extensions = new Map<string, BuilderExtension>();\n  private readonly _unsubscribe = new EventSubscriptions();\n\n  /**\n   * Register a node builder which will be called in order to construct the graph.\n   */\n  addExtension(id: string, extension: BuilderExtension): GraphBuilder {\n    this._extensions.set(id, extension);\n    return this;\n  }\n\n  /**\n   * Remove a node builder from the graph builder.\n   */\n  removeExtension(id: string): GraphBuilder {\n    this._extensions.delete(id);\n    return this;\n  }\n\n  /**\n   * Construct the graph, starting by calling all registered extensions.\n   * @param previousGraph If provided, the graph will be updated in place.\n   */\n  build(previousGraph?: Graph): Graph {\n    // Clear previous extension subscriptions.\n    this._unsubscribe.clear();\n\n    const graph: Graph = previousGraph ?? new Graph();\n\n    Array.from(this._extensions.values()).forEach((builder) => {\n      const unsubscribe = builder(graph);\n      unsubscribe && this._unsubscribe.add(unsubscribe);\n    });\n\n    return graph;\n  }\n}\n", "//\n// Copyright 2024 DXOS.org\n//\n\nimport { type Graph } from './graph';\nimport { type Node, type NodeArg } from './node';\n\n/**\n * If the condition is true, adds the nodes to the graph, otherwise removes the nodes from the graph.\n */\nexport const manageNodes = <TData = null, TProperties extends Record<string, any> = Record<string, any>>({\n  graph,\n  condition,\n  nodes,\n  removeEdges,\n}: {\n  graph: Graph;\n  condition: boolean;\n  nodes: NodeArg<TData, TProperties>[];\n  removeEdges?: boolean;\n}): Node<TData, TProperties>[] | void => {\n  if (condition) {\n    return graph.addNodes(...nodes);\n  } else {\n    nodes.forEach(({ id }) => graph.removeNode(id, removeEdges));\n  }\n};\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAIA,0BAA0B;AAE1B,yBAAuB;AACvB,uBAA0B;AAC1B,kBAA4B;AEJ5B,mBAA6D;ADgEtD,IAAMA,cAAc,CAACC,SAC1BA,QAAQ,OAAOA,SAAS,YAAY,QAAQA,QAAQ,gBAAgBA,QAAQA,KAAKC,aAC7E,OAAOD,KAAKC,eAAe,YAAY,UAAUD,OACjD;AAgCC,IAAME,WAAW,CAACF,SACvBD,YAAYC,IAAAA,IAAQ,OAAOA,KAAKA,SAAS,aAAa;AAEjD,IAAMG,oBAAoBC,OAAO,aAAA;AAQjC,IAAMC,gBAAgB,CAACL,SAC5BD,YAAYC,IAAAA,IAAQA,KAAKA,SAASG,oBAAoB;AAIjD,IAAMG,eAAe,CAACN,SAAgDE,SAASF,IAAAA,KAASK,cAAcL,IAAAA;;AD3GtG,IAAMO,UAAU;AA+BhB,IAAMC,QAAN,MAAMA;EAAN,cAAA;sBAIaC,2BAAiC;MACjD,CAACF,OAAAA,GAAU;QAAEG,IAAIH;QAASN,YAAY,CAAC;QAAGD,MAAM;MAAK;IACvD,CAAA;sBAOkBS,2BAAiC,CAAC,CAAA;AAkD5CE,SAAAA,iBAAiB,CAACC,aAAAA;AACxB,YAAMC,OAAa;QACjB,GAAGD;QACHE,OAAO,CAAC,EAAEC,YAAY,WAAU,IAAK,CAAC,MAAC;AACrC,iBAAO,KAAKC,OAAO,KAAKC,WAAWJ,KAAKH,IAAIK,SAAAA,CAAAA;QAC9C;QACAG,OAAO,CAAC,EAAEH,WAAWI,OAAM,IAAK,CAAC,MAAC;AAChC,gBAAMD,QAAQ,KAAKE,UAAU;YAAEV,IAAIG,KAAKH;YAAIK;UAAU,CAAA,EAAGI,OAAO,CAACE,MAAM,CAACf,aAAae,CAAAA,CAAAA;AACrF,iBAAOF,SAASD,MAAMC,OAAO,CAACE,MAAMF,OAAOE,GAAGR,IAAAA,CAAAA,IAASK;QACzD;QACAL,MAAM,CAACH,OAAAA;AACL,iBAAO,KAAKU,UAAU;YAAEV;UAAG,CAAA,EAAGY,KAAK,CAACT,UAASA,MAAKH,OAAOA,EAAAA;QAC3D;QACAa,SAAS,MAAA;AACP,iBAAO,KAAKH,UAAU;YAAEV,IAAIG,KAAKH;UAAG,CAAA,EAAGS,OAAOb,YAAAA;QAChD;MACF;AAEA,aAAOO;IACT;;;;;EAhEA,IAAIW,OAAO;AACT,WAAO,KAAKC,SAASlB,OAAAA;EACvB;;;;EAKAmB,OAAO,EAAEhB,KAAKH,SAASoB,YAAY,GAAE,IAA0C,CAAC,GAAG;AACjF,UAAMD,SAAS,CAACb,MAAYe,OAAiB,CAAA,MAAE;AAC7C,YAAMV,QAAQL,KAAKK,MAAK;AACxB,YAAMW,MAA2B;QAC/BnB,IAAIG,KAAKH,GAAGoB,SAASH,YAAY,GAAGd,KAAKH,GAAGqB,MAAM,GAAGJ,YAAY,CAAA,CAAA,QAAUd,KAAKH;MAClF;AACA,UAAIG,KAAKZ,WAAW+B,OAAO;AACzBH,YAAIG,QAAQnB,KAAKZ,WAAW+B;MAC9B;AACA,UAAId,MAAMY,QAAQ;AAChBD,YAAIX,QAAQA,MACTe,IAAI,CAACZ,MAAAA;AAEJ,gBAAMa,WAAW;eAAIN;YAAMf,KAAKH;;AAChC,iBAAOwB,SAASC,SAASd,EAAEX,EAAE,IAAI0B,SAAYV,OAAOL,GAAGa,QAAAA;QACzD,CAAA,EACCf,OAAOkB,uBAAAA;MACZ;AACA,aAAOR;IACT;AAEA,UAAML,OAAO,KAAKC,SAASf,EAAAA;AAC3B4B,oCAAUd,MAAM,mBAAmBd,EAAAA,IAAI;;;;;;;;;AACvC,WAAOgB,OAAOF,IAAAA;EAChB;;;;EAKAC,SAASf,IAA8B;AACrC,UAAME,WAAW,KAAK2B,OAAO7B,EAAAA;AAC7B,QAAI,CAACE,UAAU;AACb,aAAOwB;IACT;AAEA,WAAO,KAAKzB,eAAeC,QAAAA;EAC7B;EAuBQQ,UAAU,EAAEV,IAAIK,YAAY,WAAU,GAAuD;AACnG,UAAMD,QAAQ,KAAKE,OAAO,KAAKC,WAAWP,IAAIK,SAAAA,CAAAA;AAC9C,QAAI,CAACD,OAAO;AACV,aAAO,CAAA;IACT;AAEA,WAAOA,MAAMmB,IAAI,CAACvB,QAAO,KAAKe,SAASf,GAAAA,CAAAA,EAAKS,OAAOkB,uBAAAA;EACrD;EAEQpB,WAAWP,IAAYK,WAA0B;AACvD,WAAO,GAAGL,EAAAA,IAAMK,SAAAA;EAClB;;;;EAKAyB,YACKtB,OACyB;AAC5B,WAAOA,MAAMe,IAAI,CAACpB,SAAS,KAAK4B,SAAS5B,IAAAA,CAAAA;EAC3C;EAEQ4B,SAA+E,EACrFvB,OACAJ,OACA,GAAG4B,MAAAA,GACqD;AACxD,eAAOC,+BAAU,MAAA;AACf,YAAM9B,OAAO;QAAEb,MAAM;QAAMC,YAAY,CAAC;QAAG,GAAGyC;MAAM;AACpD,WAAKH,OAAO1B,KAAKH,EAAE,IAAIG;AAEvB,UAAIK,OAAO;AACTA,cAAM0B,QAAQ,CAACC,YAAAA;AACb,eAAKJ,SAASI,OAAAA;AACd,eAAKC,QAAQ;YAAEC,QAAQlC,KAAKH;YAAIsC,QAAQH,QAAQnC;UAAG,CAAA;QACrD,CAAA;MACF;AAEA,UAAII,OAAO;AACTA,cAAM8B,QAAQ,CAAC,CAAClC,IAAIK,SAAAA,MAClBA,cAAc,aACV,KAAK+B,QAAQ;UAAEC,QAAQlC,KAAKH;UAAIsC,QAAQtC;QAAG,CAAA,IAC3C,KAAKoC,QAAQ;UAAEC,QAAQrC;UAAIsC,QAAQnC,KAAKH;QAAG,CAAA,CAAA;MAEnD;AAEA,aAAO,KAAKC,eAAeE,IAAAA;IAC7B,CAAA;EACF;;;;;;;EAQAoC,WAAWvC,IAAYI,QAAQ,OAAO;AACpC6B,uCAAU,MAAA;AACR,YAAM9B,OAAO,KAAKY,SAASf,EAAAA;AAC3B,UAAI,CAACG,MAAM;AACT;MACF;AAEA,UAAIC,OAAO;AAET,eAAO,KAAKE,OAAO,KAAKC,WAAWP,IAAI,UAAA,CAAA;AACvC,eAAO,KAAKM,OAAO,KAAKC,WAAWP,IAAI,SAAA,CAAA;AAGvC,aAAKU,UAAU;UAAEV;QAAG,CAAA,EAAGkC,QAAQ,CAAC/B,UAAS,KAAKqC,WAAW;UAAEH,QAAQrC;UAAIsC,QAAQnC,MAAKH;QAAG,CAAA,CAAA;AACvF,aAAKU,UAAU;UAAEV;UAAIK,WAAW;QAAU,CAAA,EAAG6B,QAAQ,CAAC/B,UACpD,KAAKqC,WAAW;UAAEH,QAAQlC,MAAKH;UAAIsC,QAAQtC;QAAG,CAAA,CAAA;MAElD;AAGA,aAAO,KAAK6B,OAAO7B,EAAAA;IACrB,CAAA;EACF;;;;EAKAoC,QAAQ,EAAEC,QAAQC,OAAM,GAAwC;AAC9DL,uCAAU,MAAA;AACR,YAAMQ,WAAW,KAAKnC,OAAO,KAAKC,WAAW8B,QAAQ,UAAA,CAAA;AACrD,UAAI,CAACI,UAAU;AACb,aAAKnC,OAAO,KAAKC,WAAW8B,QAAQ,UAAA,CAAA,IAAe;UAACC;;MACtD,WAAW,CAACG,SAAShB,SAASa,MAAAA,GAAS;AACrCG,iBAASC,KAAKJ,MAAAA;MAChB;AAEA,YAAMK,UAAU,KAAKrC,OAAO,KAAKC,WAAW+B,QAAQ,SAAA,CAAA;AACpD,UAAI,CAACK,SAAS;AACZ,aAAKrC,OAAO,KAAKC,WAAW+B,QAAQ,SAAA,CAAA,IAAc;UAACD;;MACrD,WAAW,CAACM,QAAQlB,SAASY,MAAAA,GAAS;AACpCM,gBAAQD,KAAKL,MAAAA;MACf;IACF,CAAA;EACF;;;;;;;;;;EAWAO,UAAUC,QAAgBxC,WAA0BD,OAAiB;AACnE6B,uCAAU,MAAA;AACR,YAAMa,UAAU,KAAKxC,OAAO,KAAKC,WAAWsC,QAAQxC,SAAAA,CAAAA;AACpD,UAAIyC,SAAS;AACX,cAAMC,WAAWD,QAAQrC,OAAO,CAACT,OAAO,CAACI,MAAMqB,SAASzB,EAAAA,CAAAA,KAAQ,CAAA;AAChE,cAAMgD,SAAS5C,MAAMK,OAAO,CAACT,OAAO8C,QAAQrB,SAASzB,EAAAA,CAAAA,KAAQ,CAAA;AAC7D8C,gBAAQG,OAAO,GAAGH,QAAQ1B,QAAM,GAAK;aAAI4B;aAAWD;SAAS;MAC/D;IACF,CAAA;EACF;;;;EAKAP,WAAW,EAAEH,QAAQC,OAAM,GAAwC;AACjEL,uCAAU,MAAA;AACR,YAAMiB,gBAAgB,KAAK5C,OAAO,KAAKC,WAAW8B,QAAQ,UAAA,CAAA,GAAcc,UAAU,CAACnD,OAAOA,OAAOsC,MAAAA;AACjG,UAAIY,kBAAkB,IAAI;AACxB,aAAK5C,OAAO,KAAKC,WAAW8B,QAAQ,UAAA,CAAA,EAAaY,OAAOC,eAAe,CAAA;MACzE;AAEA,YAAME,eAAe,KAAK9C,OAAO,KAAKC,WAAW+B,QAAQ,SAAA,CAAA,GAAaa,UAAU,CAACnD,OAAOA,OAAOqC,MAAAA;AAC/F,UAAIe,iBAAiB,IAAI;AACvB,aAAK9C,OAAO,KAAKC,WAAW+B,QAAQ,SAAA,CAAA,EAAYW,OAAOG,cAAc,CAAA;MACvE;IACF,CAAA;EACF;;;;;;;;;EAUAC,SAAS,EAAElD,OAAO,KAAKW,MAAMT,YAAY,YAAYI,QAAQ6C,QAAO,GAAsBC,OAAiB,CAAA,GAAU;AAEnH,QAAIA,KAAK9B,SAAStB,KAAKH,EAAE,GAAG;AAC1B;IACF;AAEA,QAAI,CAACS,UAAUA,OAAON,IAAAA,GAAO;AAC3BmD,gBAAUnD,MAAM;WAAIoD;QAAMpD,KAAKH;OAAG;IACpC;AAEAwD,WAAOC,OAAO,KAAK/C,UAAU;MAAEV,IAAIG,KAAKH;MAAIK;IAAU,CAAA,CAAA,EAAI6B,QAAQ,CAACwB,UACjE,KAAKL,SAAS;MAAElD,MAAMuD;MAAOrD;MAAWI;MAAQ6C;IAAQ,GAAG;SAAIC;MAAMpD,KAAKH;KAAG,CAAA;EAEjF;;;;EAKA2D,QAAQ,EAAEtB,SAAS,QAAQC,OAAM,GAA+D;AAC9F,UAAMsB,QAAQ,KAAK7C,SAASsB,MAAAA;AAC5B,QAAI,CAACuB,OAAO;AACV,aAAOlC;IACT;AAEA,QAAImC;AACJ,SAAKR,SAAS;MACZlD,MAAMyD;MACNnD,QAAQ,MAAM,CAACoD;MACfP,SAAS,CAACnD,MAAMoD,SAAAA;AACd,YAAIpD,KAAKH,OAAOsC,QAAQ;AACtBuB,kBAAQN;QACV;MACF;IACF,CAAA;AAEA,WAAOM;EACT;AACF;AEzSO,IAAMC,eAAN,MAAMA;EAAN,cAAA;AACYC,SAAAA,cAAc,oBAAIC,IAAAA;AAClBC,SAAAA,eAAe,IAAIC,gCAAAA;;;;;EAKpCC,aAAanE,IAAYoE,WAA2C;AAClE,SAAKL,YAAYM,IAAIrE,IAAIoE,SAAAA;AACzB,WAAO;EACT;;;;EAKAE,gBAAgBtE,IAA0B;AACxC,SAAK+D,YAAYQ,OAAOvE,EAAAA;AACxB,WAAO;EACT;;;;;EAMAwE,MAAMC,eAA8B;AAElC,SAAKR,aAAaS,MAAK;AAEvB,UAAMC,QAAeF,iBAAiB,IAAI3E,MAAAA;AAE1C8E,UAAMC,KAAK,KAAKd,YAAYN,OAAM,CAAA,EAAIvB,QAAQ,CAAC4C,YAAAA;AAC7C,YAAMC,cAAcD,QAAQH,KAAAA;AAC5BI,qBAAe,KAAKd,aAAae,IAAID,WAAAA;IACvC,CAAA;AAEA,WAAOJ;EACT;AACF;ACxCO,IAAMM,cAAc,CAA8E,EACvGN,OACAO,WACA1E,OACA2E,YAAW,MAMZ;AACC,MAAID,WAAW;AACb,WAAOP,MAAM7C,SAAQ,GAAItB,KAAAA;EAC3B,OAAO;AACLA,UAAM0B,QAAQ,CAAC,EAAElC,GAAE,MAAO2E,MAAMpC,WAAWvC,IAAImF,WAAAA,CAAAA;EACjD;AACF;",
+  "names": ["isGraphNode", "data", "properties", "isAction", "actionGroupSymbol", "Symbol", "isActionGroup", "isActionLike", "ROOT_ID", "Graph", "create", "id", "_constructNode", "nodeBase", "node", "edges", "direction", "_edges", "getEdgeKey", "nodes", "filter", "_getNodes", "n", "find", "actions", "root", "findNode", "toJSON", "maxLength", "seen", "obj", "length", "slice", "label", "map", "nextSeen", "includes", "undefined", "nonNullable", "invariant", "_nodes", "addNodes", "_addNode", "_node", "untracked", "forEach", "subNode", "addEdge", "source", "target", "removeNode", "removeEdge", "outbound", "push", "inbound", "sortEdges", "nodeId", "current", "unsorted", "sorted", "splice", "outboundIndex", "findIndex", "inboundIndex", "traverse", "visitor", "path", "Object", "values", "child", "getPath", "start", "found", "GraphBuilder", "_extensions", "Map", "_unsubscribe", "EventSubscriptions", "addExtension", "extension", "set", "removeExtension", "delete", "build", "previousGraph", "clear", "graph", "Array", "from", "builder", "unsubscribe", "add", "manageNodes", "condition", "removeEdges"]
 }

package/dist/lib/node/meta.json

@@ -1 +1 @@
-{"inputs":{"packages/sdk/app-graph/src/node.ts":{"bytes":6447,"imports":[],"format":"esm"},"packages/sdk/app-graph/src/graph.ts":{"bytes":30735,"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"},"packages/sdk/app-graph/src/graph-builder.ts":{"bytes":4684,"imports":[{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"}],"format":"esm"},"packages/sdk/app-graph/src/helpers.ts":{"bytes":2079,"imports":[],"format":"esm"},"packages/sdk/app-graph/src/index.ts":{"bytes":759,"imports":[{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"packages/sdk/app-graph/src/graph-builder.ts","kind":"import-statement","original":"./graph-builder"},{"path":"packages/sdk/app-graph/src/helpers.ts","kind":"import-statement","original":"./helpers"},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"}},"outputs":{"packages/sdk/app-graph/dist/lib/node/index.cjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":22525},"packages/sdk/app-graph/dist/lib/node/index.cjs":{"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true}],"exports":["Graph","GraphBuilder","ROOT_ID","actionGroupSymbol","isAction","isActionGroup","isActionLike","isGraphNode","manageNodes"],"entryPoint":"packages/sdk/app-graph/src/index.ts","inputs":{"packages/sdk/app-graph/src/graph.ts":{"bytesInOutput":7674},"packages/sdk/app-graph/src/node.ts":{"bytesInOutput":477},"packages/sdk/app-graph/src/index.ts":{"bytesInOutput":0},"packages/sdk/app-graph/src/graph-builder.ts":{"bytesInOutput":983},"packages/sdk/app-graph/src/helpers.ts":{"bytesInOutput":206}},"bytes":9726}}}
+{"inputs":{"packages/sdk/app-graph/src/node.ts":{"bytes":6447,"imports":[],"format":"esm"},"packages/sdk/app-graph/src/graph.ts":{"bytes":31580,"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"},"packages/sdk/app-graph/src/graph-builder.ts":{"bytes":4684,"imports":[{"path":"@dxos/async","kind":"import-statement","external":true},{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"}],"format":"esm"},"packages/sdk/app-graph/src/helpers.ts":{"bytes":2079,"imports":[],"format":"esm"},"packages/sdk/app-graph/src/index.ts":{"bytes":759,"imports":[{"path":"packages/sdk/app-graph/src/graph.ts","kind":"import-statement","original":"./graph"},{"path":"packages/sdk/app-graph/src/graph-builder.ts","kind":"import-statement","original":"./graph-builder"},{"path":"packages/sdk/app-graph/src/helpers.ts","kind":"import-statement","original":"./helpers"},{"path":"packages/sdk/app-graph/src/node.ts","kind":"import-statement","original":"./node"}],"format":"esm"}},"outputs":{"packages/sdk/app-graph/dist/lib/node/index.cjs.map":{"imports":[],"exports":[],"inputs":{},"bytes":22904},"packages/sdk/app-graph/dist/lib/node/index.cjs":{"imports":[{"path":"@preact/signals-core","kind":"import-statement","external":true},{"path":"@dxos/echo-schema","kind":"import-statement","external":true},{"path":"@dxos/invariant","kind":"import-statement","external":true},{"path":"@dxos/util","kind":"import-statement","external":true},{"path":"@dxos/async","kind":"import-statement","external":true}],"exports":["Graph","GraphBuilder","ROOT_ID","actionGroupSymbol","isAction","isActionGroup","isActionLike","isGraphNode","manageNodes"],"entryPoint":"packages/sdk/app-graph/src/index.ts","inputs":{"packages/sdk/app-graph/src/graph.ts":{"bytesInOutput":7855},"packages/sdk/app-graph/src/node.ts":{"bytesInOutput":477},"packages/sdk/app-graph/src/index.ts":{"bytesInOutput":0},"packages/sdk/app-graph/src/graph-builder.ts":{"bytesInOutput":983},"packages/sdk/app-graph/src/helpers.ts":{"bytesInOutput":206}},"bytes":9907}}}

package/dist/types/src/graph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../../src/graph.ts"],"names":[],"mappings":"AAUA,OAAO,EAAgB,KAAK,aAAa,EAAE,KAAK,IAAI,EAAE,KAAK,OAAO,EAAE,KAAK,QAAQ,EAAE,MAAM,QAAQ,CAAC;AAElG,eAAO,MAAM,OAAO,SAAS,CAAC;AAE9B,MAAM,MAAM,gBAAgB,GAAG;IAC7B;;;;OAIG;IACH,IAAI,CAAC,EAAE,IAAI,CAAC;IAEZ;;;;OAIG;IACH,SAAS,CAAC,EAAE,aAAa,CAAC;IAE1B;;OAEG;IACH,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,OAAO,CAAC;IAEjC;;OAEG;IACH,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,IAAI,CAAC;CAChD,CAAC;AAEF;;GAEG;AACH,qBAAa,KAAK;IAehB;;OAEG;IACH,IAAI,IAAI;;6EAEP;IAED;;OAEG;IACH,MAAM,CAAC,EAAE,EAAY,EAAE,SAAc,EAAE,GAAE;QAAE,EAAE,CAAC,EAAE,MAAM,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,CAAA;KAAO;IAoBjF;;OAEG;IACH,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS;IAStC,OAAO,CAAC,cAAc,CAmBpB;IAEF,OAAO,CAAC,SAAS;IASjB,OAAO,CAAC,UAAU;IAIlB;;OAEG;IACH,QAAQ,CAAC,KAAK,GAAG,IAAI,EAAE,WAAW,SAAS,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAClF,GAAG,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,WAAW,CAAC,EAAE,GACtC,IAAI,CAAC,KAAK,EAAE,WAAW,CAAC,EAAE;IAI7B,OAAO,CAAC,QAAQ;IA4BhB;;;;;OAKG;IACH,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,UAAQ;IAwBpC;;OAEG;IACH,OAAO,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE;IAkB9D;;;;;;;;OAQG;IACH,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,EAAE;IAWnE;;OAEG;IACH,UAAU,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE;IAcjE;;;;;;;OAOG;IACH,QAAQ,CAAC,EAAE,IAAgB,EAAE,SAAsB,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,gBAAgB,EAAE,IAAI,GAAE,MAAM,EAAO,GAAG,IAAI;IAepH;;OAEG;IACH,OAAO,CAAC,EAAE,MAAe,EAAE,MAAM,EAAE,EAAE;QAAE,MAAM,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,GAAG,MAAM,EAAE,GAAG,SAAS;CAmBhG"}
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../../src/graph.ts"],"names":[],"mappings":"AAUA,OAAO,EAAgB,KAAK,aAAa,EAAE,KAAK,IAAI,EAAE,KAAK,OAAO,EAAE,KAAK,QAAQ,EAAE,MAAM,QAAQ,CAAC;AAElG,eAAO,MAAM,OAAO,SAAS,CAAC;AAE9B,MAAM,MAAM,gBAAgB,GAAG;IAC7B;;;;OAIG;IACH,IAAI,CAAC,EAAE,IAAI,CAAC;IAEZ;;;;OAIG;IACH,SAAS,CAAC,EAAE,aAAa,CAAC;IAE1B;;OAEG;IACH,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,OAAO,CAAC;IAEjC;;OAEG;IACH,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,IAAI,CAAC;CAChD,CAAC;AAEF;;GAEG;AACH,qBAAa,KAAK;IAehB;;OAEG;IACH,IAAI,IAAI;;6EAEP;IAED;;OAEG;IACH,MAAM,CAAC,EAAE,EAAY,EAAE,SAAc,EAAE,GAAE;QAAE,EAAE,CAAC,EAAE,MAAM,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,CAAA;KAAO;IA0BjF;;OAEG;IACH,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS;IAStC,OAAO,CAAC,cAAc,CAmBpB;IAEF,OAAO,CAAC,SAAS;IASjB,OAAO,CAAC,UAAU;IAIlB;;OAEG;IACH,QAAQ,CAAC,KAAK,GAAG,IAAI,EAAE,WAAW,SAAS,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,EAClF,GAAG,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,WAAW,CAAC,EAAE,GACtC,IAAI,CAAC,KAAK,EAAE,WAAW,CAAC,EAAE;IAI7B,OAAO,CAAC,QAAQ;IA4BhB;;;;;OAKG;IACH,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,UAAQ;IAwBpC;;OAEG;IACH,OAAO,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE;IAkB9D;;;;;;;;OAQG;IACH,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,EAAE;IAWnE;;OAEG;IACH,UAAU,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE;IAcjE;;;;;;;OAOG;IACH,QAAQ,CAAC,EAAE,IAAgB,EAAE,SAAsB,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,gBAAgB,EAAE,IAAI,GAAE,MAAM,EAAO,GAAG,IAAI;IAepH;;OAEG;IACH,OAAO,CAAC,EAAE,MAAe,EAAE,MAAM,EAAE,EAAE;QAAE,MAAM,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,GAAG,MAAM,EAAE,GAAG,SAAS;CAmBhG"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@dxos/app-graph",
-  "version": "0.5.9-next.a50ff17",
+  "version": "0.6.0",
   "description": "Constructs knowledge graphs for the purpose of building applications on top of",
   "homepage": "https://dxos.org",
   "bugs": "https://github.com/dxos/dxos/issues",
@@ -21,12 +21,12 @@
   ],
   "dependencies": {
     "@preact/signals-core": "^1.6.0",
-    "@dxos/async": "0.5.9-next.a50ff17",
-    "@dxos/debug": "0.5.9-next.a50ff17",
-    "@dxos/echo-signals": "0.5.9-next.a50ff17",
-    "@dxos/echo-schema": "0.5.9-next.a50ff17",
-    "@dxos/util": "0.5.9-next.a50ff17",
-    "@dxos/invariant": "0.5.9-next.a50ff17"
+    "@dxos/async": "0.6.0",
+    "@dxos/echo-schema": "0.6.0",
+    "@dxos/echo-signals": "0.6.0",
+    "@dxos/debug": "0.6.0",
+    "@dxos/invariant": "0.6.0",
+    "@dxos/util": "0.6.0"
   },
   "devDependencies": {
     "@phosphor-icons/react": "^2.1.5",
@@ -35,11 +35,11 @@
     "react": "^18.2.0",
     "react-dom": "^18.2.0",
     "vite": "^5.2.9",
-    "@dxos/random": "0.5.9-next.a50ff17",
-    "@dxos/react-client": "0.5.9-next.a50ff17",
-    "@dxos/react-ui": "0.5.9-next.a50ff17",
-    "@dxos/react-ui-theme": "0.5.9-next.a50ff17",
-    "@dxos/storybook-utils": "0.5.9-next.a50ff17"
+    "@dxos/random": "0.6.0",
+    "@dxos/react-client": "0.6.0",
+    "@dxos/react-ui": "0.6.0",
+    "@dxos/react-ui-theme": "0.6.0",
+    "@dxos/storybook-utils": "0.6.0"
   },
   "peerDependencies": {
     "react": "^18.2.0",

package/src/graph.ts

@@ -67,7 +67,7 @@ export class Graph {
    * Convert the graph to a JSON object.
    */
   toJSON({ id = ROOT_ID, maxLength = 32 }: { id?: string; maxLength?: number } = {}) {
-    const toJSON = (node: Node): any => {
+    const toJSON = (node: Node, seen: string[] = []): any => {
       const nodes = node.nodes();
       const obj: Record<string, any> = {
         id: node.id.length > maxLength ? `${node.id.slice(0, maxLength - 3)}...` : node.id,
@@ -76,7 +76,13 @@ export class Graph {
         obj.label = node.properties.label;
       }
       if (nodes.length) {
-        obj.nodes = nodes.map((node) => toJSON(node));
+        obj.nodes = nodes
+          .map((n) => {
+            // Break cycles.
+            const nextSeen = [...seen, node.id];
+            return nextSeen.includes(n.id) ? undefined : toJSON(n, nextSeen);
+          })
+          .filter(nonNullable);
       }
       return obj;
     };