@rsconcept/domain 1.0.0 → 1.2.0

package/dist/graph/graph.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../src/graph/graph.ts"],"sourcesContent":["/**\n * Module: Custom graph data structure.\n */\n\n/** Represents single node of a {@link Graph}, as implemented by storing outgoing and incoming connections. */\nexport class GraphNode<NodeID> {\n  /** Unique identifier of the node. */\n  id: NodeID;\n  /** List of outgoing nodes. */\n  outputs: NodeID[];\n  /** List of incoming nodes. */\n  inputs: NodeID[];\n\n  constructor(id: NodeID) {\n    this.id = id;\n    this.outputs = [];\n    this.inputs = [];\n  }\n\n  clone(): GraphNode<NodeID> {\n    const result = new GraphNode(this.id);\n    result.outputs = [...this.outputs];\n    result.inputs = [...this.inputs];\n    return result;\n  }\n\n  addOutput(node: NodeID): void {\n    this.outputs.push(node);\n  }\n\n  addInput(node: NodeID): void {\n    this.inputs.push(node);\n  }\n\n  removeInput(target: NodeID): NodeID | null {\n    const index = this.inputs.findIndex(node => node === target);\n    return index > -1 ? this.inputs.splice(index, 1)[0] : null;\n  }\n\n  removeOutput(target: NodeID): NodeID | null {\n    const index = this.outputs.findIndex(node => node === target);\n    return index > -1 ? this.outputs.splice(index, 1)[0] : null;\n  }\n}\n\n/**\n * Represents a Graph.\n *\n * This class is optimized for TermGraph use case and not supposed to be used as generic graph implementation.\n */\nexport class Graph<NodeID = number> {\n  /** Map of nodes. */\n  nodes = new Map<NodeID, GraphNode<NodeID>>();\n\n  constructor(arr?: NodeID[][]) {\n    if (!arr) {\n      return;\n    }\n    arr.forEach(edge => {\n      if (edge.length === 1) {\n        this.addNode(edge[0]);\n      } else {\n        this.addEdge(edge[0], edge[1]);\n      }\n    });\n  }\n\n  clone(): Graph<NodeID> {\n    const result = new Graph<NodeID>();\n    this.nodes.forEach(node => result.nodes.set(node.id, node.clone()));\n    return result;\n  }\n\n  at(target: NodeID): GraphNode<NodeID> | undefined {\n    return this.nodes.get(target);\n  }\n\n  addNode(target: NodeID): GraphNode<NodeID> {\n    let node = this.nodes.get(target);\n    if (!node) {\n      node = new GraphNode(target);\n      this.nodes.set(target, node);\n    }\n    return node;\n  }\n\n  hasNode(target: NodeID): boolean {\n    return !!this.nodes.get(target);\n  }\n\n  removeNode(target: NodeID): void {\n    this.nodes.forEach(node => {\n      node.removeInput(target);\n      node.removeOutput(target);\n    });\n    this.nodes.delete(target);\n  }\n\n  foldNode(target: NodeID): void {\n    const nodeToRemove = this.nodes.get(target);\n    if (!nodeToRemove) {\n      return;\n    }\n    nodeToRemove.inputs.forEach(input => {\n      nodeToRemove.outputs.forEach(output => {\n        this.addEdge(input, output);\n      });\n    });\n    this.removeNode(target);\n  }\n\n  removeIsolated(): GraphNode<NodeID>[] {\n    const result: GraphNode<NodeID>[] = [];\n    this.nodes.forEach(node => {\n      if (node.outputs.length === 0 && node.inputs.length === 0) {\n        result.push(node);\n        this.nodes.delete(node.id);\n      }\n    });\n    return result;\n  }\n\n  addEdge(source: NodeID, destination: NodeID): void {\n    if (this.hasEdge(source, destination)) {\n      return;\n    }\n    const sourceNode = this.addNode(source);\n    const destinationNode = this.addNode(destination);\n    sourceNode.addOutput(destinationNode.id);\n    destinationNode.addInput(sourceNode.id);\n  }\n\n  removeEdge(source: NodeID, destination: NodeID): void {\n    const sourceNode = this.nodes.get(source);\n    const destinationNode = this.nodes.get(destination);\n    if (sourceNode && destinationNode) {\n      sourceNode.removeOutput(destination);\n      destinationNode.removeInput(source);\n    }\n  }\n\n  hasEdge(source: NodeID, destination: NodeID): boolean {\n    const sourceNode = this.nodes.get(source);\n    if (!sourceNode) {\n      return false;\n    }\n    return !!sourceNode.outputs.find(id => id === destination);\n  }\n\n  isReachable(source: NodeID, destination: NodeID): boolean {\n    return this.expandAllOutputs([source]).includes(destination);\n  }\n\n  rootNodes(): NodeID[] {\n    return [...this.nodes.keys()].filter(id => !this.nodes.get(id)?.inputs.length);\n  }\n\n  expandOutputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = [];\n    origin.forEach(id => {\n      const node = this.nodes.get(id);\n      if (node) {\n        node.outputs.forEach(child => {\n          if (!origin.includes(child) && !result.includes(child)) {\n            result.push(child);\n          }\n        });\n      }\n    });\n    return result;\n  }\n\n  expandInputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = [];\n    origin.forEach(id => {\n      const node = this.nodes.get(id);\n      if (node) {\n        node.inputs.forEach(child => {\n          if (!origin.includes(child) && !result.includes(child)) {\n            result.push(child);\n          }\n        });\n      }\n    });\n    return result;\n  }\n\n  expandAllOutputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = this.expandOutputs(origin);\n    if (result.length === 0) {\n      return [];\n    }\n\n    const marked = new Map<NodeID, boolean>();\n    origin.forEach(id => marked.set(id, true));\n    let position = 0;\n    while (position < result.length) {\n      const node = this.nodes.get(result[position]);\n      if (node && !marked.get(node.id)) {\n        marked.set(node.id, true);\n        node.outputs.forEach(child => {\n          if (!marked.get(child) && !result.find(id => id === child)) {\n            result.push(child);\n          }\n        });\n      }\n      position += 1;\n    }\n    return result;\n  }\n\n  expandAllInputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = this.expandInputs(origin);\n    if (result.length === 0) {\n      return [];\n    }\n\n    const marked = new Map<NodeID, boolean>();\n    origin.forEach(id => marked.set(id, true));\n    let position = 0;\n    while (position < result.length) {\n      const node = this.nodes.get(result[position]);\n      if (node && !marked.get(node.id)) {\n        marked.set(node.id, true);\n        node.inputs.forEach(child => {\n          if (!marked.get(child) && !result.find(id => id === child)) {\n            result.push(child);\n          }\n        });\n      }\n      position += 1;\n    }\n    return result;\n  }\n\n  maximizePart(origin: NodeID[]): NodeID[] {\n    const outputs: NodeID[] = this.expandAllOutputs(origin);\n    const result = [...origin];\n    this.topologicalOrder()\n      .filter(id => outputs.includes(id))\n      .forEach(id => {\n        const node = this.nodes.get(id);\n        if (node?.inputs.every(parent => result.includes(parent))) {\n          result.push(id);\n        }\n      });\n    return result;\n  }\n\n  topologicalOrder(): NodeID[] {\n    const result: NodeID[] = [];\n    const marked = new Set<NodeID>();\n    const nodeStack: NodeID[] = [];\n    this.nodes.forEach(node => {\n      if (marked.has(node.id)) {\n        return;\n      }\n      nodeStack.push(node.id);\n      while (nodeStack.length > 0) {\n        const item = nodeStack[nodeStack.length - 1];\n        if (marked.has(item)) {\n          if (!result.find(id => id === item)) {\n            result.push(item);\n          }\n          nodeStack.pop();\n        } else {\n          marked.add(item);\n          const itemNode = this.nodes.get(item);\n          if (itemNode && itemNode.outputs.length > 0) {\n            itemNode.outputs.forEach(child => {\n              if (!marked.has(child)) {\n                nodeStack.push(child);\n              }\n            });\n          }\n        }\n      }\n    });\n    return result.reverse();\n  }\n\n  /**\n   * Stably reorders the given node ids so that, for this DAG, no node appears before a transitive\n   * successor (edges: source → dependent; {@link GraphNode.outputs} lists dependents).\n   */\n  sortStable(target: NodeID[]): NodeID[] {\n    if (target.length <= 1) {\n      return [...target];\n    }\n\n    const reachable = this.buildTransitiveClosureForSort();\n    const testSet = new Set<NodeID>();\n    const result: NodeID[] = [];\n\n    for (const nodeId of [...target].reverse()) {\n      const nodeReachable = reachable.get(nodeId) ?? new Set<NodeID>();\n      const needMove = testSet.has(nodeId);\n      for (const childId of nodeReachable) {\n        testSet.add(childId);\n      }\n\n      if (!needMove) {\n        result.push(nodeId);\n        continue;\n      }\n\n      let inserted = false;\n      for (let index = 0; index < result.length; index++) {\n        const parent = result[index];\n        const parentReachable = reachable.get(parent) ?? new Set<NodeID>();\n        if (nodeReachable.has(parent)) {\n          if (parentReachable.has(nodeId)) {\n            result.push(nodeId);\n          } else {\n            result.splice(index, 0, nodeId);\n          }\n          inserted = true;\n          break;\n        }\n      }\n      if (!inserted) {\n        result.push(nodeId);\n      }\n    }\n\n    result.reverse();\n    return result;\n  }\n\n  private buildTransitiveClosureForSort(): Map<NodeID, Set<NodeID>> {\n    const closure = new Map<NodeID, Set<NodeID>>();\n    for (const node of this.nodes.values()) {\n      closure.set(node.id, new Set(node.outputs));\n    }\n\n    const order = this.topologicalOrder();\n    for (const nodeId of [...order].reverse()) {\n      const node = this.at(nodeId);\n      if (!node) {\n        continue;\n      }\n      const nodeClosure = closure.get(nodeId) ?? new Set<NodeID>();\n      for (const parentId of node.inputs) {\n        const parentClosure = closure.get(parentId) ?? new Set<NodeID>();\n        for (const childId of nodeClosure) {\n          parentClosure.add(childId);\n        }\n        closure.set(parentId, parentClosure);\n      }\n    }\n\n    return closure;\n  }\n\n  transitiveReduction() {\n    const order = this.topologicalOrder();\n    const marked = new Map<NodeID, boolean>();\n    order.forEach(nodeID => {\n      if (marked.get(nodeID)) {\n        return;\n      }\n      const stack: { id: NodeID; parents: NodeID[] }[] = [];\n      stack.push({ id: nodeID, parents: [] });\n      while (stack.length > 0) {\n        const item = stack.splice(0, 1)[0];\n        const node = this.nodes.get(item.id);\n        if (node) {\n          node.outputs.forEach(child => {\n            item.parents.forEach(parent => this.removeEdge(parent, child));\n            stack.push({ id: child, parents: [item.id, ...item.parents] });\n          });\n        }\n        marked.set(item.id, true);\n      }\n    });\n  }\n\n  /**\n   * Finds a cycle in the graph.\n   *\n   * @returns {NodeID[] | null} The cycle if found, otherwise `null`.\n   * Uses non-recursive DFS.\n   */\n  findCycle(): NodeID[] | null {\n    const visited = new Set<NodeID>();\n    const nodeStack = new Set<NodeID>();\n    const parents = new Map<NodeID, NodeID>();\n\n    for (const nodeId of this.nodes.keys()) {\n      if (visited.has(nodeId)) {\n        continue;\n      }\n\n      const callStack: { nodeId: NodeID; parentId: NodeID | null }[] = [];\n      callStack.push({ nodeId: nodeId, parentId: null });\n      while (callStack.length > 0) {\n        const { nodeId, parentId } = callStack[callStack.length - 1];\n        if (visited.has(nodeId)) {\n          nodeStack.delete(nodeId);\n          callStack.pop();\n          continue;\n        }\n        visited.add(nodeId);\n        nodeStack.add(nodeId);\n        if (parentId !== null) {\n          parents.set(nodeId, parentId);\n        }\n\n        const currentNode = this.nodes.get(nodeId)!;\n        for (const child of currentNode.outputs) {\n          if (!visited.has(child)) {\n            callStack.push({ nodeId: child, parentId: nodeId });\n            continue;\n          }\n          if (!nodeStack.has(child)) {\n            continue;\n          }\n          const cycle: NodeID[] = [];\n          let current = nodeId;\n          cycle.push(child);\n          while (current !== child) {\n            cycle.push(current);\n            current = parents.get(current)!;\n          }\n          cycle.push(child);\n          cycle.reverse();\n          return cycle;\n        }\n      }\n    }\n    return null;\n  }\n}\n"],"mappings":";AAKO,IAAM,YAAN,MAAM,WAAkB;AAAA;AAAA,EAE7B;AAAA;AAAA,EAEA;AAAA;AAAA,EAEA;AAAA,EAEA,YAAY,IAAY;AACtB,SAAK,KAAK;AACV,SAAK,UAAU,CAAC;AAChB,SAAK,SAAS,CAAC;AAAA,EACjB;AAAA,EAEA,QAA2B;AACzB,UAAM,SAAS,IAAI,WAAU,KAAK,EAAE;AACpC,WAAO,UAAU,CAAC,GAAG,KAAK,OAAO;AACjC,WAAO,SAAS,CAAC,GAAG,KAAK,MAAM;AAC/B,WAAO;AAAA,EACT;AAAA,EAEA,UAAU,MAAoB;AAC5B,SAAK,QAAQ,KAAK,IAAI;AAAA,EACxB;AAAA,EAEA,SAAS,MAAoB;AAC3B,SAAK,OAAO,KAAK,IAAI;AAAA,EACvB;AAAA,EAEA,YAAY,QAA+B;AACzC,UAAM,QAAQ,KAAK,OAAO,UAAU,UAAQ,SAAS,MAAM;AAC3D,WAAO,QAAQ,KAAK,KAAK,OAAO,OAAO,OAAO,CAAC,EAAE,CAAC,IAAI;AAAA,EACxD;AAAA,EAEA,aAAa,QAA+B;AAC1C,UAAM,QAAQ,KAAK,QAAQ,UAAU,UAAQ,SAAS,MAAM;AAC5D,WAAO,QAAQ,KAAK,KAAK,QAAQ,OAAO,OAAO,CAAC,EAAE,CAAC,IAAI;AAAA,EACzD;AACF;AAOO,IAAM,QAAN,MAAM,OAAuB;AAAA;AAAA,EAElC,QAAQ,oBAAI,IAA+B;AAAA,EAE3C,YAAY,KAAkB;AAC5B,QAAI,CAAC,KAAK;AACR;AAAA,IACF;AACA,QAAI,QAAQ,UAAQ;AAClB,UAAI,KAAK,WAAW,GAAG;AACrB,aAAK,QAAQ,KAAK,CAAC,CAAC;AAAA,MACtB,OAAO;AACL,aAAK,QAAQ,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,MAC/B;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EAEA,QAAuB;AACrB,UAAM,SAAS,IAAI,OAAc;AACjC,SAAK,MAAM,QAAQ,UAAQ,OAAO,MAAM,IAAI,KAAK,IAAI,KAAK,MAAM,CAAC,CAAC;AAClE,WAAO;AAAA,EACT;AAAA,EAEA,GAAG,QAA+C;AAChD,WAAO,KAAK,MAAM,IAAI,MAAM;AAAA,EAC9B;AAAA,EAEA,QAAQ,QAAmC;AACzC,QAAI,OAAO,KAAK,MAAM,IAAI,MAAM;AAChC,QAAI,CAAC,MAAM;AACT,aAAO,IAAI,UAAU,MAAM;AAC3B,WAAK,MAAM,IAAI,QAAQ,IAAI;AAAA,IAC7B;AACA,WAAO;AAAA,EACT;AAAA,EAEA,QAAQ,QAAyB;AAC/B,WAAO,CAAC,CAAC,KAAK,MAAM,IAAI,MAAM;AAAA,EAChC;AAAA,EAEA,WAAW,QAAsB;AAC/B,SAAK,MAAM,QAAQ,UAAQ;AACzB,WAAK,YAAY,MAAM;AACvB,WAAK,aAAa,MAAM;AAAA,IAC1B,CAAC;AACD,SAAK,MAAM,OAAO,MAAM;AAAA,EAC1B;AAAA,EAEA,SAAS,QAAsB;AAC7B,UAAM,eAAe,KAAK,MAAM,IAAI,MAAM;AAC1C,QAAI,CAAC,cAAc;AACjB;AAAA,IACF;AACA,iBAAa,OAAO,QAAQ,WAAS;AACnC,mBAAa,QAAQ,QAAQ,YAAU;AACrC,aAAK,QAAQ,OAAO,MAAM;AAAA,MAC5B,CAAC;AAAA,IACH,CAAC;AACD,SAAK,WAAW,MAAM;AAAA,EACxB;AAAA,EAEA,iBAAsC;AACpC,UAAM,SAA8B,CAAC;AACrC,SAAK,MAAM,QAAQ,UAAQ;AACzB,UAAI,KAAK,QAAQ,WAAW,KAAK,KAAK,OAAO,WAAW,GAAG;AACzD,eAAO,KAAK,IAAI;AAChB,aAAK,MAAM,OAAO,KAAK,EAAE;AAAA,MAC3B;AAAA,IACF,CAAC;AACD,WAAO;AAAA,EACT;AAAA,EAEA,QAAQ,QAAgB,aAA2B;AACjD,QAAI,KAAK,QAAQ,QAAQ,WAAW,GAAG;AACrC;AAAA,IACF;AACA,UAAM,aAAa,KAAK,QAAQ,MAAM;AACtC,UAAM,kBAAkB,KAAK,QAAQ,WAAW;AAChD,eAAW,UAAU,gBAAgB,EAAE;AACvC,oBAAgB,SAAS,WAAW,EAAE;AAAA,EACxC;AAAA,EAEA,WAAW,QAAgB,aAA2B;AACpD,UAAM,aAAa,KAAK,MAAM,IAAI,MAAM;AACxC,UAAM,kBAAkB,KAAK,MAAM,IAAI,WAAW;AAClD,QAAI,cAAc,iBAAiB;AACjC,iBAAW,aAAa,WAAW;AACnC,sBAAgB,YAAY,MAAM;AAAA,IACpC;AAAA,EACF;AAAA,EAEA,QAAQ,QAAgB,aAA8B;AACpD,UAAM,aAAa,KAAK,MAAM,IAAI,MAAM;AACxC,QAAI,CAAC,YAAY;AACf,aAAO;AAAA,IACT;AACA,WAAO,CAAC,CAAC,WAAW,QAAQ,KAAK,QAAM,OAAO,WAAW;AAAA,EAC3D;AAAA,EAEA,YAAY,QAAgB,aAA8B;AACxD,WAAO,KAAK,iBAAiB,CAAC,MAAM,CAAC,EAAE,SAAS,WAAW;AAAA,EAC7D;AAAA,EAEA,YAAsB;AACpB,WAAO,CAAC,GAAG,KAAK,MAAM,KAAK,CAAC,EAAE,OAAO,QAAM,CAAC,KAAK,MAAM,IAAI,EAAE,GAAG,OAAO,MAAM;AAAA,EAC/E;AAAA,EAEA,cAAc,QAA4B;AACxC,UAAM,SAAmB,CAAC;AAC1B,WAAO,QAAQ,QAAM;AACnB,YAAM,OAAO,KAAK,MAAM,IAAI,EAAE;AAC9B,UAAI,MAAM;AACR,aAAK,QAAQ,QAAQ,WAAS;AAC5B,cAAI,CAAC,OAAO,SAAS,KAAK,KAAK,CAAC,OAAO,SAAS,KAAK,GAAG;AACtD,mBAAO,KAAK,KAAK;AAAA,UACnB;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF,CAAC;AACD,WAAO;AAAA,EACT;AAAA,EAEA,aAAa,QAA4B;AACvC,UAAM,SAAmB,CAAC;AAC1B,WAAO,QAAQ,QAAM;AACnB,YAAM,OAAO,KAAK,MAAM,IAAI,EAAE;AAC9B,UAAI,MAAM;AACR,aAAK,OAAO,QAAQ,WAAS;AAC3B,cAAI,CAAC,OAAO,SAAS,KAAK,KAAK,CAAC,OAAO,SAAS,KAAK,GAAG;AACtD,mBAAO,KAAK,KAAK;AAAA,UACnB;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF,CAAC;AACD,WAAO;AAAA,EACT;AAAA,EAEA,iBAAiB,QAA4B;AAC3C,UAAM,SAAmB,KAAK,cAAc,MAAM;AAClD,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO,CAAC;AAAA,IACV;AAEA,UAAM,SAAS,oBAAI,IAAqB;AACxC,WAAO,QAAQ,QAAM,OAAO,IAAI,IAAI,IAAI,CAAC;AACzC,QAAI,WAAW;AACf,WAAO,WAAW,OAAO,QAAQ;AAC/B,YAAM,OAAO,KAAK,MAAM,IAAI,OAAO,QAAQ,CAAC;AAC5C,UAAI,QAAQ,CAAC,OAAO,IAAI,KAAK,EAAE,GAAG;AAChC,eAAO,IAAI,KAAK,IAAI,IAAI;AACxB,aAAK,QAAQ,QAAQ,WAAS;AAC5B,cAAI,CAAC,OAAO,IAAI,KAAK,KAAK,CAAC,OAAO,KAAK,QAAM,OAAO,KAAK,GAAG;AAC1D,mBAAO,KAAK,KAAK;AAAA,UACnB;AAAA,QACF,CAAC;AAAA,MACH;AACA,kBAAY;AAAA,IACd;AACA,WAAO;AAAA,EACT;AAAA,EAEA,gBAAgB,QAA4B;AAC1C,UAAM,SAAmB,KAAK,aAAa,MAAM;AACjD,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO,CAAC;AAAA,IACV;AAEA,UAAM,SAAS,oBAAI,IAAqB;AACxC,WAAO,QAAQ,QAAM,OAAO,IAAI,IAAI,IAAI,CAAC;AACzC,QAAI,WAAW;AACf,WAAO,WAAW,OAAO,QAAQ;AAC/B,YAAM,OAAO,KAAK,MAAM,IAAI,OAAO,QAAQ,CAAC;AAC5C,UAAI,QAAQ,CAAC,OAAO,IAAI,KAAK,EAAE,GAAG;AAChC,eAAO,IAAI,KAAK,IAAI,IAAI;AACxB,aAAK,OAAO,QAAQ,WAAS;AAC3B,cAAI,CAAC,OAAO,IAAI,KAAK,KAAK,CAAC,OAAO,KAAK,QAAM,OAAO,KAAK,GAAG;AAC1D,mBAAO,KAAK,KAAK;AAAA,UACnB;AAAA,QACF,CAAC;AAAA,MACH;AACA,kBAAY;AAAA,IACd;AACA,WAAO;AAAA,EACT;AAAA,EAEA,aAAa,QAA4B;AACvC,UAAM,UAAoB,KAAK,iBAAiB,MAAM;AACtD,UAAM,SAAS,CAAC,GAAG,MAAM;AACzB,SAAK,iBAAiB,EACnB,OAAO,QAAM,QAAQ,SAAS,EAAE,CAAC,EACjC,QAAQ,QAAM;AACb,YAAM,OAAO,KAAK,MAAM,IAAI,EAAE;AAC9B,UAAI,MAAM,OAAO,MAAM,YAAU,OAAO,SAAS,MAAM,CAAC,GAAG;AACzD,eAAO,KAAK,EAAE;AAAA,MAChB;AAAA,IACF,CAAC;AACH,WAAO;AAAA,EACT;AAAA,EAEA,mBAA6B;AAC3B,UAAM,SAAmB,CAAC;AAC1B,UAAM,SAAS,oBAAI,IAAY;AAC/B,UAAM,YAAsB,CAAC;AAC7B,SAAK,MAAM,QAAQ,UAAQ;AACzB,UAAI,OAAO,IAAI,KAAK,EAAE,GAAG;AACvB;AAAA,MACF;AACA,gBAAU,KAAK,KAAK,EAAE;AACtB,aAAO,UAAU,SAAS,GAAG;AAC3B,cAAM,OAAO,UAAU,UAAU,SAAS,CAAC;AAC3C,YAAI,OAAO,IAAI,IAAI,GAAG;AACpB,cAAI,CAAC,OAAO,KAAK,QAAM,OAAO,IAAI,GAAG;AACnC,mBAAO,KAAK,IAAI;AAAA,UAClB;AACA,oBAAU,IAAI;AAAA,QAChB,OAAO;AACL,iBAAO,IAAI,IAAI;AACf,gBAAM,WAAW,KAAK,MAAM,IAAI,IAAI;AACpC,cAAI,YAAY,SAAS,QAAQ,SAAS,GAAG;AAC3C,qBAAS,QAAQ,QAAQ,WAAS;AAChC,kBAAI,CAAC,OAAO,IAAI,KAAK,GAAG;AACtB,0BAAU,KAAK,KAAK;AAAA,cACtB;AAAA,YACF,CAAC;AAAA,UACH;AAAA,QACF;AAAA,MACF;AAAA,IACF,CAAC;AACD,WAAO,OAAO,QAAQ;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAW,QAA4B;AACrC,QAAI,OAAO,UAAU,GAAG;AACtB,aAAO,CAAC,GAAG,MAAM;AAAA,IACnB;AAEA,UAAM,YAAY,KAAK,8BAA8B;AACrD,UAAM,UAAU,oBAAI,IAAY;AAChC,UAAM,SAAmB,CAAC;AAE1B,eAAW,UAAU,CAAC,GAAG,MAAM,EAAE,QAAQ,GAAG;AAC1C,YAAM,gBAAgB,UAAU,IAAI,MAAM,KAAK,oBAAI,IAAY;AAC/D,YAAM,WAAW,QAAQ,IAAI,MAAM;AACnC,iBAAW,WAAW,eAAe;AACnC,gBAAQ,IAAI,OAAO;AAAA,MACrB;AAEA,UAAI,CAAC,UAAU;AACb,eAAO,KAAK,MAAM;AAClB;AAAA,MACF;AAEA,UAAI,WAAW;AACf,eAAS,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS;AAClD,cAAM,SAAS,OAAO,KAAK;AAC3B,cAAM,kBAAkB,UAAU,IAAI,MAAM,KAAK,oBAAI,IAAY;AACjE,YAAI,cAAc,IAAI,MAAM,GAAG;AAC7B,cAAI,gBAAgB,IAAI,MAAM,GAAG;AAC/B,mBAAO,KAAK,MAAM;AAAA,UACpB,OAAO;AACL,mBAAO,OAAO,OAAO,GAAG,MAAM;AAAA,UAChC;AACA,qBAAW;AACX;AAAA,QACF;AAAA,MACF;AACA,UAAI,CAAC,UAAU;AACb,eAAO,KAAK,MAAM;AAAA,MACpB;AAAA,IACF;AAEA,WAAO,QAAQ;AACf,WAAO;AAAA,EACT;AAAA,EAEQ,gCAA0D;AAChE,UAAM,UAAU,oBAAI,IAAyB;AAC7C,eAAW,QAAQ,KAAK,MAAM,OAAO,GAAG;AACtC,cAAQ,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,OAAO,CAAC;AAAA,IAC5C;AAEA,UAAM,QAAQ,KAAK,iBAAiB;AACpC,eAAW,UAAU,CAAC,GAAG,KAAK,EAAE,QAAQ,GAAG;AACzC,YAAM,OAAO,KAAK,GAAG,MAAM;AAC3B,UAAI,CAAC,MAAM;AACT;AAAA,MACF;AACA,YAAM,cAAc,QAAQ,IAAI,MAAM,KAAK,oBAAI,IAAY;AAC3D,iBAAW,YAAY,KAAK,QAAQ;AAClC,cAAM,gBAAgB,QAAQ,IAAI,QAAQ,KAAK,oBAAI,IAAY;AAC/D,mBAAW,WAAW,aAAa;AACjC,wBAAc,IAAI,OAAO;AAAA,QAC3B;AACA,gBAAQ,IAAI,UAAU,aAAa;AAAA,MACrC;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,sBAAsB;AACpB,UAAM,QAAQ,KAAK,iBAAiB;AACpC,UAAM,SAAS,oBAAI,IAAqB;AACxC,UAAM,QAAQ,YAAU;AACtB,UAAI,OAAO,IAAI,MAAM,GAAG;AACtB;AAAA,MACF;AACA,YAAM,QAA6C,CAAC;AACpD,YAAM,KAAK,EAAE,IAAI,QAAQ,SAAS,CAAC,EAAE,CAAC;AACtC,aAAO,MAAM,SAAS,GAAG;AACvB,cAAM,OAAO,MAAM,OAAO,GAAG,CAAC,EAAE,CAAC;AACjC,cAAM,OAAO,KAAK,MAAM,IAAI,KAAK,EAAE;AACnC,YAAI,MAAM;AACR,eAAK,QAAQ,QAAQ,WAAS;AAC5B,iBAAK,QAAQ,QAAQ,YAAU,KAAK,WAAW,QAAQ,KAAK,CAAC;AAC7D,kBAAM,KAAK,EAAE,IAAI,OAAO,SAAS,CAAC,KAAK,IAAI,GAAG,KAAK,OAAO,EAAE,CAAC;AAAA,UAC/D,CAAC;AAAA,QACH;AACA,eAAO,IAAI,KAAK,IAAI,IAAI;AAAA,MAC1B;AAAA,IACF,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,YAA6B;AAC3B,UAAM,UAAU,oBAAI,IAAY;AAChC,UAAM,YAAY,oBAAI,IAAY;AAClC,UAAM,UAAU,oBAAI,IAAoB;AAExC,eAAW,UAAU,KAAK,MAAM,KAAK,GAAG;AACtC,UAAI,QAAQ,IAAI,MAAM,GAAG;AACvB;AAAA,MACF;AAEA,YAAM,YAA2D,CAAC;AAClE,gBAAU,KAAK,EAAE,QAAgB,UAAU,KAAK,CAAC;AACjD,aAAO,UAAU,SAAS,GAAG;AAC3B,cAAM,EAAE,QAAAA,SAAQ,SAAS,IAAI,UAAU,UAAU,SAAS,CAAC;AAC3D,YAAI,QAAQ,IAAIA,OAAM,GAAG;AACvB,oBAAU,OAAOA,OAAM;AACvB,oBAAU,IAAI;AACd;AAAA,QACF;AACA,gBAAQ,IAAIA,OAAM;AAClB,kBAAU,IAAIA,OAAM;AACpB,YAAI,aAAa,MAAM;AACrB,kBAAQ,IAAIA,SAAQ,QAAQ;AAAA,QAC9B;AAEA,cAAM,cAAc,KAAK,MAAM,IAAIA,OAAM;AACzC,mBAAW,SAAS,YAAY,SAAS;AACvC,cAAI,CAAC,QAAQ,IAAI,KAAK,GAAG;AACvB,sBAAU,KAAK,EAAE,QAAQ,OAAO,UAAUA,QAAO,CAAC;AAClD;AAAA,UACF;AACA,cAAI,CAAC,UAAU,IAAI,KAAK,GAAG;AACzB;AAAA,UACF;AACA,gBAAM,QAAkB,CAAC;AACzB,cAAI,UAAUA;AACd,gBAAM,KAAK,KAAK;AAChB,iBAAO,YAAY,OAAO;AACxB,kBAAM,KAAK,OAAO;AAClB,sBAAU,QAAQ,IAAI,OAAO;AAAA,UAC/B;AACA,gBAAM,KAAK,KAAK;AAChB,gBAAM,QAAQ;AACd,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;","names":["nodeId"]}
+{"version":3,"file":"graph.js","names":[],"sources":["../../src/graph/graph.ts"],"sourcesContent":["/**\n * Module: Custom graph data structure.\n */\n\n/** Represents single node of a {@link Graph}, as implemented by storing outgoing and incoming connections. */\nexport class GraphNode<NodeID> {\n  /** Unique identifier of the node. */\n  id: NodeID;\n  /** List of outgoing nodes. */\n  outputs: NodeID[];\n  /** List of incoming nodes. */\n  inputs: NodeID[];\n\n  constructor(id: NodeID) {\n    this.id = id;\n    this.outputs = [];\n    this.inputs = [];\n  }\n\n  clone(): GraphNode<NodeID> {\n    const result = new GraphNode(this.id);\n    result.outputs = [...this.outputs];\n    result.inputs = [...this.inputs];\n    return result;\n  }\n\n  addOutput(node: NodeID): void {\n    this.outputs.push(node);\n  }\n\n  addInput(node: NodeID): void {\n    this.inputs.push(node);\n  }\n\n  removeInput(target: NodeID): NodeID | null {\n    const index = this.inputs.findIndex(node => node === target);\n    return index > -1 ? this.inputs.splice(index, 1)[0] : null;\n  }\n\n  removeOutput(target: NodeID): NodeID | null {\n    const index = this.outputs.findIndex(node => node === target);\n    return index > -1 ? this.outputs.splice(index, 1)[0] : null;\n  }\n}\n\n/**\n * Represents a Graph.\n *\n * This class is optimized for TermGraph use case and not supposed to be used as generic graph implementation.\n */\nexport class Graph<NodeID = number> {\n  /** Map of nodes. */\n  nodes = new Map<NodeID, GraphNode<NodeID>>();\n\n  constructor(arr?: NodeID[][]) {\n    if (!arr) {\n      return;\n    }\n    arr.forEach(edge => {\n      if (edge.length === 1) {\n        this.addNode(edge[0]);\n      } else {\n        this.addEdge(edge[0], edge[1]);\n      }\n    });\n  }\n\n  clone(): Graph<NodeID> {\n    const result = new Graph<NodeID>();\n    this.nodes.forEach(node => result.nodes.set(node.id, node.clone()));\n    return result;\n  }\n\n  at(target: NodeID): GraphNode<NodeID> | undefined {\n    return this.nodes.get(target);\n  }\n\n  addNode(target: NodeID): GraphNode<NodeID> {\n    let node = this.nodes.get(target);\n    if (!node) {\n      node = new GraphNode(target);\n      this.nodes.set(target, node);\n    }\n    return node;\n  }\n\n  hasNode(target: NodeID): boolean {\n    return !!this.nodes.get(target);\n  }\n\n  removeNode(target: NodeID): void {\n    this.nodes.forEach(node => {\n      node.removeInput(target);\n      node.removeOutput(target);\n    });\n    this.nodes.delete(target);\n  }\n\n  foldNode(target: NodeID): void {\n    const nodeToRemove = this.nodes.get(target);\n    if (!nodeToRemove) {\n      return;\n    }\n    nodeToRemove.inputs.forEach(input => {\n      nodeToRemove.outputs.forEach(output => {\n        this.addEdge(input, output);\n      });\n    });\n    this.removeNode(target);\n  }\n\n  removeIsolated(): GraphNode<NodeID>[] {\n    const result: GraphNode<NodeID>[] = [];\n    this.nodes.forEach(node => {\n      if (node.outputs.length === 0 && node.inputs.length === 0) {\n        result.push(node);\n        this.nodes.delete(node.id);\n      }\n    });\n    return result;\n  }\n\n  addEdge(source: NodeID, destination: NodeID): void {\n    if (this.hasEdge(source, destination)) {\n      return;\n    }\n    const sourceNode = this.addNode(source);\n    const destinationNode = this.addNode(destination);\n    sourceNode.addOutput(destinationNode.id);\n    destinationNode.addInput(sourceNode.id);\n  }\n\n  removeEdge(source: NodeID, destination: NodeID): void {\n    const sourceNode = this.nodes.get(source);\n    const destinationNode = this.nodes.get(destination);\n    if (sourceNode && destinationNode) {\n      sourceNode.removeOutput(destination);\n      destinationNode.removeInput(source);\n    }\n  }\n\n  hasEdge(source: NodeID, destination: NodeID): boolean {\n    const sourceNode = this.nodes.get(source);\n    if (!sourceNode) {\n      return false;\n    }\n    return !!sourceNode.outputs.find(id => id === destination);\n  }\n\n  isReachable(source: NodeID, destination: NodeID): boolean {\n    return this.expandAllOutputs([source]).includes(destination);\n  }\n\n  rootNodes(): NodeID[] {\n    return [...this.nodes.keys()].filter(id => !this.nodes.get(id)?.inputs.length);\n  }\n\n  expandOutputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = [];\n    origin.forEach(id => {\n      const node = this.nodes.get(id);\n      if (node) {\n        node.outputs.forEach(child => {\n          if (!origin.includes(child) && !result.includes(child)) {\n            result.push(child);\n          }\n        });\n      }\n    });\n    return result;\n  }\n\n  expandInputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = [];\n    origin.forEach(id => {\n      const node = this.nodes.get(id);\n      if (node) {\n        node.inputs.forEach(child => {\n          if (!origin.includes(child) && !result.includes(child)) {\n            result.push(child);\n          }\n        });\n      }\n    });\n    return result;\n  }\n\n  expandAllOutputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = this.expandOutputs(origin);\n    if (result.length === 0) {\n      return [];\n    }\n\n    const marked = new Map<NodeID, boolean>();\n    origin.forEach(id => marked.set(id, true));\n    let position = 0;\n    while (position < result.length) {\n      const node = this.nodes.get(result[position]);\n      if (node && !marked.get(node.id)) {\n        marked.set(node.id, true);\n        node.outputs.forEach(child => {\n          if (!marked.get(child) && !result.find(id => id === child)) {\n            result.push(child);\n          }\n        });\n      }\n      position += 1;\n    }\n    return result;\n  }\n\n  expandAllInputs(origin: NodeID[]): NodeID[] {\n    const result: NodeID[] = this.expandInputs(origin);\n    if (result.length === 0) {\n      return [];\n    }\n\n    const marked = new Map<NodeID, boolean>();\n    origin.forEach(id => marked.set(id, true));\n    let position = 0;\n    while (position < result.length) {\n      const node = this.nodes.get(result[position]);\n      if (node && !marked.get(node.id)) {\n        marked.set(node.id, true);\n        node.inputs.forEach(child => {\n          if (!marked.get(child) && !result.find(id => id === child)) {\n            result.push(child);\n          }\n        });\n      }\n      position += 1;\n    }\n    return result;\n  }\n\n  maximizePart(origin: NodeID[]): NodeID[] {\n    const outputs: NodeID[] = this.expandAllOutputs(origin);\n    const result = [...origin];\n    this.topologicalOrder()\n      .filter(id => outputs.includes(id))\n      .forEach(id => {\n        const node = this.nodes.get(id);\n        if (node?.inputs.every(parent => result.includes(parent))) {\n          result.push(id);\n        }\n      });\n    return result;\n  }\n\n  topologicalOrder(): NodeID[] {\n    const result: NodeID[] = [];\n    const marked = new Set<NodeID>();\n    const nodeStack: NodeID[] = [];\n    this.nodes.forEach(node => {\n      if (marked.has(node.id)) {\n        return;\n      }\n      nodeStack.push(node.id);\n      while (nodeStack.length > 0) {\n        const item = nodeStack[nodeStack.length - 1];\n        if (marked.has(item)) {\n          if (!result.find(id => id === item)) {\n            result.push(item);\n          }\n          nodeStack.pop();\n        } else {\n          marked.add(item);\n          const itemNode = this.nodes.get(item);\n          if (itemNode && itemNode.outputs.length > 0) {\n            itemNode.outputs.forEach(child => {\n              if (!marked.has(child)) {\n                nodeStack.push(child);\n              }\n            });\n          }\n        }\n      }\n    });\n    return result.reverse();\n  }\n\n  /**\n   * Stably reorders the given node ids so that, for this DAG, no node appears before a transitive\n   * successor (edges: source → dependent; {@link GraphNode.outputs} lists dependents).\n   */\n  sortStable(target: NodeID[]): NodeID[] {\n    if (target.length <= 1) {\n      return [...target];\n    }\n\n    const reachable = this.buildTransitiveClosureForSort();\n    const testSet = new Set<NodeID>();\n    const result: NodeID[] = [];\n\n    for (const nodeId of [...target].reverse()) {\n      const nodeReachable = reachable.get(nodeId) ?? new Set<NodeID>();\n      const needMove = testSet.has(nodeId);\n      for (const childId of nodeReachable) {\n        testSet.add(childId);\n      }\n\n      if (!needMove) {\n        result.push(nodeId);\n        continue;\n      }\n\n      let inserted = false;\n      for (let index = 0; index < result.length; index++) {\n        const parent = result[index];\n        const parentReachable = reachable.get(parent) ?? new Set<NodeID>();\n        if (nodeReachable.has(parent)) {\n          if (parentReachable.has(nodeId)) {\n            result.push(nodeId);\n          } else {\n            result.splice(index, 0, nodeId);\n          }\n          inserted = true;\n          break;\n        }\n      }\n      if (!inserted) {\n        result.push(nodeId);\n      }\n    }\n\n    result.reverse();\n    return result;\n  }\n\n  private buildTransitiveClosureForSort(): Map<NodeID, Set<NodeID>> {\n    const closure = new Map<NodeID, Set<NodeID>>();\n    for (const node of this.nodes.values()) {\n      closure.set(node.id, new Set(node.outputs));\n    }\n\n    const order = this.topologicalOrder();\n    for (const nodeId of [...order].reverse()) {\n      const node = this.at(nodeId);\n      if (!node) {\n        continue;\n      }\n      const nodeClosure = closure.get(nodeId) ?? new Set<NodeID>();\n      for (const parentId of node.inputs) {\n        const parentClosure = closure.get(parentId) ?? new Set<NodeID>();\n        for (const childId of nodeClosure) {\n          parentClosure.add(childId);\n        }\n        closure.set(parentId, parentClosure);\n      }\n    }\n\n    return closure;\n  }\n\n  transitiveReduction() {\n    const order = this.topologicalOrder();\n    const marked = new Map<NodeID, boolean>();\n    order.forEach(nodeID => {\n      if (marked.get(nodeID)) {\n        return;\n      }\n      const stack: { id: NodeID; parents: NodeID[] }[] = [];\n      stack.push({ id: nodeID, parents: [] });\n      while (stack.length > 0) {\n        const item = stack.splice(0, 1)[0];\n        const node = this.nodes.get(item.id);\n        if (node) {\n          node.outputs.forEach(child => {\n            item.parents.forEach(parent => this.removeEdge(parent, child));\n            stack.push({ id: child, parents: [item.id, ...item.parents] });\n          });\n        }\n        marked.set(item.id, true);\n      }\n    });\n  }\n\n  /**\n   * Finds a cycle in the graph.\n   *\n   * @returns {NodeID[] | null} The cycle if found, otherwise `null`.\n   * Uses non-recursive DFS.\n   */\n  findCycle(): NodeID[] | null {\n    const visited = new Set<NodeID>();\n    const nodeStack = new Set<NodeID>();\n    const parents = new Map<NodeID, NodeID>();\n\n    for (const nodeId of this.nodes.keys()) {\n      if (visited.has(nodeId)) {\n        continue;\n      }\n\n      const callStack: { nodeId: NodeID; parentId: NodeID | null }[] = [];\n      callStack.push({ nodeId: nodeId, parentId: null });\n      while (callStack.length > 0) {\n        const { nodeId, parentId } = callStack[callStack.length - 1];\n        if (visited.has(nodeId)) {\n          nodeStack.delete(nodeId);\n          callStack.pop();\n          continue;\n        }\n        visited.add(nodeId);\n        nodeStack.add(nodeId);\n        if (parentId !== null) {\n          parents.set(nodeId, parentId);\n        }\n\n        const currentNode = this.nodes.get(nodeId)!;\n        for (const child of currentNode.outputs) {\n          if (!visited.has(child)) {\n            callStack.push({ nodeId: child, parentId: nodeId });\n            continue;\n          }\n          if (!nodeStack.has(child)) {\n            continue;\n          }\n          const cycle: NodeID[] = [];\n          let current = nodeId;\n          cycle.push(child);\n          while (current !== child) {\n            cycle.push(current);\n            current = parents.get(current)!;\n          }\n          cycle.push(child);\n          cycle.reverse();\n          return cycle;\n        }\n      }\n    }\n    return null;\n  }\n}\n"],"mappings":";;;;;AAKA,IAAa,YAAb,MAAa,UAAkB;;CAE7B;;CAEA;;CAEA;CAEA,YAAY,IAAY;EACtB,KAAK,KAAK;EACV,KAAK,UAAU,CAAC;EAChB,KAAK,SAAS,CAAC;CACjB;CAEA,QAA2B;EACzB,MAAM,SAAS,IAAI,UAAU,KAAK,EAAE;EACpC,OAAO,UAAU,CAAC,GAAG,KAAK,OAAO;EACjC,OAAO,SAAS,CAAC,GAAG,KAAK,MAAM;EAC/B,OAAO;CACT;CAEA,UAAU,MAAoB;EAC5B,KAAK,QAAQ,KAAK,IAAI;CACxB;CAEA,SAAS,MAAoB;EAC3B,KAAK,OAAO,KAAK,IAAI;CACvB;CAEA,YAAY,QAA+B;EACzC,MAAM,QAAQ,KAAK,OAAO,WAAU,SAAQ,SAAS,MAAM;EAC3D,OAAO,QAAQ,KAAK,KAAK,OAAO,OAAO,OAAO,CAAC,CAAC,CAAC,KAAK;CACxD;CAEA,aAAa,QAA+B;EAC1C,MAAM,QAAQ,KAAK,QAAQ,WAAU,SAAQ,SAAS,MAAM;EAC5D,OAAO,QAAQ,KAAK,KAAK,QAAQ,OAAO,OAAO,CAAC,CAAC,CAAC,KAAK;CACzD;AACF;;;;;;AAOA,IAAa,QAAb,MAAa,MAAuB;;CAElC,wBAAQ,IAAI,IAA+B;CAE3C,YAAY,KAAkB;EAC5B,IAAI,CAAC,KACH;EAEF,IAAI,SAAQ,SAAQ;GAClB,IAAI,KAAK,WAAW,GAClB,KAAK,QAAQ,KAAK,EAAE;QAEpB,KAAK,QAAQ,KAAK,IAAI,KAAK,EAAE;EAEjC,CAAC;CACH;CAEA,QAAuB;EACrB,MAAM,SAAS,IAAI,MAAc;EACjC,KAAK,MAAM,SAAQ,SAAQ,OAAO,MAAM,IAAI,KAAK,IAAI,KAAK,MAAM,CAAC,CAAC;EAClE,OAAO;CACT;CAEA,GAAG,QAA+C;EAChD,OAAO,KAAK,MAAM,IAAI,MAAM;CAC9B;CAEA,QAAQ,QAAmC;EACzC,IAAI,OAAO,KAAK,MAAM,IAAI,MAAM;EAChC,IAAI,CAAC,MAAM;GACT,OAAO,IAAI,UAAU,MAAM;GAC3B,KAAK,MAAM,IAAI,QAAQ,IAAI;EAC7B;EACA,OAAO;CACT;CAEA,QAAQ,QAAyB;EAC/B,OAAO,CAAC,CAAC,KAAK,MAAM,IAAI,MAAM;CAChC;CAEA,WAAW,QAAsB;EAC/B,KAAK,MAAM,SAAQ,SAAQ;GACzB,KAAK,YAAY,MAAM;GACvB,KAAK,aAAa,MAAM;EAC1B,CAAC;EACD,KAAK,MAAM,OAAO,MAAM;CAC1B;CAEA,SAAS,QAAsB;EAC7B,MAAM,eAAe,KAAK,MAAM,IAAI,MAAM;EAC1C,IAAI,CAAC,cACH;EAEF,aAAa,OAAO,SAAQ,UAAS;GACnC,aAAa,QAAQ,SAAQ,WAAU;IACrC,KAAK,QAAQ,OAAO,MAAM;GAC5B,CAAC;EACH,CAAC;EACD,KAAK,WAAW,MAAM;CACxB;CAEA,iBAAsC;EACpC,MAAM,SAA8B,CAAC;EACrC,KAAK,MAAM,SAAQ,SAAQ;GACzB,IAAI,KAAK,QAAQ,WAAW,KAAK,KAAK,OAAO,WAAW,GAAG;IACzD,OAAO,KAAK,IAAI;IAChB,KAAK,MAAM,OAAO,KAAK,EAAE;GAC3B;EACF,CAAC;EACD,OAAO;CACT;CAEA,QAAQ,QAAgB,aAA2B;EACjD,IAAI,KAAK,QAAQ,QAAQ,WAAW,GAClC;EAEF,MAAM,aAAa,KAAK,QAAQ,MAAM;EACtC,MAAM,kBAAkB,KAAK,QAAQ,WAAW;EAChD,WAAW,UAAU,gBAAgB,EAAE;EACvC,gBAAgB,SAAS,WAAW,EAAE;CACxC;CAEA,WAAW,QAAgB,aAA2B;EACpD,MAAM,aAAa,KAAK,MAAM,IAAI,MAAM;EACxC,MAAM,kBAAkB,KAAK,MAAM,IAAI,WAAW;EAClD,IAAI,cAAc,iBAAiB;GACjC,WAAW,aAAa,WAAW;GACnC,gBAAgB,YAAY,MAAM;EACpC;CACF;CAEA,QAAQ,QAAgB,aAA8B;EACpD,MAAM,aAAa,KAAK,MAAM,IAAI,MAAM;EACxC,IAAI,CAAC,YACH,OAAO;EAET,OAAO,CAAC,CAAC,WAAW,QAAQ,MAAK,OAAM,OAAO,WAAW;CAC3D;CAEA,YAAY,QAAgB,aAA8B;EACxD,OAAO,KAAK,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,WAAW;CAC7D;CAEA,YAAsB;EACpB,OAAO,CAAC,GAAG,KAAK,MAAM,KAAK,CAAC,CAAC,CAAC,QAAO,OAAM,CAAC,KAAK,MAAM,IAAI,EAAE,CAAC,EAAE,OAAO,MAAM;CAC/E;CAEA,cAAc,QAA4B;EACxC,MAAM,SAAmB,CAAC;EAC1B,OAAO,SAAQ,OAAM;GACnB,MAAM,OAAO,KAAK,MAAM,IAAI,EAAE;GAC9B,IAAI,MACF,KAAK,QAAQ,SAAQ,UAAS;IAC5B,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,CAAC,OAAO,SAAS,KAAK,GACnD,OAAO,KAAK,KAAK;GAErB,CAAC;EAEL,CAAC;EACD,OAAO;CACT;CAEA,aAAa,QAA4B;EACvC,MAAM,SAAmB,CAAC;EAC1B,OAAO,SAAQ,OAAM;GACnB,MAAM,OAAO,KAAK,MAAM,IAAI,EAAE;GAC9B,IAAI,MACF,KAAK,OAAO,SAAQ,UAAS;IAC3B,IAAI,CAAC,OAAO,SAAS,KAAK,KAAK,CAAC,OAAO,SAAS,KAAK,GACnD,OAAO,KAAK,KAAK;GAErB,CAAC;EAEL,CAAC;EACD,OAAO;CACT;CAEA,iBAAiB,QAA4B;EAC3C,MAAM,SAAmB,KAAK,cAAc,MAAM;EAClD,IAAI,OAAO,WAAW,GACpB,OAAO,CAAC;EAGV,MAAM,yBAAS,IAAI,IAAqB;EACxC,OAAO,SAAQ,OAAM,OAAO,IAAI,IAAI,IAAI,CAAC;EACzC,IAAI,WAAW;EACf,OAAO,WAAW,OAAO,QAAQ;GAC/B,MAAM,OAAO,KAAK,MAAM,IAAI,OAAO,SAAS;GAC5C,IAAI,QAAQ,CAAC,OAAO,IAAI,KAAK,EAAE,GAAG;IAChC,OAAO,IAAI,KAAK,IAAI,IAAI;IACxB,KAAK,QAAQ,SAAQ,UAAS;KAC5B,IAAI,CAAC,OAAO,IAAI,KAAK,KAAK,CAAC,OAAO,MAAK,OAAM,OAAO,KAAK,GACvD,OAAO,KAAK,KAAK;IAErB,CAAC;GACH;GACA,YAAY;EACd;EACA,OAAO;CACT;CAEA,gBAAgB,QAA4B;EAC1C,MAAM,SAAmB,KAAK,aAAa,MAAM;EACjD,IAAI,OAAO,WAAW,GACpB,OAAO,CAAC;EAGV,MAAM,yBAAS,IAAI,IAAqB;EACxC,OAAO,SAAQ,OAAM,OAAO,IAAI,IAAI,IAAI,CAAC;EACzC,IAAI,WAAW;EACf,OAAO,WAAW,OAAO,QAAQ;GAC/B,MAAM,OAAO,KAAK,MAAM,IAAI,OAAO,SAAS;GAC5C,IAAI,QAAQ,CAAC,OAAO,IAAI,KAAK,EAAE,GAAG;IAChC,OAAO,IAAI,KAAK,IAAI,IAAI;IACxB,KAAK,OAAO,SAAQ,UAAS;KAC3B,IAAI,CAAC,OAAO,IAAI,KAAK,KAAK,CAAC,OAAO,MAAK,OAAM,OAAO,KAAK,GACvD,OAAO,KAAK,KAAK;IAErB,CAAC;GACH;GACA,YAAY;EACd;EACA,OAAO;CACT;CAEA,aAAa,QAA4B;EACvC,MAAM,UAAoB,KAAK,iBAAiB,MAAM;EACtD,MAAM,SAAS,CAAC,GAAG,MAAM;EACzB,KAAK,iBAAiB,CAAC,CACpB,QAAO,OAAM,QAAQ,SAAS,EAAE,CAAC,CAAC,CAClC,SAAQ,OAAM;GAEb,IADa,KAAK,MAAM,IAAI,EACxB,CAAA,EAAM,OAAO,OAAM,WAAU,OAAO,SAAS,MAAM,CAAC,GACtD,OAAO,KAAK,EAAE;EAElB,CAAC;EACH,OAAO;CACT;CAEA,mBAA6B;EAC3B,MAAM,SAAmB,CAAC;EAC1B,MAAM,yBAAS,IAAI,IAAY;EAC/B,MAAM,YAAsB,CAAC;EAC7B,KAAK,MAAM,SAAQ,SAAQ;GACzB,IAAI,OAAO,IAAI,KAAK,EAAE,GACpB;GAEF,UAAU,KAAK,KAAK,EAAE;GACtB,OAAO,UAAU,SAAS,GAAG;IAC3B,MAAM,OAAO,UAAU,UAAU,SAAS;IAC1C,IAAI,OAAO,IAAI,IAAI,GAAG;KACpB,IAAI,CAAC,OAAO,MAAK,OAAM,OAAO,IAAI,GAChC,OAAO,KAAK,IAAI;KAElB,UAAU,IAAI;IAChB,OAAO;KACL,OAAO,IAAI,IAAI;KACf,MAAM,WAAW,KAAK,MAAM,IAAI,IAAI;KACpC,IAAI,YAAY,SAAS,QAAQ,SAAS,GACxC,SAAS,QAAQ,SAAQ,UAAS;MAChC,IAAI,CAAC,OAAO,IAAI,KAAK,GACnB,UAAU,KAAK,KAAK;KAExB,CAAC;IAEL;GACF;EACF,CAAC;EACD,OAAO,OAAO,QAAQ;CACxB;;;;;CAMA,WAAW,QAA4B;EACrC,IAAI,OAAO,UAAU,GACnB,OAAO,CAAC,GAAG,MAAM;EAGnB,MAAM,YAAY,KAAK,8BAA8B;EACrD,MAAM,0BAAU,IAAI,IAAY;EAChC,MAAM,SAAmB,CAAC;EAE1B,KAAK,MAAM,UAAU,CAAC,GAAG,MAAM,CAAC,CAAC,QAAQ,GAAG;GAC1C,MAAM,gBAAgB,UAAU,IAAI,MAAM,qBAAK,IAAI,IAAY;GAC/D,MAAM,WAAW,QAAQ,IAAI,MAAM;GACnC,KAAK,MAAM,WAAW,eACpB,QAAQ,IAAI,OAAO;GAGrB,IAAI,CAAC,UAAU;IACb,OAAO,KAAK,MAAM;IAClB;GACF;GAEA,IAAI,WAAW;GACf,KAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS;IAClD,MAAM,SAAS,OAAO;IACtB,MAAM,kBAAkB,UAAU,IAAI,MAAM,qBAAK,IAAI,IAAY;IACjE,IAAI,cAAc,IAAI,MAAM,GAAG;KAC7B,IAAI,gBAAgB,IAAI,MAAM,GAC5B,OAAO,KAAK,MAAM;UAElB,OAAO,OAAO,OAAO,GAAG,MAAM;KAEhC,WAAW;KACX;IACF;GACF;GACA,IAAI,CAAC,UACH,OAAO,KAAK,MAAM;EAEtB;EAEA,OAAO,QAAQ;EACf,OAAO;CACT;CAEA,gCAAkE;EAChE,MAAM,0BAAU,IAAI,IAAyB;EAC7C,KAAK,MAAM,QAAQ,KAAK,MAAM,OAAO,GACnC,QAAQ,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,OAAO,CAAC;EAG5C,MAAM,QAAQ,KAAK,iBAAiB;EACpC,KAAK,MAAM,UAAU,CAAC,GAAG,KAAK,CAAC,CAAC,QAAQ,GAAG;GACzC,MAAM,OAAO,KAAK,GAAG,MAAM;GAC3B,IAAI,CAAC,MACH;GAEF,MAAM,cAAc,QAAQ,IAAI,MAAM,qBAAK,IAAI,IAAY;GAC3D,KAAK,MAAM,YAAY,KAAK,QAAQ;IAClC,MAAM,gBAAgB,QAAQ,IAAI,QAAQ,qBAAK,IAAI,IAAY;IAC/D,KAAK,MAAM,WAAW,aACpB,cAAc,IAAI,OAAO;IAE3B,QAAQ,IAAI,UAAU,aAAa;GACrC;EACF;EAEA,OAAO;CACT;CAEA,sBAAsB;EACpB,MAAM,QAAQ,KAAK,iBAAiB;EACpC,MAAM,yBAAS,IAAI,IAAqB;EACxC,MAAM,SAAQ,WAAU;GACtB,IAAI,OAAO,IAAI,MAAM,GACnB;GAEF,MAAM,QAA6C,CAAC;GACpD,MAAM,KAAK;IAAE,IAAI;IAAQ,SAAS,CAAC;GAAE,CAAC;GACtC,OAAO,MAAM,SAAS,GAAG;IACvB,MAAM,OAAO,MAAM,OAAO,GAAG,CAAC,CAAC,CAAC;IAChC,MAAM,OAAO,KAAK,MAAM,IAAI,KAAK,EAAE;IACnC,IAAI,MACF,KAAK,QAAQ,SAAQ,UAAS;KAC5B,KAAK,QAAQ,SAAQ,WAAU,KAAK,WAAW,QAAQ,KAAK,CAAC;KAC7D,MAAM,KAAK;MAAE,IAAI;MAAO,SAAS,CAAC,KAAK,IAAI,GAAG,KAAK,OAAO;KAAE,CAAC;IAC/D,CAAC;IAEH,OAAO,IAAI,KAAK,IAAI,IAAI;GAC1B;EACF,CAAC;CACH;;;;;;;CAQA,YAA6B;EAC3B,MAAM,0BAAU,IAAI,IAAY;EAChC,MAAM,4BAAY,IAAI,IAAY;EAClC,MAAM,0BAAU,IAAI,IAAoB;EAExC,KAAK,MAAM,UAAU,KAAK,MAAM,KAAK,GAAG;GACtC,IAAI,QAAQ,IAAI,MAAM,GACpB;GAGF,MAAM,YAA2D,CAAC;GAClE,UAAU,KAAK;IAAU;IAAQ,UAAU;GAAK,CAAC;GACjD,OAAO,UAAU,SAAS,GAAG;IAC3B,MAAM,EAAE,QAAQ,aAAa,UAAU,UAAU,SAAS;IAC1D,IAAI,QAAQ,IAAI,MAAM,GAAG;KACvB,UAAU,OAAO,MAAM;KACvB,UAAU,IAAI;KACd;IACF;IACA,QAAQ,IAAI,MAAM;IAClB,UAAU,IAAI,MAAM;IACpB,IAAI,aAAa,MACf,QAAQ,IAAI,QAAQ,QAAQ;IAG9B,MAAM,cAAc,KAAK,MAAM,IAAI,MAAM;IACzC,KAAK,MAAM,SAAS,YAAY,SAAS;KACvC,IAAI,CAAC,QAAQ,IAAI,KAAK,GAAG;MACvB,UAAU,KAAK;OAAE,QAAQ;OAAO,UAAU;MAAO,CAAC;MAClD;KACF;KACA,IAAI,CAAC,UAAU,IAAI,KAAK,GACtB;KAEF,MAAM,QAAkB,CAAC;KACzB,IAAI,UAAU;KACd,MAAM,KAAK,KAAK;KAChB,OAAO,YAAY,OAAO;MACxB,MAAM,KAAK,OAAO;MAClB,UAAU,QAAQ,IAAI,OAAO;KAC/B;KACA,MAAM,KAAK,KAAK;KAChB,MAAM,QAAQ;KACd,OAAO;IACT;GACF;EACF;EACA,OAAO;CACT;AACF"}

package/dist/graph/index.d.ts

@@ -1 +1,2 @@
-export { Graph } from './graph.js';
+import { t as Graph } from "../graph-DR8rL2o3.js";
+export { Graph };

package/dist/graph/index.js

@@ -1,384 +1,2 @@
-// src/graph/graph.ts
-var GraphNode = class _GraphNode {
-  /** Unique identifier of the node. */
-  id;
-  /** List of outgoing nodes. */
-  outputs;
-  /** List of incoming nodes. */
-  inputs;
-  constructor(id) {
-    this.id = id;
-    this.outputs = [];
-    this.inputs = [];
-  }
-  clone() {
-    const result = new _GraphNode(this.id);
-    result.outputs = [...this.outputs];
-    result.inputs = [...this.inputs];
-    return result;
-  }
-  addOutput(node) {
-    this.outputs.push(node);
-  }
-  addInput(node) {
-    this.inputs.push(node);
-  }
-  removeInput(target) {
-    const index = this.inputs.findIndex((node) => node === target);
-    return index > -1 ? this.inputs.splice(index, 1)[0] : null;
-  }
-  removeOutput(target) {
-    const index = this.outputs.findIndex((node) => node === target);
-    return index > -1 ? this.outputs.splice(index, 1)[0] : null;
-  }
-};
-var Graph = class _Graph {
-  /** Map of nodes. */
-  nodes = /* @__PURE__ */ new Map();
-  constructor(arr) {
-    if (!arr) {
-      return;
-    }
-    arr.forEach((edge) => {
-      if (edge.length === 1) {
-        this.addNode(edge[0]);
-      } else {
-        this.addEdge(edge[0], edge[1]);
-      }
-    });
-  }
-  clone() {
-    const result = new _Graph();
-    this.nodes.forEach((node) => result.nodes.set(node.id, node.clone()));
-    return result;
-  }
-  at(target) {
-    return this.nodes.get(target);
-  }
-  addNode(target) {
-    let node = this.nodes.get(target);
-    if (!node) {
-      node = new GraphNode(target);
-      this.nodes.set(target, node);
-    }
-    return node;
-  }
-  hasNode(target) {
-    return !!this.nodes.get(target);
-  }
-  removeNode(target) {
-    this.nodes.forEach((node) => {
-      node.removeInput(target);
-      node.removeOutput(target);
-    });
-    this.nodes.delete(target);
-  }
-  foldNode(target) {
-    const nodeToRemove = this.nodes.get(target);
-    if (!nodeToRemove) {
-      return;
-    }
-    nodeToRemove.inputs.forEach((input) => {
-      nodeToRemove.outputs.forEach((output) => {
-        this.addEdge(input, output);
-      });
-    });
-    this.removeNode(target);
-  }
-  removeIsolated() {
-    const result = [];
-    this.nodes.forEach((node) => {
-      if (node.outputs.length === 0 && node.inputs.length === 0) {
-        result.push(node);
-        this.nodes.delete(node.id);
-      }
-    });
-    return result;
-  }
-  addEdge(source, destination) {
-    if (this.hasEdge(source, destination)) {
-      return;
-    }
-    const sourceNode = this.addNode(source);
-    const destinationNode = this.addNode(destination);
-    sourceNode.addOutput(destinationNode.id);
-    destinationNode.addInput(sourceNode.id);
-  }
-  removeEdge(source, destination) {
-    const sourceNode = this.nodes.get(source);
-    const destinationNode = this.nodes.get(destination);
-    if (sourceNode && destinationNode) {
-      sourceNode.removeOutput(destination);
-      destinationNode.removeInput(source);
-    }
-  }
-  hasEdge(source, destination) {
-    const sourceNode = this.nodes.get(source);
-    if (!sourceNode) {
-      return false;
-    }
-    return !!sourceNode.outputs.find((id) => id === destination);
-  }
-  isReachable(source, destination) {
-    return this.expandAllOutputs([source]).includes(destination);
-  }
-  rootNodes() {
-    return [...this.nodes.keys()].filter((id) => !this.nodes.get(id)?.inputs.length);
-  }
-  expandOutputs(origin) {
-    const result = [];
-    origin.forEach((id) => {
-      const node = this.nodes.get(id);
-      if (node) {
-        node.outputs.forEach((child) => {
-          if (!origin.includes(child) && !result.includes(child)) {
-            result.push(child);
-          }
-        });
-      }
-    });
-    return result;
-  }
-  expandInputs(origin) {
-    const result = [];
-    origin.forEach((id) => {
-      const node = this.nodes.get(id);
-      if (node) {
-        node.inputs.forEach((child) => {
-          if (!origin.includes(child) && !result.includes(child)) {
-            result.push(child);
-          }
-        });
-      }
-    });
-    return result;
-  }
-  expandAllOutputs(origin) {
-    const result = this.expandOutputs(origin);
-    if (result.length === 0) {
-      return [];
-    }
-    const marked = /* @__PURE__ */ new Map();
-    origin.forEach((id) => marked.set(id, true));
-    let position = 0;
-    while (position < result.length) {
-      const node = this.nodes.get(result[position]);
-      if (node && !marked.get(node.id)) {
-        marked.set(node.id, true);
-        node.outputs.forEach((child) => {
-          if (!marked.get(child) && !result.find((id) => id === child)) {
-            result.push(child);
-          }
-        });
-      }
-      position += 1;
-    }
-    return result;
-  }
-  expandAllInputs(origin) {
-    const result = this.expandInputs(origin);
-    if (result.length === 0) {
-      return [];
-    }
-    const marked = /* @__PURE__ */ new Map();
-    origin.forEach((id) => marked.set(id, true));
-    let position = 0;
-    while (position < result.length) {
-      const node = this.nodes.get(result[position]);
-      if (node && !marked.get(node.id)) {
-        marked.set(node.id, true);
-        node.inputs.forEach((child) => {
-          if (!marked.get(child) && !result.find((id) => id === child)) {
-            result.push(child);
-          }
-        });
-      }
-      position += 1;
-    }
-    return result;
-  }
-  maximizePart(origin) {
-    const outputs = this.expandAllOutputs(origin);
-    const result = [...origin];
-    this.topologicalOrder().filter((id) => outputs.includes(id)).forEach((id) => {
-      const node = this.nodes.get(id);
-      if (node?.inputs.every((parent) => result.includes(parent))) {
-        result.push(id);
-      }
-    });
-    return result;
-  }
-  topologicalOrder() {
-    const result = [];
-    const marked = /* @__PURE__ */ new Set();
-    const nodeStack = [];
-    this.nodes.forEach((node) => {
-      if (marked.has(node.id)) {
-        return;
-      }
-      nodeStack.push(node.id);
-      while (nodeStack.length > 0) {
-        const item = nodeStack[nodeStack.length - 1];
-        if (marked.has(item)) {
-          if (!result.find((id) => id === item)) {
-            result.push(item);
-          }
-          nodeStack.pop();
-        } else {
-          marked.add(item);
-          const itemNode = this.nodes.get(item);
-          if (itemNode && itemNode.outputs.length > 0) {
-            itemNode.outputs.forEach((child) => {
-              if (!marked.has(child)) {
-                nodeStack.push(child);
-              }
-            });
-          }
-        }
-      }
-    });
-    return result.reverse();
-  }
-  /**
-   * Stably reorders the given node ids so that, for this DAG, no node appears before a transitive
-   * successor (edges: source → dependent; {@link GraphNode.outputs} lists dependents).
-   */
-  sortStable(target) {
-    if (target.length <= 1) {
-      return [...target];
-    }
-    const reachable = this.buildTransitiveClosureForSort();
-    const testSet = /* @__PURE__ */ new Set();
-    const result = [];
-    for (const nodeId of [...target].reverse()) {
-      const nodeReachable = reachable.get(nodeId) ?? /* @__PURE__ */ new Set();
-      const needMove = testSet.has(nodeId);
-      for (const childId of nodeReachable) {
-        testSet.add(childId);
-      }
-      if (!needMove) {
-        result.push(nodeId);
-        continue;
-      }
-      let inserted = false;
-      for (let index = 0; index < result.length; index++) {
-        const parent = result[index];
-        const parentReachable = reachable.get(parent) ?? /* @__PURE__ */ new Set();
-        if (nodeReachable.has(parent)) {
-          if (parentReachable.has(nodeId)) {
-            result.push(nodeId);
-          } else {
-            result.splice(index, 0, nodeId);
-          }
-          inserted = true;
-          break;
-        }
-      }
-      if (!inserted) {
-        result.push(nodeId);
-      }
-    }
-    result.reverse();
-    return result;
-  }
-  buildTransitiveClosureForSort() {
-    const closure = /* @__PURE__ */ new Map();
-    for (const node of this.nodes.values()) {
-      closure.set(node.id, new Set(node.outputs));
-    }
-    const order = this.topologicalOrder();
-    for (const nodeId of [...order].reverse()) {
-      const node = this.at(nodeId);
-      if (!node) {
-        continue;
-      }
-      const nodeClosure = closure.get(nodeId) ?? /* @__PURE__ */ new Set();
-      for (const parentId of node.inputs) {
-        const parentClosure = closure.get(parentId) ?? /* @__PURE__ */ new Set();
-        for (const childId of nodeClosure) {
-          parentClosure.add(childId);
-        }
-        closure.set(parentId, parentClosure);
-      }
-    }
-    return closure;
-  }
-  transitiveReduction() {
-    const order = this.topologicalOrder();
-    const marked = /* @__PURE__ */ new Map();
-    order.forEach((nodeID) => {
-      if (marked.get(nodeID)) {
-        return;
-      }
-      const stack = [];
-      stack.push({ id: nodeID, parents: [] });
-      while (stack.length > 0) {
-        const item = stack.splice(0, 1)[0];
-        const node = this.nodes.get(item.id);
-        if (node) {
-          node.outputs.forEach((child) => {
-            item.parents.forEach((parent) => this.removeEdge(parent, child));
-            stack.push({ id: child, parents: [item.id, ...item.parents] });
-          });
-        }
-        marked.set(item.id, true);
-      }
-    });
-  }
-  /**
-   * Finds a cycle in the graph.
-   *
-   * @returns {NodeID[] | null} The cycle if found, otherwise `null`.
-   * Uses non-recursive DFS.
-   */
-  findCycle() {
-    const visited = /* @__PURE__ */ new Set();
-    const nodeStack = /* @__PURE__ */ new Set();
-    const parents = /* @__PURE__ */ new Map();
-    for (const nodeId of this.nodes.keys()) {
-      if (visited.has(nodeId)) {
-        continue;
-      }
-      const callStack = [];
-      callStack.push({ nodeId, parentId: null });
-      while (callStack.length > 0) {
-        const { nodeId: nodeId2, parentId } = callStack[callStack.length - 1];
-        if (visited.has(nodeId2)) {
-          nodeStack.delete(nodeId2);
-          callStack.pop();
-          continue;
-        }
-        visited.add(nodeId2);
-        nodeStack.add(nodeId2);
-        if (parentId !== null) {
-          parents.set(nodeId2, parentId);
-        }
-        const currentNode = this.nodes.get(nodeId2);
-        for (const child of currentNode.outputs) {
-          if (!visited.has(child)) {
-            callStack.push({ nodeId: child, parentId: nodeId2 });
-            continue;
-          }
-          if (!nodeStack.has(child)) {
-            continue;
-          }
-          const cycle = [];
-          let current = nodeId2;
-          cycle.push(child);
-          while (current !== child) {
-            cycle.push(current);
-            current = parents.get(current);
-          }
-          cycle.push(child);
-          cycle.reverse();
-          return cycle;
-        }
-      }
-    }
-    return null;
-  }
-};
-export {
-  Graph
-};
-//# sourceMappingURL=index.js.map
+import { Graph } from "./graph.js";
+export { Graph };

package/dist/graph-DR8rL2o3.d.ts

@@ -0,0 +1,64 @@
+//#region src/graph/graph.d.ts
+/**
+ * Module: Custom graph data structure.
+ */
+/** Represents single node of a {@link Graph}, as implemented by storing outgoing and incoming connections. */
+declare class GraphNode<NodeID> {
+  /** Unique identifier of the node. */
+  id: NodeID;
+  /** List of outgoing nodes. */
+  outputs: NodeID[];
+  /** List of incoming nodes. */
+  inputs: NodeID[];
+  constructor(id: NodeID);
+  clone(): GraphNode<NodeID>;
+  addOutput(node: NodeID): void;
+  addInput(node: NodeID): void;
+  removeInput(target: NodeID): NodeID | null;
+  removeOutput(target: NodeID): NodeID | null;
+}
+/**
+ * Represents a Graph.
+ *
+ * This class is optimized for TermGraph use case and not supposed to be used as generic graph implementation.
+ */
+declare class Graph<NodeID = number> {
+  /** Map of nodes. */
+  nodes: Map<NodeID, GraphNode<NodeID>>;
+  constructor(arr?: NodeID[][]);
+  clone(): Graph<NodeID>;
+  at(target: NodeID): GraphNode<NodeID> | undefined;
+  addNode(target: NodeID): GraphNode<NodeID>;
+  hasNode(target: NodeID): boolean;
+  removeNode(target: NodeID): void;
+  foldNode(target: NodeID): void;
+  removeIsolated(): GraphNode<NodeID>[];
+  addEdge(source: NodeID, destination: NodeID): void;
+  removeEdge(source: NodeID, destination: NodeID): void;
+  hasEdge(source: NodeID, destination: NodeID): boolean;
+  isReachable(source: NodeID, destination: NodeID): boolean;
+  rootNodes(): NodeID[];
+  expandOutputs(origin: NodeID[]): NodeID[];
+  expandInputs(origin: NodeID[]): NodeID[];
+  expandAllOutputs(origin: NodeID[]): NodeID[];
+  expandAllInputs(origin: NodeID[]): NodeID[];
+  maximizePart(origin: NodeID[]): NodeID[];
+  topologicalOrder(): NodeID[];
+  /**
+   * Stably reorders the given node ids so that, for this DAG, no node appears before a transitive
+   * successor (edges: source → dependent; {@link GraphNode.outputs} lists dependents).
+   */
+  sortStable(target: NodeID[]): NodeID[];
+  private buildTransitiveClosureForSort;
+  transitiveReduction(): void;
+  /**
+   * Finds a cycle in the graph.
+   *
+   * @returns {NodeID[] | null} The cycle if found, otherwise `null`.
+   * Uses non-recursive DFS.
+   */
+  findCycle(): NodeID[] | null;
+}
+//#endregion
+export { GraphNode as n, Graph as t };
+//# sourceMappingURL=graph-DR8rL2o3.d.ts.map

package/dist/hash-Y8I4c6Al.d.ts

@@ -0,0 +1,8 @@
+//#region src/shared/hash.d.ts
+/** 32-bit FNV-1a hash */
+declare function applyHash_fnv1a(str: string): number;
+/** Generates stub ID for text. */
+declare function generateStub(text: string): string;
+//#endregion
+export { generateStub as n, applyHash_fnv1a as t };
+//# sourceMappingURL=hash-Y8I4c6Al.d.ts.map

package/dist/index-BKZ67WMa.d.ts

@@ -0,0 +1 @@
+export { };

package/dist/index-BVVgDSdq.d.ts

@@ -0,0 +1 @@
+export { };

package/dist/index-DmtQKWjk.d.ts

@@ -0,0 +1 @@
+export { };

package/dist/index-_6s0AX1B.d.ts

@@ -0,0 +1 @@
+export { };

package/dist/index.d.ts

@@ -1,28 +1,27 @@
-export { EntityReference, Grammeme, ReferenceType, SyntacticReference, TermContext, WordForm, supportedGrammemes } from './cctext/language.js';
-export { Graph } from './graph/graph.js';
-export { FolderNode, FolderTree } from './library/folder-tree.js';
-export { AccessPolicy, CurrentVersion, LibraryItem, LibraryItemReference, LibraryItemType, LocationHead, VersionInfo } from './library/library.js';
-export { Block, CstSubstituteInfo, NodeType, Operation, OperationInput, OperationSchema, OperationSchemaStats, OperationSynthesis, OperationType, OssItem, SubstitutionErrorDescription, SubstitutionErrorType } from './library/oss.js';
-export { OssLayout, Position2D } from './library/oss-layout.js';
-export { RSEngine } from './library/rsengine.js';
-export { ArgumentValue, Attribution, Constituenta, CstClass, CstStatus, CstType, RSForm, RSFormStats, Substitution, TypeInfo } from './library/rsform.js';
-export { BasicBinding, BasicsContext, DEFAULT_VALUE_TEXT, EvalStatus, RSModel, RSModelStats } from './library/rsmodel.js';
-export { AstNode, AstNodeBase, FlatAST, FlatAstNode, TOKEN_ERROR, buildTree, findByUid, flattenAst, getNodeIndices, getNodeText, printAst, visitAstDFS } from './parsing/ast.js';
-export { CMSyntaxNode, printTree } from './parsing/lezer-tree.js';
-export { readErrorAnnotation, readTypeAnnotation } from './rslang/ast-annotations.js';
-export { RSErrorCode, RSErrorDescription } from './rslang/error.js';
-export { CalculatorEvaluateOptions, CalculatorResult, RSCalculator } from './rslang/eval/calculator.js';
-export { Value, ValuePath, makeValuePath } from './rslang/eval/value.js';
-export { printValue } from './rslang/eval/value-api.js';
-export { parser as rslangParser } from './rslang/parser/parser.js';
-export { TokenID } from './rslang/parser/token.js';
-export { AnalysisBase, AnalysisFast, AnalysisFull, RSLangAnalyzer } from './rslang/semantic/analyzer.js';
-export { ArgumentsType } from './rslang/semantic/arguments-extractor.js';
-export { AnyTypificationT, EmptySetT, ExpressionType, LogicT, TypeClass, TypeID, TypePath, Typification, makeTypePath } from './rslang/semantic/typification.js';
-export { applyAsciiTypeSubstitutions, parseTypeText } from './rslang/semantic/typification-parser.js';
-export { ValueClass } from './rslang/semantic/value-class.js';
-export { TypificationGraph, TypificationNodeData } from './rslang/typification-graph.js';
-export { Branded } from './shared/branded.js';
-export { applyHash_fnv1a, generateStub } from './shared/hash.js';
-import '@lezer/common';
-import '@lezer/lr';
+import { EntityReference, Grammeme, ReferenceType, SyntacticReference, TermContext, WordForm, supportedGrammemes } from "./cctext/language.js";
+import { t as Graph } from "./graph-DR8rL2o3.js";
+import { FolderNode, FolderTree } from "./library/folder-tree.js";
+import { a as LibraryItemType, i as LibraryItemReference, n as CurrentVersion, o as LocationHead, r as LibraryItem, s as VersionInfo, t as AccessPolicy } from "./library-CYun28Xz.js";
+import { n as OssLayout, r as Position2D } from "./oss-layout-3glgAqfn.js";
+import { Block, CstSubstituteInfo, NodeType, Operation, OperationInput, OperationSchema, OperationSchemaStats, OperationSynthesis, OperationType, OssItem, SubstitutionErrorDescription, SubstitutionErrorType } from "./library/oss.js";
+import { r as printTree, t as CMSyntaxNode } from "./lezer-tree-iS7LpLBJ.js";
+import { a as TOKEN_ERROR, c as flattenAst, d as printAst, f as visitAstDFS, i as FlatAstNode, l as getNodeIndices, n as AstNodeBase, o as buildTree, r as FlatAST, s as findByUid, t as AstNode, u as getNodeText } from "./ast-C8sIpKdL.js";
+import { t as Branded } from "./branded-ZlzIcxzu.js";
+import { n as generateStub, t as applyHash_fnv1a } from "./hash-Y8I4c6Al.js";
+import { O as makeTypePath, b as Typification, d as EmptySetT, f as ExpressionType, g as TypeClass, m as LogicT, t as AnyTypificationT, v as TypeID, y as TypePath } from "./typification-Dk-fisgO.js";
+import { i as RSErrorDescription, r as RSErrorCode } from "./error-E1LVq_3w.js";
+import { i as readTypeAnnotation, r as readErrorAnnotation } from "./ast-annotations-BiMjkKvz.js";
+import { c as Value, f as makeValuePath, u as ValuePath } from "./value-CTjX6825.js";
+import { n as CalculatorResult, r as RSCalculator, t as CalculatorEvaluateOptions } from "./calculator-C9W2jkSx.js";
+import { d as printValue } from "./value-api-Bw-SgaYY.js";
+import { t as parser } from "./parser-Bwd8LxJ1.js";
+import { t as TokenID } from "./token-DeXAmzwr.js";
+import { t as ValueClass } from "./value-class-CNI-lqXJ.js";
+import { a as RSLangAnalyzer, n as AnalysisFast, r as AnalysisFull, t as AnalysisBase } from "./analyzer-DlSq3Y3r.js";
+import { n as ArgumentsType } from "./arguments-extractor-1acwjQNc.js";
+import { n as applyAsciiTypeSubstitutions, r as parseTypeText } from "./typification-parser-BBVx1RxP.js";
+import { n as TypificationNodeData, t as TypificationGraph } from "./typification-graph-6HcZ-rKH.js";
+import { ArgumentValue, Attribution, Constituenta, CstClass, CstStatus, CstType, RSForm, RSFormStats, Substitution, TypeInfo } from "./library/rsform.js";
+import { BasicBinding, BasicsContext, DEFAULT_VALUE_TEXT, EvalStatus, RSModel, RSModelStats } from "./library/rsmodel.js";
+import { RSEngine } from "./library/rsengine.js";
+export { AccessPolicy, type AnalysisBase, type AnalysisFast, type AnalysisFull, AnyTypificationT, type ArgumentValue, type ArgumentsType, type AstNode, type AstNodeBase, type Attribution, type BasicBinding, type BasicsContext, type Block, type Branded, type CMSyntaxNode, type CalculatorEvaluateOptions, type CalculatorResult, type Constituenta, CstClass, CstStatus, type CstSubstituteInfo, CstType, type CurrentVersion, DEFAULT_VALUE_TEXT, EmptySetT, type EntityReference, EvalStatus, type ExpressionType, type FlatAST, type FlatAstNode, FolderNode, FolderTree, Grammeme, Graph, type LibraryItem, type LibraryItemReference, LibraryItemType, LocationHead, LogicT, NodeType, type Operation, type OperationInput, type OperationSchema, type OperationSchemaStats, type OperationSynthesis, OperationType, type OssItem, type OssLayout, type Position2D, RSCalculator, RSEngine, RSErrorCode, type RSErrorDescription, type RSForm, type RSFormStats, RSLangAnalyzer, type RSModel, type RSModelStats, ReferenceType, type Substitution, type SubstitutionErrorDescription, SubstitutionErrorType, type SyntacticReference, TOKEN_ERROR, type TermContext, TokenID, TypeClass, TypeID, type TypeInfo, type TypePath, type Typification, TypificationGraph, type TypificationNodeData, type Value, ValueClass, type ValuePath, type VersionInfo, type WordForm, applyAsciiTypeSubstitutions, applyHash_fnv1a, buildTree, findByUid, flattenAst, generateStub, getNodeIndices, getNodeText, makeTypePath, makeValuePath, parseTypeText, printAst, printTree, printValue, readErrorAnnotation, readTypeAnnotation, parser as rslangParser, supportedGrammemes, visitAstDFS };