@langchain/langgraph 1.0.12 → 1.0.14

package/dist/graph/graph.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.cts","names":["Runnable","RunnableConfig","Graph","DrawableGraph","All","BaseCheckpointSaver","RunnableLike","LangGraphRunnableConfig","PregelNode","Pregel","PregelParams","BaseChannel","END","Send","START","RunnableCallable","StateDefinition","StateType","BranchOptions","N","IO","BranchPathReturnValue","CallOptions","Record","Promise","NodeAction","S","U","C","Branch","Omit","NodeSpec","RunInput","RunOutput","AddNodeOptions","Nodes","NodeSpecType","Set","K","NodeInput","NodeOutput","checkpointer","interruptBefore","interruptAfter","name","CompiledGraph","State","Update","ContextType","InputType","OutputType","NodeReturnType","CommandType","StreamCustomType","builder"],"sources":["../../src/graph/graph.d.ts"],"sourcesContent":["import { Runnable, RunnableConfig } from \"@langchain/core/runnables\";\nimport { Graph as DrawableGraph } from \"@langchain/core/runnables/graph\";\nimport { All, BaseCheckpointSaver } from \"@langchain/langgraph-checkpoint\";\nimport type { RunnableLike, LangGraphRunnableConfig } from \"../pregel/runnable_types.js\";\nimport { PregelNode } from \"../pregel/read.js\";\nimport { Pregel } from \"../pregel/index.js\";\nimport type { PregelParams } from \"../pregel/types.js\";\nimport { BaseChannel } from \"../channels/base.js\";\nimport { END, Send, START } from \"../constants.js\";\nimport { RunnableCallable } from \"../utils.js\";\nimport { StateDefinition, StateType } from \"./annotation.js\";\nexport interface BranchOptions<IO, N extends string, CallOptions extends LangGraphRunnableConfig = LangGraphRunnableConfig> {\n    source: N;\n    path: RunnableLike<IO, BranchPathReturnValue, CallOptions>;\n    pathMap?: Record<string, N | typeof END> | (N | typeof END)[];\n}\nexport type BranchPathReturnValue = string | Send | (string | Send)[] | Promise<string | Send | (string | Send)[]>;\ntype NodeAction<S, U, C extends StateDefinition> = RunnableLike<S, U extends object ? U & Record<string, any> : U, LangGraphRunnableConfig<StateType<C>>>;\nexport declare class Branch<IO, N extends string, CallOptions extends LangGraphRunnableConfig = LangGraphRunnableConfig> {\n    path: Runnable<IO, BranchPathReturnValue, CallOptions>;\n    ends?: Record<string, N | typeof END>;\n    constructor(options: Omit<BranchOptions<IO, N, CallOptions>, \"source\">);\n    run(writer: (dests: (string | Send)[], config: LangGraphRunnableConfig) => Runnable | void | Promise<void>, reader?: (config: CallOptions) => IO): RunnableCallable<unknown, unknown>;\n    _route(input: IO, config: CallOptions, writer: (dests: (string | Send)[], config: LangGraphRunnableConfig) => Runnable | void | Promise<void>, reader?: (config: CallOptions) => IO): Promise<Runnable | any>;\n}\nexport type NodeSpec<RunInput, RunOutput> = {\n    runnable: Runnable<RunInput, RunOutput>;\n    metadata?: Record<string, unknown>;\n    subgraphs?: Pregel<any, any>[];\n    ends?: string[];\n    defer?: boolean;\n};\nexport type AddNodeOptions<Nodes extends string = string> = {\n    metadata?: Record<string, unknown>;\n    subgraphs?: Pregel<any, any>[];\n    ends?: Nodes[];\n    defer?: boolean;\n};\nexport declare class Graph<N extends string = typeof START | typeof END, RunInput = any, RunOutput = any, NodeSpecType extends NodeSpec<RunInput, RunOutput> = NodeSpec<RunInput, RunOutput>, C extends StateDefinition = StateDefinition> {\n    nodes: Record<N, NodeSpecType>;\n    edges: Set<[N | typeof START, N | typeof END]>;\n    branches: Record<string, Record<string, Branch<RunInput, N, any>>>;\n    entryPoint?: string;\n    compiled: boolean;\n    constructor();\n    protected warnIfCompiled(message: string): void;\n    get allEdges(): Set<[string, string]>;\n    addNode<K extends string, NodeInput = RunInput, NodeOutput = RunOutput>(nodes: Record<K, NodeAction<NodeInput, NodeOutput, C>> | [\n        key: K,\n        action: NodeAction<NodeInput, NodeOutput, C>,\n        options?: AddNodeOptions\n    ][]): Graph<N | K, RunInput, RunOutput>;\n    addNode<K extends string, NodeInput = RunInput, NodeOutput = RunOutput>(key: K, action: NodeAction<NodeInput, NodeOutput, C>, options?: AddNodeOptions): Graph<N | K, RunInput, RunOutput>;\n    addEdge(startKey: N | typeof START, endKey: N | typeof END): this;\n    addConditionalEdges(source: BranchOptions<RunInput, N, LangGraphRunnableConfig<StateType<C>>>): this;\n    addConditionalEdges(source: N, path: RunnableLike<RunInput, BranchPathReturnValue, LangGraphRunnableConfig<StateType<C>>>, pathMap?: BranchOptions<RunInput, N, LangGraphRunnableConfig<StateType<C>>>[\"pathMap\"]): this;\n    /**\n     * @deprecated use `addEdge(START, key)` instead\n     */\n    setEntryPoint(key: N): this;\n    /**\n     * @deprecated use `addEdge(key, END)` instead\n     */\n    setFinishPoint(key: N): this;\n    compile({ checkpointer, interruptBefore, interruptAfter, name }?: {\n        checkpointer?: BaseCheckpointSaver | false;\n        interruptBefore?: N[] | All;\n        interruptAfter?: N[] | All;\n        name?: string;\n    }): CompiledGraph<N>;\n    validate(interrupt?: string[]): void;\n}\nexport declare class CompiledGraph<N extends string, State = any, Update = any, ContextType extends Record<string, any> = Record<string, any>, InputType = any, OutputType = any, NodeReturnType = unknown, CommandType = unknown, StreamCustomType = any> extends Pregel<Record<N | typeof START, PregelNode<State, Update>>, Record<N | typeof START | typeof END | string, BaseChannel>, ContextType & Record<string, any>, InputType, OutputType, InputType, OutputType, NodeReturnType, CommandType, StreamCustomType> {\n    \"~NodeType\": N;\n    \"~NodeReturnType\": NodeReturnType;\n    \"~RunInput\": Update;\n    \"~RunOutput\": State;\n    builder: Graph<N, State, Update>;\n    constructor({ builder, ...rest }: {\n        builder: Graph<N, State, Update>;\n    } & PregelParams<Record<N | typeof START, PregelNode<State, Update>>, Record<N | typeof START | typeof END | string, BaseChannel>>);\n    attachNode(key: N, node: NodeSpec<State, Update>): void;\n    attachEdge(start: N | typeof START, end: N | typeof END): void;\n    attachBranch(start: N | typeof START, name: string, branch: Branch<State, N>): void;\n    /**\n     * Returns a drawable representation of the computation graph.\n     */\n    getGraphAsync(config?: RunnableConfig & {\n        xray?: boolean | number;\n    }): Promise<DrawableGraph>;\n    /**\n     * Returns a drawable representation of the computation graph.\n     *\n     * @deprecated Use getGraphAsync instead. The async method will be the default in the next minor core release.\n     */\n    getGraph(config?: RunnableConfig & {\n        xray?: boolean | number;\n    }): DrawableGraph;\n}\nexport {};\n"],"mappings":";;;;;;;;;;;;;UAWiBkB,wDAAwDX,0BAA0BA;UACvFY;EADKD,IAAAA,EAEPZ,cAFoB,CAEPc,EAFO,EAEHC,qBAFG,EAEoBC,WAFpB,CAAA;EAAA,OAAA,CAAA,EAGhBC,MAHgB,CAAA,MAAA,EAGDJ,CAHC,GAAA,OAGUP,GAHV,CAAA,GAAA,CAGkBO,CAHlB,GAAA,OAG6BP,GAH7B,CAAA,EAAA;;AAAqEL,KAKvFc,qBAAAA,GALuFd,MAAAA,GAKtDM,IALsDN,GAAAA,CAAAA,MAAAA,GAKrCM,IALqCN,CAAAA,EAAAA,GAK3BiB,OAL2BjB,CAAAA,MAAAA,GAKVM,IALUN,GAAAA,CAAAA,MAAAA,GAKOM,IALPN,CAAAA,EAAAA,CAAAA;KAM9FkB,UALON,CAAAA,CAAAA,EAAAA,CAAAA,EAAAA,UAKoBH,eALpBG,CAAAA,GAKuCb,cALvCa,CAKoDO,CALpDP,EAKuDQ,CALvDR,SAAAA,MAAAA,GAK0EQ,CAL1ER,GAK8EI,MAL9EJ,CAAAA,MAAAA,EAAAA,GAAAA,CAAAA,GAKoGQ,CALpGR,EAKuGZ,uBALvGY,CAK+HF,SAL/HE,CAKyIS,CALzIT,CAAAA,CAAAA,CAAAA;AACWC,cAKFS,MALET,CAAAA,EAAAA,EAAAA,UAAAA,MAAAA,EAAAA,oBAK+Cb,uBAL/Ca,GAKyEb,uBALzEa,CAAAA,CAAAA;MAAIC,EAMjBrB,QANiBqB,CAMRD,EANQC,EAMJA,qBANIA,EAMmBC,WANnBD,CAAAA;MAAuBC,CAAAA,EAOvCC,MAPuCD,CAAAA,MAAAA,EAOxBH,CAPwBG,GAAAA,OAObV,GAPaU,CAAAA;aAAxChB,CAAAA,OAAAA,EAQewB,IARfxB,CAQoBY,aARpBZ,CAQkCc,EARlCd,EAQsCa,CARtCb,EAQyCgB,WARzChB,CAAAA,EAAAA,QAAAA,CAAAA;KACmBa,CAAAA,MAAAA,EAAAA,CAAAA,KAAAA,EAAAA,CAAAA,MAAAA,GAQKN,IARLM,CAAAA,EAAAA,EAAAA,MAAAA,EAQsBZ,uBARtBY,EAAAA,GAQkDnB,QARlDmB,GAAAA,IAAAA,GAQoEK,OARpEL,CAAAA,IAAAA,CAAAA,EAAAA,MAAAA,CAAAA,EAAAA,CAAAA,MAAAA,EAQqGG,WARrGH,EAAAA,GAQqHC,EARrHD,CAAAA,EAQ0HJ,gBAR1HI,CAAAA,OAAAA,EAAAA,OAAAA,CAAAA;QAAWP,CAAAA,KAAAA,EAStBQ,EATsBR,EAAAA,MAAAA,EASVU,WATUV,EAAAA,MAAAA,EAAAA,CAAAA,KAAAA,EAAAA,CAAAA,MAAAA,GAS6BC,IAT7BD,CAAAA,EAAAA,EAAAA,MAAAA,EAS8CL,uBAT9CK,EAAAA,GAS0EZ,QAT1EY,GAAAA,IAAAA,GAS4FY,OAT5FZ,CAAAA,IAAAA,CAAAA,EAAAA,MAAAA,CAAAA,EAAAA,CAAAA,MAAAA,EAS6HU,WAT7HV,EAAAA,GAS6IQ,EAT7IR,CAAAA,EASkJY,OATlJZ,CAS0JZ,QAT1JY,GAAAA,GAAAA,CAAAA;;AAAQO,KAWpCY,QAXoCZ,CAAAA,QAAAA,EAAAA,SAAAA,CAAAA,GAAAA;UAAWP,EAY7CZ,QAZ6CY,CAYpCoB,QAZoCpB,EAY1BqB,SAZ0BrB,CAAAA;EAAG,QAAA,CAAA,EAa/CW,MAb+C,CAAA,MAAA,EAAA,OAAA,CAAA;EAElDF,SAAAA,CAAAA,EAYIZ,MAZJY,CAAAA,GAAAA,EAAqB,GAAA,CAAA,EAAA;EAAA,IAAA,CAAA,EAAA,MAAA,EAAA;OAAYR,CAAAA,EAAAA,OAAAA;;AAA4CA,KAgB7EqB,cAhB6ErB,CAAAA,cAAAA,MAAAA,GAAAA,MAAAA,CAAAA,GAAAA;UAAiBA,CAAAA,EAiB3FU,MAjB2FV,CAAAA,MAAAA,EAAAA,OAAAA,CAAAA;WAAlCW,CAAAA,EAkBxDf,MAlBwDe,CAAAA,GAAAA,EAAAA,GAAAA,CAAAA,EAAAA;EAAO,IAAA,CAAA,EAmBpEW,KAnBoE,EAAA;EAC1EV,KAAAA,CAAAA,EAAAA,OAAU;CAAA;AAAiBT,cAqBXd,OArBWc,CAAAA,UAAAA,MAAAA,GAAAA,OAqBqBF,KArBrBE,GAAAA,OAqBoCJ,GArBpCI,EAAAA,WAAAA,GAAAA,EAAAA,YAAAA,GAAAA,EAAAA,qBAqB+Fe,QArB/Ff,CAqBwGgB,QArBxGhB,EAqBkHiB,SArBlHjB,CAAAA,GAqB+He,QArB/Hf,CAqBwIgB,QArBxIhB,EAqBkJiB,SArBlJjB,CAAAA,EAAAA,UAqBwKA,eArBxKA,GAqB0LA,eArB1LA,CAAAA,CAAAA;OAAgCU,EAsBrDH,MAtBqDG,CAsB9CP,CAtB8CO,EAsB3CU,YAtB2CV,CAAAA;OAAGC,EAuBxDU,GAvBwDV,CAAAA,CAuBnDR,CAvBmDQ,GAAAA,OAuBxCb,KAvBwCa,EAuBjCR,CAvBiCQ,GAAAA,OAuBtBf,GAvBsBe,CAAAA,CAAAA;UAAmBA,EAwBxEJ,MAxBwEI,CAAAA,MAAAA,EAwBzDJ,MAxByDI,CAAAA,MAAAA,EAwB1CE,MAxB0CF,CAwBnCK,QAxBmCL,EAwBzBR,CAxByBQ,EAAAA,GAAAA,CAAAA,CAAAA,CAAAA;YAAIJ,CAAAA,EAAAA,MAAAA;UAAsBI,EAAAA,OAAAA;aAAqCC,CAAAA;YAAVX,cAAAA,CAAAA,OAAAA,EAAAA,MAAAA,CAAAA,EAAAA,IAAAA;MAAxBV,QAAAA,CAAAA,CAAAA,EA6B/F8B,GA7B+F9B,CAAAA,CAAAA,MAAAA,EAAAA,MAAAA,CAAAA,CAAAA;SAAhED,CAAAA,UAAAA,MAAAA,EAAAA,YA8BT0B,QA9BS1B,EAAAA,aA8Bc2B,SA9Bd3B,CAAAA,CAAAA,KAAAA,EA8BgCiB,MA9BhCjB,CA8BuCgC,CA9BvChC,EA8B0CmB,UA9B1CnB,CA8BqDiC,SA9BrDjC,EA8BgEkC,UA9BhElC,EA8B4EsB,CA9B5EtB,CAAAA,CAAAA,GAAAA,CAAY,GAAA,EA+BlDgC,CA/BkD,EAC1CT,MAAM,EA+BXJ,UA/BW,CA+BAc,SA/BA,EA+BWC,UA/BX,EA+BuBZ,CA/BvB,CAAA,EAAA,OAAA,GAgCTM,cAhCS,GAA2C3B,CAAAA,EAiC5DL,OAjC4DK,CAiCtDY,CAjCsDZ,GAiClD+B,CAjCkD/B,EAiC/CyB,QAjC+CzB,EAiCrC0B,SAjCqC1B,CAAAA;SAA0BA,CAAAA,UAAAA,MAAAA,EAAAA,YAkCtDyB,QAlCsDzB,EAAAA,aAkC/B0B,SAlC+B1B,CAAAA,CAAAA,GAAAA,EAkCf+B,CAlCe/B,EAAAA,MAAAA,EAkCJkB,UAlCIlB,CAkCOgC,SAlCPhC,EAkCkBiC,UAlClBjC,EAkC8BqB,CAlC9BrB,CAAAA,EAAAA,OAAAA,CAAAA,EAkC4C2B,cAlC5C3B,CAAAA,EAkC6DL,OAlC7DK,CAkCmEY,CAlCnEZ,GAkCuE+B,CAlCvE/B,EAkC0EyB,QAlC1EzB,EAkCoF0B,SAlCpF1B,CAAAA;SAC7Ea,CAAAA,QAAAA,EAkCGD,CAlCHC,GAAAA,OAkCcN,KAlCdM,EAAAA,MAAAA,EAkC6BD,CAlC7BC,GAAAA,OAkCwCR,GAlCxCQ,CAAAA,EAAAA,IAAAA;qBAAIC,CAAAA,MAAAA,EAmCSH,aAnCTG,CAmCuBW,QAnCvBX,EAmCiCF,CAnCjCE,EAmCoCd,uBAnCpCc,CAmC4DJ,SAnC5DI,CAmCsEO,CAnCtEP,CAAAA,CAAAA,CAAAA,CAAAA,EAAAA,IAAAA;qBAAuBC,CAAAA,MAAAA,EAoCdH,CApCcG,EAAAA,IAAAA,EAoCLhB,cApCKgB,CAoCQU,QApCRV,EAoCkBD,qBApClBC,EAoCyCf,uBApCzCe,CAoCiEL,SApCjEK,CAoC2EM,CApC3EN,CAAAA,CAAAA,CAAAA,EAAAA,OAAAA,CAAAA,EAoC2FJ,aApC3FI,CAoCyGU,QApCzGV,EAoCmHH,CApCnHG,EAoCsHf,uBApCtHe,CAoC8IL,SApC9IK,CAoCwJM,CApCxJN,CAAAA,CAAAA,CAAAA,CAAAA,SAAAA,CAAAA,CAAAA,EAAAA,IAAAA;;;;eACnCC,CAAAA,GAAAA,EAuCYJ,CAvCZI,CAAAA,EAAAA,IAAAA;;;;gBACmBL,CAAAA,GAAAA,EA0CNC,CA1CMD,CAAAA,EAAAA,IAAAA;SAALY,CAAAA;IAAAA,YAAAA;IAAAA,eAAAA;IAAAA,cAAAA;IAAAA;IAAAA,EAAAA;IACSjB,YAAAA,CAAAA,EA2CXR,mBA3CWQ,GAAAA,KAAAA;IAAiBN,eAAAA,CAAAA,EA4CzBY,CA5CyBZ,EAAAA,GA4CnBH,GA5CmBG;IAA4BP,cAAAA,CAAAA,EA6CtDmB,CA7CsDnB,EAAAA,GA6ChDI,GA7CgDJ;IAAkBwB,IAAAA,CAAAA,EAAAA,MAAAA;MA+CzFqB,aA/C0HvB,CA+C5GH,CA/C4GG,CAAAA;UAAgBF,CAAAA,SAAAA,CAAAA,EAAAA,MAAAA,EAAAA,CAAAA,EAAAA,IAAAA;;AAChIA,cAiDGyB,aAjDHzB,CAAAA,UAAAA,MAAAA,EAAAA,QAAAA,GAAAA,EAAAA,SAAAA,GAAAA,EAAAA,oBAiDkFG,MAjDlFH,CAAAA,MAAAA,EAAAA,GAAAA,CAAAA,GAiDwGG,MAjDxGH,CAAAA,MAAAA,EAAAA,GAAAA,CAAAA,EAAAA,YAAAA,GAAAA,EAAAA,aAAAA,GAAAA,EAAAA,iBAAAA,OAAAA,EAAAA,cAAAA,OAAAA,EAAAA,mBAAAA,GAAAA,CAAAA,SAiDiPX,MAjDjPW,CAiDwPG,MAjDxPH,CAiD+PD,CAjD/PC,GAAAA,OAiD0QN,KAjD1QM,EAiDiRZ,UAjDjRY,CAiD4R0B,KAjD5R1B,EAiDmS2B,MAjDnS3B,CAAAA,CAAAA,EAiD6SG,MAjD7SH,CAiDoTD,CAjDpTC,GAAAA,OAiD+TN,KAjD/TM,GAAAA,OAiD8UR,GAjD9UQ,GAAAA,MAAAA,EAiD4VT,WAjD5VS,CAAAA,EAiD0W4B,WAjD1W5B,GAiDwXG,MAjDxXH,CAAAA,MAAAA,EAAAA,GAAAA,CAAAA,EAiD6Y6B,SAjD7Y7B,EAiDwZ8B,UAjDxZ9B,EAiDoa6B,SAjDpa7B,EAiD+a8B,UAjD/a9B,EAiD2b+B,cAjD3b/B,EAiD2cgC,WAjD3chC,EAiDwdiC,gBAjDxdjC,CAAAA,CAAAA;aAAYE,EAkDbH,CAlDaG;mBAAuCT,EAmD9CsC,cAnD8CtC;aAAiBN,EAoDrEwC,MApDqExC;cAA4BP,EAqDhG8C,KArDgG9C;SAAkBwB,EAsDvHtB,OAtDuHsB,CAsDjHL,CAtDiHK,EAsD9GsB,KAtD8GtB,EAsDvGuB,MAtDuGvB,CAAAA;aAAiCF,CAAAA;IAAAA,OAAAA;IAAAA,GAAAA;EAA6BtB,CAA7BsB,EAAAA;IAAgBF,OAAAA,EAwDpKlB,OAxDoKkB,CAwD9JD,CAxD8JC,EAwD3J0B,KAxD2J1B,EAwDpJ2B,MAxDoJ3B,CAAAA;MAyD7KV,YAzD0LV,CAyD7KuB,MAzD6KvB,CAyDtKmB,CAzDsKnB,GAAAA,OAyD3Jc,KAzD2Jd,EAyDpJQ,UAzDoJR,CAyDzI8C,KAzDyI9C,EAyDlI+C,MAzDkI/C,CAAAA,CAAAA,EAyDxHuB,MAzDwHvB,CAyDjHmB,CAzDiHnB,GAAAA,OAyDtGc,KAzDsGd,GAAAA,OAyDvFY,GAzDuFZ,GAAAA,MAAAA,EAyDzEW,WAzDyEX,CAAAA,CAAAA;YAARwB,CAAAA,GAAAA,EA0DtKL,CA1DsKK,EAAAA,IAAAA,EA0D7JO,QA1D6JP,CA0DpJsB,KA1DoJtB,EA0D7IuB,MA1D6IvB,CAAAA,CAAAA,EAAAA,IAAAA;EAAO,UAAA,CAAA,KAAA,EA2D3KL,CA3D2K,GAAA,OA2DhKL,KA3DgK,EAAA,GAAA,EA2DpJK,CA3DoJ,GAAA,OA2DzIP,GA3DyI,CAAA,EAAA,IAAA;EAErLmB,YAAQ,CAAA,KAAA,EA0DIZ,CA1DJ,GAAA,OA0DeL,KA1Df,EAAA,IAAA,EAAA,MAAA,EAAA,MAAA,EA0D4Ce,MA1D5C,CA0DmDiB,KA1DnD,EA0D0D3B,CA1D1D,CAAA,CAAA,EAAA,IAAA;EAAA;;;eACNnB,CAAAA,OAAAA,EA6DaC,cA7DbD,GAAAA;IACCuB,IAAAA,CAAAA,EAAAA,OAAAA,GAAAA,MAAAA;MA8DPC,OA7DQf,CA6DAN,KA7DAM,CAAAA;EAAM;AAItB;;;;UAGW0B,CAAAA,MAGUjC,CAHViC,EA4DWlC,cA5DXkC,GAAAA;IAAK,IAAA,CAAA,EAAA,OAAA,GAAA,MAAA;EAGKjC,CAAAA,CAAAA,EA2DbC,KA3DkB"}

package/dist/graph/graph.d.ts

@@ -0,0 +1,108 @@
+import { BaseChannel } from "../channels/base.js";
+import { LangGraphRunnableConfig, RunnableLike as RunnableLike$1 } from "../pregel/runnable_types.js";
+import { StateDefinition, StateType } from "./annotation.js";
+import { RunnableCallable } from "../utils.js";
+import { PregelNode } from "../pregel/read.js";
+import { END, START, Send } from "../constants.js";
+import { PregelParams } from "../pregel/types.js";
+import { Pregel } from "../pregel/index.js";
+import { All, BaseCheckpointSaver } from "@langchain/langgraph-checkpoint";
+import { Runnable, RunnableConfig } from "@langchain/core/runnables";
+import { Graph } from "@langchain/core/runnables/graph";
+
+//#region src/graph/graph.d.ts
+interface BranchOptions<IO, N extends string, CallOptions extends LangGraphRunnableConfig = LangGraphRunnableConfig> {
+  source: N;
+  path: RunnableLike$1<IO, BranchPathReturnValue, CallOptions>;
+  pathMap?: Record<string, N | typeof END> | (N | typeof END)[];
+}
+type BranchPathReturnValue = string | Send | (string | Send)[] | Promise<string | Send | (string | Send)[]>;
+type NodeAction<S, U, C extends StateDefinition> = RunnableLike$1<S, U extends object ? U & Record<string, any> : U, LangGraphRunnableConfig<StateType<C>>>;
+declare class Branch<IO, N extends string, CallOptions extends LangGraphRunnableConfig = LangGraphRunnableConfig> {
+  path: Runnable<IO, BranchPathReturnValue, CallOptions>;
+  ends?: Record<string, N | typeof END>;
+  constructor(options: Omit<BranchOptions<IO, N, CallOptions>, "source">);
+  run(writer: (dests: (string | Send)[], config: LangGraphRunnableConfig) => Runnable | void | Promise<void>, reader?: (config: CallOptions) => IO): RunnableCallable<unknown, unknown>;
+  _route(input: IO, config: CallOptions, writer: (dests: (string | Send)[], config: LangGraphRunnableConfig) => Runnable | void | Promise<void>, reader?: (config: CallOptions) => IO): Promise<Runnable | any>;
+}
+type NodeSpec<RunInput, RunOutput> = {
+  runnable: Runnable<RunInput, RunOutput>;
+  metadata?: Record<string, unknown>;
+  subgraphs?: Pregel<any, any>[];
+  ends?: string[];
+  defer?: boolean;
+};
+type AddNodeOptions<Nodes extends string = string> = {
+  metadata?: Record<string, unknown>;
+  subgraphs?: Pregel<any, any>[];
+  ends?: Nodes[];
+  defer?: boolean;
+};
+declare class Graph$1<N extends string = typeof START | typeof END, RunInput = any, RunOutput = any, NodeSpecType extends NodeSpec<RunInput, RunOutput> = NodeSpec<RunInput, RunOutput>, C extends StateDefinition = StateDefinition> {
+  nodes: Record<N, NodeSpecType>;
+  edges: Set<[N | typeof START, N | typeof END]>;
+  branches: Record<string, Record<string, Branch<RunInput, N, any>>>;
+  entryPoint?: string;
+  compiled: boolean;
+  constructor();
+  protected warnIfCompiled(message: string): void;
+  get allEdges(): Set<[string, string]>;
+  addNode<K extends string, NodeInput = RunInput, NodeOutput = RunOutput>(nodes: Record<K, NodeAction<NodeInput, NodeOutput, C>> | [key: K, action: NodeAction<NodeInput, NodeOutput, C>, options?: AddNodeOptions][]): Graph$1<N | K, RunInput, RunOutput>;
+  addNode<K extends string, NodeInput = RunInput, NodeOutput = RunOutput>(key: K, action: NodeAction<NodeInput, NodeOutput, C>, options?: AddNodeOptions): Graph$1<N | K, RunInput, RunOutput>;
+  addEdge(startKey: N | typeof START, endKey: N | typeof END): this;
+  addConditionalEdges(source: BranchOptions<RunInput, N, LangGraphRunnableConfig<StateType<C>>>): this;
+  addConditionalEdges(source: N, path: RunnableLike$1<RunInput, BranchPathReturnValue, LangGraphRunnableConfig<StateType<C>>>, pathMap?: BranchOptions<RunInput, N, LangGraphRunnableConfig<StateType<C>>>["pathMap"]): this;
+  /**
+   * @deprecated use `addEdge(START, key)` instead
+   */
+  setEntryPoint(key: N): this;
+  /**
+   * @deprecated use `addEdge(key, END)` instead
+   */
+  setFinishPoint(key: N): this;
+  compile({
+    checkpointer,
+    interruptBefore,
+    interruptAfter,
+    name
+  }?: {
+    checkpointer?: BaseCheckpointSaver | false;
+    interruptBefore?: N[] | All;
+    interruptAfter?: N[] | All;
+    name?: string;
+  }): CompiledGraph<N>;
+  validate(interrupt?: string[]): void;
+}
+declare class CompiledGraph<N extends string, State = any, Update = any, ContextType extends Record<string, any> = Record<string, any>, InputType = any, OutputType = any, NodeReturnType = unknown, CommandType = unknown, StreamCustomType = any> extends Pregel<Record<N | typeof START, PregelNode<State, Update>>, Record<N | typeof START | typeof END | string, BaseChannel>, ContextType & Record<string, any>, InputType, OutputType, InputType, OutputType, NodeReturnType, CommandType, StreamCustomType> {
+  "~NodeType": N;
+  "~NodeReturnType": NodeReturnType;
+  "~RunInput": Update;
+  "~RunOutput": State;
+  builder: Graph$1<N, State, Update>;
+  constructor({
+    builder,
+    ...rest
+  }: {
+    builder: Graph$1<N, State, Update>;
+  } & PregelParams<Record<N | typeof START, PregelNode<State, Update>>, Record<N | typeof START | typeof END | string, BaseChannel>>);
+  attachNode(key: N, node: NodeSpec<State, Update>): void;
+  attachEdge(start: N | typeof START, end: N | typeof END): void;
+  attachBranch(start: N | typeof START, name: string, branch: Branch<State, N>): void;
+  /**
+   * Returns a drawable representation of the computation graph.
+   */
+  getGraphAsync(config?: RunnableConfig & {
+    xray?: boolean | number;
+  }): Promise<Graph>;
+  /**
+   * Returns a drawable representation of the computation graph.
+   *
+   * @deprecated Use getGraphAsync instead. The async method will be the default in the next minor core release.
+   */
+  getGraph(config?: RunnableConfig & {
+    xray?: boolean | number;
+  }): Graph;
+}
+//#endregion
+export { AddNodeOptions, Branch, CompiledGraph, Graph$1 as Graph, NodeSpec };
+//# sourceMappingURL=graph.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","names":["Runnable","RunnableConfig","Graph","DrawableGraph","All","BaseCheckpointSaver","RunnableLike","LangGraphRunnableConfig","PregelNode","Pregel","PregelParams","BaseChannel","END","Send","START","RunnableCallable","StateDefinition","StateType","BranchOptions","N","IO","BranchPathReturnValue","CallOptions","Record","Promise","NodeAction","S","U","C","Branch","Omit","NodeSpec","RunInput","RunOutput","AddNodeOptions","Nodes","NodeSpecType","Set","K","NodeInput","NodeOutput","checkpointer","interruptBefore","interruptAfter","name","CompiledGraph","State","Update","ContextType","InputType","OutputType","NodeReturnType","CommandType","StreamCustomType","builder"],"sources":["../../src/graph/graph.d.ts"],"sourcesContent":["import { Runnable, RunnableConfig } from \"@langchain/core/runnables\";\nimport { Graph as DrawableGraph } from \"@langchain/core/runnables/graph\";\nimport { All, BaseCheckpointSaver } from \"@langchain/langgraph-checkpoint\";\nimport type { RunnableLike, LangGraphRunnableConfig } from \"../pregel/runnable_types.js\";\nimport { PregelNode } from \"../pregel/read.js\";\nimport { Pregel } from \"../pregel/index.js\";\nimport type { PregelParams } from \"../pregel/types.js\";\nimport { BaseChannel } from \"../channels/base.js\";\nimport { END, Send, START } from \"../constants.js\";\nimport { RunnableCallable } from \"../utils.js\";\nimport { StateDefinition, StateType } from \"./annotation.js\";\nexport interface BranchOptions<IO, N extends string, CallOptions extends LangGraphRunnableConfig = LangGraphRunnableConfig> {\n    source: N;\n    path: RunnableLike<IO, BranchPathReturnValue, CallOptions>;\n    pathMap?: Record<string, N | typeof END> | (N | typeof END)[];\n}\nexport type BranchPathReturnValue = string | Send | (string | Send)[] | Promise<string | Send | (string | Send)[]>;\ntype NodeAction<S, U, C extends StateDefinition> = RunnableLike<S, U extends object ? U & Record<string, any> : U, LangGraphRunnableConfig<StateType<C>>>;\nexport declare class Branch<IO, N extends string, CallOptions extends LangGraphRunnableConfig = LangGraphRunnableConfig> {\n    path: Runnable<IO, BranchPathReturnValue, CallOptions>;\n    ends?: Record<string, N | typeof END>;\n    constructor(options: Omit<BranchOptions<IO, N, CallOptions>, \"source\">);\n    run(writer: (dests: (string | Send)[], config: LangGraphRunnableConfig) => Runnable | void | Promise<void>, reader?: (config: CallOptions) => IO): RunnableCallable<unknown, unknown>;\n    _route(input: IO, config: CallOptions, writer: (dests: (string | Send)[], config: LangGraphRunnableConfig) => Runnable | void | Promise<void>, reader?: (config: CallOptions) => IO): Promise<Runnable | any>;\n}\nexport type NodeSpec<RunInput, RunOutput> = {\n    runnable: Runnable<RunInput, RunOutput>;\n    metadata?: Record<string, unknown>;\n    subgraphs?: Pregel<any, any>[];\n    ends?: string[];\n    defer?: boolean;\n};\nexport type AddNodeOptions<Nodes extends string = string> = {\n    metadata?: Record<string, unknown>;\n    subgraphs?: Pregel<any, any>[];\n    ends?: Nodes[];\n    defer?: boolean;\n};\nexport declare class Graph<N extends string = typeof START | typeof END, RunInput = any, RunOutput = any, NodeSpecType extends NodeSpec<RunInput, RunOutput> = NodeSpec<RunInput, RunOutput>, C extends StateDefinition = StateDefinition> {\n    nodes: Record<N, NodeSpecType>;\n    edges: Set<[N | typeof START, N | typeof END]>;\n    branches: Record<string, Record<string, Branch<RunInput, N, any>>>;\n    entryPoint?: string;\n    compiled: boolean;\n    constructor();\n    protected warnIfCompiled(message: string): void;\n    get allEdges(): Set<[string, string]>;\n    addNode<K extends string, NodeInput = RunInput, NodeOutput = RunOutput>(nodes: Record<K, NodeAction<NodeInput, NodeOutput, C>> | [\n        key: K,\n        action: NodeAction<NodeInput, NodeOutput, C>,\n        options?: AddNodeOptions\n    ][]): Graph<N | K, RunInput, RunOutput>;\n    addNode<K extends string, NodeInput = RunInput, NodeOutput = RunOutput>(key: K, action: NodeAction<NodeInput, NodeOutput, C>, options?: AddNodeOptions): Graph<N | K, RunInput, RunOutput>;\n    addEdge(startKey: N | typeof START, endKey: N | typeof END): this;\n    addConditionalEdges(source: BranchOptions<RunInput, N, LangGraphRunnableConfig<StateType<C>>>): this;\n    addConditionalEdges(source: N, path: RunnableLike<RunInput, BranchPathReturnValue, LangGraphRunnableConfig<StateType<C>>>, pathMap?: BranchOptions<RunInput, N, LangGraphRunnableConfig<StateType<C>>>[\"pathMap\"]): this;\n    /**\n     * @deprecated use `addEdge(START, key)` instead\n     */\n    setEntryPoint(key: N): this;\n    /**\n     * @deprecated use `addEdge(key, END)` instead\n     */\n    setFinishPoint(key: N): this;\n    compile({ checkpointer, interruptBefore, interruptAfter, name }?: {\n        checkpointer?: BaseCheckpointSaver | false;\n        interruptBefore?: N[] | All;\n        interruptAfter?: N[] | All;\n        name?: string;\n    }): CompiledGraph<N>;\n    validate(interrupt?: string[]): void;\n}\nexport declare class CompiledGraph<N extends string, State = any, Update = any, ContextType extends Record<string, any> = Record<string, any>, InputType = any, OutputType = any, NodeReturnType = unknown, CommandType = unknown, StreamCustomType = any> extends Pregel<Record<N | typeof START, PregelNode<State, Update>>, Record<N | typeof START | typeof END | string, BaseChannel>, ContextType & Record<string, any>, InputType, OutputType, InputType, OutputType, NodeReturnType, CommandType, StreamCustomType> {\n    \"~NodeType\": N;\n    \"~NodeReturnType\": NodeReturnType;\n    \"~RunInput\": Update;\n    \"~RunOutput\": State;\n    builder: Graph<N, State, Update>;\n    constructor({ builder, ...rest }: {\n        builder: Graph<N, State, Update>;\n    } & PregelParams<Record<N | typeof START, PregelNode<State, Update>>, Record<N | typeof START | typeof END | string, BaseChannel>>);\n    attachNode(key: N, node: NodeSpec<State, Update>): void;\n    attachEdge(start: N | typeof START, end: N | typeof END): void;\n    attachBranch(start: N | typeof START, name: string, branch: Branch<State, N>): void;\n    /**\n     * Returns a drawable representation of the computation graph.\n     */\n    getGraphAsync(config?: RunnableConfig & {\n        xray?: boolean | number;\n    }): Promise<DrawableGraph>;\n    /**\n     * Returns a drawable representation of the computation graph.\n     *\n     * @deprecated Use getGraphAsync instead. The async method will be the default in the next minor core release.\n     */\n    getGraph(config?: RunnableConfig & {\n        xray?: boolean | number;\n    }): DrawableGraph;\n}\nexport {};\n"],"mappings":";;;;;;;;;;;;;UAWiBkB,wDAAwDX,0BAA0BA;UACvFY;EADKD,IAAAA,EAEPZ,cAFoB,CAEPc,EAFO,EAEHC,qBAFG,EAEoBC,WAFpB,CAAA;EAAA,OAAA,CAAA,EAGhBC,MAHgB,CAAA,MAAA,EAGDJ,CAHC,GAAA,OAGUP,GAHV,CAAA,GAAA,CAGkBO,CAHlB,GAAA,OAG6BP,GAH7B,CAAA,EAAA;;AAAqEL,KAKvFc,qBAAAA,GALuFd,MAAAA,GAKtDM,IALsDN,GAAAA,CAAAA,MAAAA,GAKrCM,IALqCN,CAAAA,EAAAA,GAK3BiB,OAL2BjB,CAAAA,MAAAA,GAKVM,IALUN,GAAAA,CAAAA,MAAAA,GAKOM,IALPN,CAAAA,EAAAA,CAAAA;KAM9FkB,UALON,CAAAA,CAAAA,EAAAA,CAAAA,EAAAA,UAKoBH,eALpBG,CAAAA,GAKuCb,cALvCa,CAKoDO,CALpDP,EAKuDQ,CALvDR,SAAAA,MAAAA,GAK0EQ,CAL1ER,GAK8EI,MAL9EJ,CAAAA,MAAAA,EAAAA,GAAAA,CAAAA,GAKoGQ,CALpGR,EAKuGZ,uBALvGY,CAK+HF,SAL/HE,CAKyIS,CALzIT,CAAAA,CAAAA,CAAAA;AACWC,cAKFS,MALET,CAAAA,EAAAA,EAAAA,UAAAA,MAAAA,EAAAA,oBAK+Cb,uBAL/Ca,GAKyEb,uBALzEa,CAAAA,CAAAA;MAAIC,EAMjBrB,QANiBqB,CAMRD,EANQC,EAMJA,qBANIA,EAMmBC,WANnBD,CAAAA;MAAuBC,CAAAA,EAOvCC,MAPuCD,CAAAA,MAAAA,EAOxBH,CAPwBG,GAAAA,OAObV,GAPaU,CAAAA;aAAxChB,CAAAA,OAAAA,EAQewB,IARfxB,CAQoBY,aARpBZ,CAQkCc,EARlCd,EAQsCa,CARtCb,EAQyCgB,WARzChB,CAAAA,EAAAA,QAAAA,CAAAA;KACmBa,CAAAA,MAAAA,EAAAA,CAAAA,KAAAA,EAAAA,CAAAA,MAAAA,GAQKN,IARLM,CAAAA,EAAAA,EAAAA,MAAAA,EAQsBZ,uBARtBY,EAAAA,GAQkDnB,QARlDmB,GAAAA,IAAAA,GAQoEK,OARpEL,CAAAA,IAAAA,CAAAA,EAAAA,MAAAA,CAAAA,EAAAA,CAAAA,MAAAA,EAQqGG,WARrGH,EAAAA,GAQqHC,EARrHD,CAAAA,EAQ0HJ,gBAR1HI,CAAAA,OAAAA,EAAAA,OAAAA,CAAAA;QAAWP,CAAAA,KAAAA,EAStBQ,EATsBR,EAAAA,MAAAA,EASVU,WATUV,EAAAA,MAAAA,EAAAA,CAAAA,KAAAA,EAAAA,CAAAA,MAAAA,GAS6BC,IAT7BD,CAAAA,EAAAA,EAAAA,MAAAA,EAS8CL,uBAT9CK,EAAAA,GAS0EZ,QAT1EY,GAAAA,IAAAA,GAS4FY,OAT5FZ,CAAAA,IAAAA,CAAAA,EAAAA,MAAAA,CAAAA,EAAAA,CAAAA,MAAAA,EAS6HU,WAT7HV,EAAAA,GAS6IQ,EAT7IR,CAAAA,EASkJY,OATlJZ,CAS0JZ,QAT1JY,GAAAA,GAAAA,CAAAA;;AAAQO,KAWpCY,QAXoCZ,CAAAA,QAAAA,EAAAA,SAAAA,CAAAA,GAAAA;UAAWP,EAY7CZ,QAZ6CY,CAYpCoB,QAZoCpB,EAY1BqB,SAZ0BrB,CAAAA;EAAG,QAAA,CAAA,EAa/CW,MAb+C,CAAA,MAAA,EAAA,OAAA,CAAA;EAElDF,SAAAA,CAAAA,EAYIZ,MAZJY,CAAAA,GAAAA,EAAqB,GAAA,CAAA,EAAA;EAAA,IAAA,CAAA,EAAA,MAAA,EAAA;OAAYR,CAAAA,EAAAA,OAAAA;;AAA4CA,KAgB7EqB,cAhB6ErB,CAAAA,cAAAA,MAAAA,GAAAA,MAAAA,CAAAA,GAAAA;UAAiBA,CAAAA,EAiB3FU,MAjB2FV,CAAAA,MAAAA,EAAAA,OAAAA,CAAAA;WAAlCW,CAAAA,EAkBxDf,MAlBwDe,CAAAA,GAAAA,EAAAA,GAAAA,CAAAA,EAAAA;EAAO,IAAA,CAAA,EAmBpEW,KAnBoE,EAAA;EAC1EV,KAAAA,CAAAA,EAAAA,OAAU;CAAA;AAAiBT,cAqBXd,OArBWc,CAAAA,UAAAA,MAAAA,GAAAA,OAqBqBF,KArBrBE,GAAAA,OAqBoCJ,GArBpCI,EAAAA,WAAAA,GAAAA,EAAAA,YAAAA,GAAAA,EAAAA,qBAqB+Fe,QArB/Ff,CAqBwGgB,QArBxGhB,EAqBkHiB,SArBlHjB,CAAAA,GAqB+He,QArB/Hf,CAqBwIgB,QArBxIhB,EAqBkJiB,SArBlJjB,CAAAA,EAAAA,UAqBwKA,eArBxKA,GAqB0LA,eArB1LA,CAAAA,CAAAA;OAAgCU,EAsBrDH,MAtBqDG,CAsB9CP,CAtB8CO,EAsB3CU,YAtB2CV,CAAAA;OAAGC,EAuBxDU,GAvBwDV,CAAAA,CAuBnDR,CAvBmDQ,GAAAA,OAuBxCb,KAvBwCa,EAuBjCR,CAvBiCQ,GAAAA,OAuBtBf,GAvBsBe,CAAAA,CAAAA;UAAmBA,EAwBxEJ,MAxBwEI,CAAAA,MAAAA,EAwBzDJ,MAxByDI,CAAAA,MAAAA,EAwB1CE,MAxB0CF,CAwBnCK,QAxBmCL,EAwBzBR,CAxByBQ,EAAAA,GAAAA,CAAAA,CAAAA,CAAAA;YAAIJ,CAAAA,EAAAA,MAAAA;UAAsBI,EAAAA,OAAAA;aAAqCC,CAAAA;YAAVX,cAAAA,CAAAA,OAAAA,EAAAA,MAAAA,CAAAA,EAAAA,IAAAA;MAAxBV,QAAAA,CAAAA,CAAAA,EA6B/F8B,GA7B+F9B,CAAAA,CAAAA,MAAAA,EAAAA,MAAAA,CAAAA,CAAAA;SAAhED,CAAAA,UAAAA,MAAAA,EAAAA,YA8BT0B,QA9BS1B,EAAAA,aA8Bc2B,SA9Bd3B,CAAAA,CAAAA,KAAAA,EA8BgCiB,MA9BhCjB,CA8BuCgC,CA9BvChC,EA8B0CmB,UA9B1CnB,CA8BqDiC,SA9BrDjC,EA8BgEkC,UA9BhElC,EA8B4EsB,CA9B5EtB,CAAAA,CAAAA,GAAAA,CAAY,GAAA,EA+BlDgC,CA/BkD,EAC1CT,MAAM,EA+BXJ,UA/BW,CA+BAc,SA/BA,EA+BWC,UA/BX,EA+BuBZ,CA/BvB,CAAA,EAAA,OAAA,GAgCTM,cAhCS,GAA2C3B,CAAAA,EAiC5DL,OAjC4DK,CAiCtDY,CAjCsDZ,GAiClD+B,CAjCkD/B,EAiC/CyB,QAjC+CzB,EAiCrC0B,SAjCqC1B,CAAAA;SAA0BA,CAAAA,UAAAA,MAAAA,EAAAA,YAkCtDyB,QAlCsDzB,EAAAA,aAkC/B0B,SAlC+B1B,CAAAA,CAAAA,GAAAA,EAkCf+B,CAlCe/B,EAAAA,MAAAA,EAkCJkB,UAlCIlB,CAkCOgC,SAlCPhC,EAkCkBiC,UAlClBjC,EAkC8BqB,CAlC9BrB,CAAAA,EAAAA,OAAAA,CAAAA,EAkC4C2B,cAlC5C3B,CAAAA,EAkC6DL,OAlC7DK,CAkCmEY,CAlCnEZ,GAkCuE+B,CAlCvE/B,EAkC0EyB,QAlC1EzB,EAkCoF0B,SAlCpF1B,CAAAA;SAC7Ea,CAAAA,QAAAA,EAkCGD,CAlCHC,GAAAA,OAkCcN,KAlCdM,EAAAA,MAAAA,EAkC6BD,CAlC7BC,GAAAA,OAkCwCR,GAlCxCQ,CAAAA,EAAAA,IAAAA;qBAAIC,CAAAA,MAAAA,EAmCSH,aAnCTG,CAmCuBW,QAnCvBX,EAmCiCF,CAnCjCE,EAmCoCd,uBAnCpCc,CAmC4DJ,SAnC5DI,CAmCsEO,CAnCtEP,CAAAA,CAAAA,CAAAA,CAAAA,EAAAA,IAAAA;qBAAuBC,CAAAA,MAAAA,EAoCdH,CApCcG,EAAAA,IAAAA,EAoCLhB,cApCKgB,CAoCQU,QApCRV,EAoCkBD,qBApClBC,EAoCyCf,uBApCzCe,CAoCiEL,SApCjEK,CAoC2EM,CApC3EN,CAAAA,CAAAA,CAAAA,EAAAA,OAAAA,CAAAA,EAoC2FJ,aApC3FI,CAoCyGU,QApCzGV,EAoCmHH,CApCnHG,EAoCsHf,uBApCtHe,CAoC8IL,SApC9IK,CAoCwJM,CApCxJN,CAAAA,CAAAA,CAAAA,CAAAA,SAAAA,CAAAA,CAAAA,EAAAA,IAAAA;;;;eACnCC,CAAAA,GAAAA,EAuCYJ,CAvCZI,CAAAA,EAAAA,IAAAA;;;;gBACmBL,CAAAA,GAAAA,EA0CNC,CA1CMD,CAAAA,EAAAA,IAAAA;SAALY,CAAAA;IAAAA,YAAAA;IAAAA,eAAAA;IAAAA,cAAAA;IAAAA;IAAAA,EAAAA;IACSjB,YAAAA,CAAAA,EA2CXR,mBA3CWQ,GAAAA,KAAAA;IAAiBN,eAAAA,CAAAA,EA4CzBY,CA5CyBZ,EAAAA,GA4CnBH,GA5CmBG;IAA4BP,cAAAA,CAAAA,EA6CtDmB,CA7CsDnB,EAAAA,GA6ChDI,GA7CgDJ;IAAkBwB,IAAAA,CAAAA,EAAAA,MAAAA;MA+CzFqB,aA/C0HvB,CA+C5GH,CA/C4GG,CAAAA;UAAgBF,CAAAA,SAAAA,CAAAA,EAAAA,MAAAA,EAAAA,CAAAA,EAAAA,IAAAA;;AAChIA,cAiDGyB,aAjDHzB,CAAAA,UAAAA,MAAAA,EAAAA,QAAAA,GAAAA,EAAAA,SAAAA,GAAAA,EAAAA,oBAiDkFG,MAjDlFH,CAAAA,MAAAA,EAAAA,GAAAA,CAAAA,GAiDwGG,MAjDxGH,CAAAA,MAAAA,EAAAA,GAAAA,CAAAA,EAAAA,YAAAA,GAAAA,EAAAA,aAAAA,GAAAA,EAAAA,iBAAAA,OAAAA,EAAAA,cAAAA,OAAAA,EAAAA,mBAAAA,GAAAA,CAAAA,SAiDiPX,MAjDjPW,CAiDwPG,MAjDxPH,CAiD+PD,CAjD/PC,GAAAA,OAiD0QN,KAjD1QM,EAiDiRZ,UAjDjRY,CAiD4R0B,KAjD5R1B,EAiDmS2B,MAjDnS3B,CAAAA,CAAAA,EAiD6SG,MAjD7SH,CAiDoTD,CAjDpTC,GAAAA,OAiD+TN,KAjD/TM,GAAAA,OAiD8UR,GAjD9UQ,GAAAA,MAAAA,EAiD4VT,WAjD5VS,CAAAA,EAiD0W4B,WAjD1W5B,GAiDwXG,MAjDxXH,CAAAA,MAAAA,EAAAA,GAAAA,CAAAA,EAiD6Y6B,SAjD7Y7B,EAiDwZ8B,UAjDxZ9B,EAiDoa6B,SAjDpa7B,EAiD+a8B,UAjD/a9B,EAiD2b+B,cAjD3b/B,EAiD2cgC,WAjD3chC,EAiDwdiC,gBAjDxdjC,CAAAA,CAAAA;aAAYE,EAkDbH,CAlDaG;mBAAuCT,EAmD9CsC,cAnD8CtC;aAAiBN,EAoDrEwC,MApDqExC;cAA4BP,EAqDhG8C,KArDgG9C;SAAkBwB,EAsDvHtB,OAtDuHsB,CAsDjHL,CAtDiHK,EAsD9GsB,KAtD8GtB,EAsDvGuB,MAtDuGvB,CAAAA;aAAiCF,CAAAA;IAAAA,OAAAA;IAAAA,GAAAA;EAA6BtB,CAA7BsB,EAAAA;IAAgBF,OAAAA,EAwDpKlB,OAxDoKkB,CAwD9JD,CAxD8JC,EAwD3J0B,KAxD2J1B,EAwDpJ2B,MAxDoJ3B,CAAAA;MAyD7KV,YAzD0LV,CAyD7KuB,MAzD6KvB,CAyDtKmB,CAzDsKnB,GAAAA,OAyD3Jc,KAzD2Jd,EAyDpJQ,UAzDoJR,CAyDzI8C,KAzDyI9C,EAyDlI+C,MAzDkI/C,CAAAA,CAAAA,EAyDxHuB,MAzDwHvB,CAyDjHmB,CAzDiHnB,GAAAA,OAyDtGc,KAzDsGd,GAAAA,OAyDvFY,GAzDuFZ,GAAAA,MAAAA,EAyDzEW,WAzDyEX,CAAAA,CAAAA;YAARwB,CAAAA,GAAAA,EA0DtKL,CA1DsKK,EAAAA,IAAAA,EA0D7JO,QA1D6JP,CA0DpJsB,KA1DoJtB,EA0D7IuB,MA1D6IvB,CAAAA,CAAAA,EAAAA,IAAAA;EAAO,UAAA,CAAA,KAAA,EA2D3KL,CA3D2K,GAAA,OA2DhKL,KA3DgK,EAAA,GAAA,EA2DpJK,CA3DoJ,GAAA,OA2DzIP,GA3DyI,CAAA,EAAA,IAAA;EAErLmB,YAAQ,CAAA,KAAA,EA0DIZ,CA1DJ,GAAA,OA0DeL,KA1Df,EAAA,IAAA,EAAA,MAAA,EAAA,MAAA,EA0D4Ce,MA1D5C,CA0DmDiB,KA1DnD,EA0D0D3B,CA1D1D,CAAA,CAAA,EAAA,IAAA;EAAA;;;eACNnB,CAAAA,OAAAA,EA6DaC,cA7DbD,GAAAA;IACCuB,IAAAA,CAAAA,EAAAA,OAAAA,GAAAA,MAAAA;MA8DPC,OA7DQf,CA6DAN,KA7DAM,CAAAA;EAAM;AAItB;;;;UAGW0B,CAAAA,MAGUjC,CAHViC,EA4DWlC,cA5DXkC,GAAAA;IAAK,IAAA,CAAA,EAAA,OAAA,GAAA,MAAA;EAGKjC,CAAAA,CAAAA,EA2DbC,KA3DkB"}

package/dist/graph/graph.js

@@ -0,0 +1,418 @@
+import { InvalidUpdateError, NodeInterrupt, UnreachableNodeError } from "../errors.js";
+import { CHECKPOINT_NAMESPACE_END, CHECKPOINT_NAMESPACE_SEPARATOR, END, START, TAG_HIDDEN, _isSend } from "../constants.js";
+import { RunnableCallable, gatherIterator, gatherIteratorSync } from "../utils.js";
+import { ChannelWrite, PASSTHROUGH } from "../pregel/write.js";
+import { PregelNode } from "../pregel/read.js";
+import { isPregelLike } from "../pregel/utils/subgraph.js";
+import { Channel, Pregel } from "../pregel/index.js";
+import { EphemeralValue } from "../channels/ephemeral_value.js";
+import { Runnable, _coerceToRunnable } from "@langchain/core/runnables";
+import { Graph } from "@langchain/core/runnables/graph";
+import { z } from "zod/v4";
+import { validate } from "uuid";
+
+//#region src/graph/graph.ts
+var Branch = class {
+	path;
+	ends;
+	constructor(options) {
+		if (Runnable.isRunnable(options.path)) this.path = options.path;
+		else this.path = _coerceToRunnable(options.path).withConfig({ runName: `Branch` });
+		this.ends = Array.isArray(options.pathMap) ? options.pathMap.reduce((acc, n) => {
+			acc[n] = n;
+			return acc;
+		}, {}) : options.pathMap;
+	}
+	run(writer, reader) {
+		return ChannelWrite.registerWriter(new RunnableCallable({
+			name: "<branch_run>",
+			trace: false,
+			func: async (input, config) => {
+				try {
+					return await this._route(input, config, writer, reader);
+				} catch (e) {
+					if (e.name === NodeInterrupt.unminifiable_name) console.warn("[WARN]: 'NodeInterrupt' thrown in conditional edge. This is likely a bug in your graph implementation.\nNodeInterrupt should only be thrown inside a node, not in edge conditions.");
+					throw e;
+				}
+			}
+		}));
+	}
+	async _route(input, config, writer, reader) {
+		let result = await this.path.invoke(reader ? reader(config) : input, config);
+		if (!Array.isArray(result)) result = [result];
+		let destinations;
+		if (this.ends) destinations = result.map((r) => _isSend(r) ? r : this.ends[r]);
+		else destinations = result;
+		if (destinations.some((dest) => !dest)) throw new Error("Branch condition returned unknown or null destination");
+		if (destinations.filter(_isSend).some((packet) => packet.node === END)) throw new InvalidUpdateError("Cannot send a packet to the END node");
+		return await writer(destinations, config) ?? input;
+	}
+};
+var Graph$1 = class {
+	nodes;
+	edges;
+	branches;
+	entryPoint;
+	compiled = false;
+	constructor() {
+		this.nodes = {};
+		this.edges = /* @__PURE__ */ new Set();
+		this.branches = {};
+	}
+	warnIfCompiled(message) {
+		if (this.compiled) console.warn(message);
+	}
+	get allEdges() {
+		return this.edges;
+	}
+	addNode(...args) {
+		function isMutlipleNodes(args$1) {
+			return args$1.length >= 1 && typeof args$1[0] !== "string";
+		}
+		const nodes = isMutlipleNodes(args) ? Array.isArray(args[0]) ? args[0] : Object.entries(args[0]) : [[
+			args[0],
+			args[1],
+			args[2]
+		]];
+		if (nodes.length === 0) throw new Error("No nodes provided in `addNode`");
+		for (const [key, action, options] of nodes) {
+			for (const reservedChar of [CHECKPOINT_NAMESPACE_SEPARATOR, CHECKPOINT_NAMESPACE_END]) if (key.includes(reservedChar)) throw new Error(`"${reservedChar}" is a reserved character and is not allowed in node names.`);
+			this.warnIfCompiled(`Adding a node to a graph that has already been compiled. This will not be reflected in the compiled graph.`);
+			if (key in this.nodes) throw new Error(`Node \`${key}\` already present.`);
+			if (key === END) throw new Error(`Node \`${key}\` is reserved.`);
+			const runnable = _coerceToRunnable(action);
+			this.nodes[key] = {
+				runnable,
+				metadata: options?.metadata,
+				subgraphs: isPregelLike(runnable) ? [runnable] : options?.subgraphs,
+				ends: options?.ends
+			};
+		}
+		return this;
+	}
+	addEdge(startKey, endKey) {
+		this.warnIfCompiled(`Adding an edge to a graph that has already been compiled. This will not be reflected in the compiled graph.`);
+		if (startKey === END) throw new Error("END cannot be a start node");
+		if (endKey === START) throw new Error("START cannot be an end node");
+		if (Array.from(this.edges).some(([start]) => start === startKey) && !("channels" in this)) throw new Error(`Already found path for ${startKey}. For multiple edges, use StateGraph.`);
+		this.edges.add([startKey, endKey]);
+		return this;
+	}
+	addConditionalEdges(source, path, pathMap) {
+		const options = typeof source === "object" ? source : {
+			source,
+			path,
+			pathMap
+		};
+		this.warnIfCompiled("Adding an edge to a graph that has already been compiled. This will not be reflected in the compiled graph.");
+		if (!Runnable.isRunnable(options.path)) {
+			const pathDisplayValues = Array.isArray(options.pathMap) ? options.pathMap.join(",") : Object.keys(options.pathMap ?? {}).join(",");
+			options.path = _coerceToRunnable(options.path).withConfig({ runName: `Branch<${options.source}${pathDisplayValues !== "" ? `,${pathDisplayValues}` : ""}>`.slice(0, 63) });
+		}
+		const name = options.path.getName() === "RunnableLambda" ? "condition" : options.path.getName();
+		if (this.branches[options.source] && this.branches[options.source][name]) throw new Error(`Condition \`${name}\` already present for node \`${source}\``);
+		this.branches[options.source] ??= {};
+		this.branches[options.source][name] = new Branch(options);
+		return this;
+	}
+	/**
+	* @deprecated use `addEdge(START, key)` instead
+	*/
+	setEntryPoint(key) {
+		this.warnIfCompiled("Setting the entry point of a graph that has already been compiled. This will not be reflected in the compiled graph.");
+		return this.addEdge(START, key);
+	}
+	/**
+	* @deprecated use `addEdge(key, END)` instead
+	*/
+	setFinishPoint(key) {
+		this.warnIfCompiled("Setting a finish point of a graph that has already been compiled. This will not be reflected in the compiled graph.");
+		return this.addEdge(key, END);
+	}
+	compile({ checkpointer, interruptBefore, interruptAfter, name } = {}) {
+		this.validate([...Array.isArray(interruptBefore) ? interruptBefore : [], ...Array.isArray(interruptAfter) ? interruptAfter : []]);
+		const compiled = new CompiledGraph({
+			builder: this,
+			checkpointer,
+			interruptAfter,
+			interruptBefore,
+			autoValidate: false,
+			nodes: {},
+			channels: {
+				[START]: new EphemeralValue(),
+				[END]: new EphemeralValue()
+			},
+			inputChannels: START,
+			outputChannels: END,
+			streamChannels: [],
+			streamMode: "values",
+			name
+		});
+		for (const [key, node] of Object.entries(this.nodes)) compiled.attachNode(key, node);
+		for (const [start, end] of this.edges) compiled.attachEdge(start, end);
+		for (const [start, branches] of Object.entries(this.branches)) for (const [name$1, branch] of Object.entries(branches)) compiled.attachBranch(start, name$1, branch);
+		return compiled.validate();
+	}
+	validate(interrupt) {
+		const allSources = new Set([...this.allEdges].map(([src, _]) => src));
+		for (const [start] of Object.entries(this.branches)) allSources.add(start);
+		for (const source of allSources) if (source !== START && !(source in this.nodes)) throw new Error(`Found edge starting at unknown node \`${source}\``);
+		const allTargets = new Set([...this.allEdges].map(([_, target]) => target));
+		for (const [start, branches] of Object.entries(this.branches)) for (const branch of Object.values(branches)) if (branch.ends != null) for (const end of Object.values(branch.ends)) allTargets.add(end);
+		else {
+			allTargets.add(END);
+			for (const node of Object.keys(this.nodes)) if (node !== start) allTargets.add(node);
+		}
+		for (const node of Object.values(this.nodes)) for (const target of node.ends ?? []) allTargets.add(target);
+		for (const node of Object.keys(this.nodes)) if (!allTargets.has(node)) throw new UnreachableNodeError([
+			`Node \`${node}\` is not reachable.`,
+			"",
+			"If you are returning Command objects from your node,",
+			"make sure you are passing names of potential destination nodes as an \"ends\" array",
+			"into \".addNode(..., { ends: [\"node1\", \"node2\"] })\"."
+		].join("\n"), { lc_error_code: "UNREACHABLE_NODE" });
+		for (const target of allTargets) if (target !== END && !(target in this.nodes)) throw new Error(`Found edge ending at unknown node \`${target}\``);
+		if (interrupt) {
+			for (const node of interrupt) if (!(node in this.nodes)) throw new Error(`Interrupt node \`${node}\` is not present`);
+		}
+		this.compiled = true;
+	}
+};
+var CompiledGraph = class extends Pregel {
+	builder;
+	constructor({ builder, ...rest }) {
+		super(rest);
+		this.builder = builder;
+	}
+	attachNode(key, node) {
+		this.channels[key] = new EphemeralValue();
+		this.nodes[key] = new PregelNode({
+			channels: [],
+			triggers: [],
+			metadata: node.metadata,
+			subgraphs: node.subgraphs,
+			ends: node.ends
+		}).pipe(node.runnable).pipe(new ChannelWrite([{
+			channel: key,
+			value: PASSTHROUGH
+		}], [TAG_HIDDEN]));
+		this.streamChannels.push(key);
+	}
+	attachEdge(start, end) {
+		if (end === END) {
+			if (start === START) throw new Error("Cannot have an edge from START to END");
+			this.nodes[start].writers.push(new ChannelWrite([{
+				channel: END,
+				value: PASSTHROUGH
+			}], [TAG_HIDDEN]));
+		} else {
+			this.nodes[end].triggers.push(start);
+			this.nodes[end].channels.push(start);
+		}
+	}
+	attachBranch(start, name, branch) {
+		if (start === START && !this.nodes[START]) this.nodes[START] = Channel.subscribeTo(START, { tags: [TAG_HIDDEN] });
+		this.nodes[start].pipe(branch.run((dests) => {
+			return new ChannelWrite(dests.map((dest) => {
+				if (_isSend(dest)) return dest;
+				return {
+					channel: dest === END ? END : `branch:${start}:${name}:${dest}`,
+					value: PASSTHROUGH
+				};
+			}), [TAG_HIDDEN]);
+		}));
+		const ends = branch.ends ? Object.values(branch.ends) : Object.keys(this.nodes);
+		for (const end of ends) if (end !== END) {
+			const channelName = `branch:${start}:${name}:${end}`;
+			this.channels[channelName] = new EphemeralValue();
+			this.nodes[end].triggers.push(channelName);
+			this.nodes[end].channels.push(channelName);
+		}
+	}
+	/**
+	* Returns a drawable representation of the computation graph.
+	*/
+	async getGraphAsync(config) {
+		const xray = config?.xray;
+		const graph = new Graph();
+		const startNodes = { [START]: graph.addNode({ schema: z.any() }, START) };
+		const endNodes = {};
+		let subgraphs = {};
+		if (xray) subgraphs = Object.fromEntries((await gatherIterator(this.getSubgraphsAsync())).filter((x) => isCompiledGraph(x[1])));
+		function addEdge(start, end, label, conditional = false) {
+			if (end === END && endNodes[END] === void 0) endNodes[END] = graph.addNode({ schema: z.any() }, END);
+			if (startNodes[start] === void 0) return;
+			if (endNodes[end] === void 0) throw new Error(`End node ${end} not found!`);
+			return graph.addEdge(startNodes[start], endNodes[end], label !== end ? label : void 0, conditional);
+		}
+		for (const [key, nodeSpec] of Object.entries(this.builder.nodes)) {
+			const displayKey = _escapeMermaidKeywords(key);
+			const node = nodeSpec.runnable;
+			const metadata = nodeSpec.metadata ?? {};
+			if (this.interruptBefore?.includes(key) && this.interruptAfter?.includes(key)) metadata.__interrupt = "before,after";
+			else if (this.interruptBefore?.includes(key)) metadata.__interrupt = "before";
+			else if (this.interruptAfter?.includes(key)) metadata.__interrupt = "after";
+			if (xray) {
+				const newXrayValue = typeof xray === "number" ? xray - 1 : xray;
+				const drawableSubgraph = subgraphs[key] !== void 0 ? await subgraphs[key].getGraphAsync({
+					...config,
+					xray: newXrayValue
+				}) : node.getGraph(config);
+				drawableSubgraph.trimFirstNode();
+				drawableSubgraph.trimLastNode();
+				if (Object.keys(drawableSubgraph.nodes).length > 1) {
+					const [e, s] = graph.extend(drawableSubgraph, displayKey);
+					if (e === void 0) throw new Error(`Could not extend subgraph "${key}" due to missing entrypoint.`);
+					function _isRunnableInterface(thing) {
+						return thing ? thing.lc_runnable : false;
+					}
+					function _nodeDataStr(id, data) {
+						if (id !== void 0 && !validate(id)) return id;
+						else if (_isRunnableInterface(data)) try {
+							let dataStr = data.getName();
+							dataStr = dataStr.startsWith("Runnable") ? dataStr.slice(8) : dataStr;
+							return dataStr;
+						} catch (error) {
+							return data.getName();
+						}
+						else return data.name ?? "UnknownSchema";
+					}
+					if (s !== void 0) startNodes[displayKey] = {
+						name: _nodeDataStr(s.id, s.data),
+						...s
+					};
+					endNodes[displayKey] = {
+						name: _nodeDataStr(e.id, e.data),
+						...e
+					};
+				} else {
+					const newNode = graph.addNode(node, displayKey, metadata);
+					startNodes[displayKey] = newNode;
+					endNodes[displayKey] = newNode;
+				}
+			} else {
+				const newNode = graph.addNode(node, displayKey, metadata);
+				startNodes[displayKey] = newNode;
+				endNodes[displayKey] = newNode;
+			}
+		}
+		const sortedEdges = [...this.builder.allEdges].sort(([a], [b]) => {
+			if (a < b) return -1;
+			else if (b > a) return 1;
+			else return 0;
+		});
+		for (const [start, end] of sortedEdges) addEdge(_escapeMermaidKeywords(start), _escapeMermaidKeywords(end));
+		for (const [start, branches] of Object.entries(this.builder.branches)) {
+			const defaultEnds = {
+				...Object.fromEntries(Object.keys(this.builder.nodes).filter((k) => k !== start).map((k) => [_escapeMermaidKeywords(k), _escapeMermaidKeywords(k)])),
+				[END]: END
+			};
+			for (const branch of Object.values(branches)) {
+				let ends;
+				if (branch.ends !== void 0) ends = branch.ends;
+				else ends = defaultEnds;
+				for (const [label, end] of Object.entries(ends)) addEdge(_escapeMermaidKeywords(start), _escapeMermaidKeywords(end), label, true);
+			}
+		}
+		for (const [key, node] of Object.entries(this.builder.nodes)) if (node.ends !== void 0) for (const end of node.ends) addEdge(_escapeMermaidKeywords(key), _escapeMermaidKeywords(end), void 0, true);
+		return graph;
+	}
+	/**
+	* Returns a drawable representation of the computation graph.
+	*
+	* @deprecated Use getGraphAsync instead. The async method will be the default in the next minor core release.
+	*/
+	getGraph(config) {
+		const xray = config?.xray;
+		const graph = new Graph();
+		const startNodes = { [START]: graph.addNode({ schema: z.any() }, START) };
+		const endNodes = {};
+		let subgraphs = {};
+		if (xray) subgraphs = Object.fromEntries(gatherIteratorSync(this.getSubgraphs()).filter((x) => isCompiledGraph(x[1])));
+		function addEdge(start, end, label, conditional = false) {
+			if (end === END && endNodes[END] === void 0) endNodes[END] = graph.addNode({ schema: z.any() }, END);
+			return graph.addEdge(startNodes[start], endNodes[end], label !== end ? label : void 0, conditional);
+		}
+		for (const [key, nodeSpec] of Object.entries(this.builder.nodes)) {
+			const displayKey = _escapeMermaidKeywords(key);
+			const node = nodeSpec.runnable;
+			const metadata = nodeSpec.metadata ?? {};
+			if (this.interruptBefore?.includes(key) && this.interruptAfter?.includes(key)) metadata.__interrupt = "before,after";
+			else if (this.interruptBefore?.includes(key)) metadata.__interrupt = "before";
+			else if (this.interruptAfter?.includes(key)) metadata.__interrupt = "after";
+			if (xray) {
+				const newXrayValue = typeof xray === "number" ? xray - 1 : xray;
+				const drawableSubgraph = subgraphs[key] !== void 0 ? subgraphs[key].getGraph({
+					...config,
+					xray: newXrayValue
+				}) : node.getGraph(config);
+				drawableSubgraph.trimFirstNode();
+				drawableSubgraph.trimLastNode();
+				if (Object.keys(drawableSubgraph.nodes).length > 1) {
+					const [e, s] = graph.extend(drawableSubgraph, displayKey);
+					if (e === void 0) throw new Error(`Could not extend subgraph "${key}" due to missing entrypoint.`);
+					function _isRunnableInterface(thing) {
+						return thing ? thing.lc_runnable : false;
+					}
+					function _nodeDataStr(id, data) {
+						if (id !== void 0 && !validate(id)) return id;
+						else if (_isRunnableInterface(data)) try {
+							let dataStr = data.getName();
+							dataStr = dataStr.startsWith("Runnable") ? dataStr.slice(8) : dataStr;
+							return dataStr;
+						} catch (error) {
+							return data.getName();
+						}
+						else return data.name ?? "UnknownSchema";
+					}
+					if (s !== void 0) startNodes[displayKey] = {
+						name: _nodeDataStr(s.id, s.data),
+						...s
+					};
+					endNodes[displayKey] = {
+						name: _nodeDataStr(e.id, e.data),
+						...e
+					};
+				} else {
+					const newNode = graph.addNode(node, displayKey, metadata);
+					startNodes[displayKey] = newNode;
+					endNodes[displayKey] = newNode;
+				}
+			} else {
+				const newNode = graph.addNode(node, displayKey, metadata);
+				startNodes[displayKey] = newNode;
+				endNodes[displayKey] = newNode;
+			}
+		}
+		const sortedEdges = [...this.builder.allEdges].sort(([a], [b]) => {
+			if (a < b) return -1;
+			else if (b > a) return 1;
+			else return 0;
+		});
+		for (const [start, end] of sortedEdges) addEdge(_escapeMermaidKeywords(start), _escapeMermaidKeywords(end));
+		for (const [start, branches] of Object.entries(this.builder.branches)) {
+			const defaultEnds = {
+				...Object.fromEntries(Object.keys(this.builder.nodes).filter((k) => k !== start).map((k) => [_escapeMermaidKeywords(k), _escapeMermaidKeywords(k)])),
+				[END]: END
+			};
+			for (const branch of Object.values(branches)) {
+				let ends;
+				if (branch.ends !== void 0) ends = branch.ends;
+				else ends = defaultEnds;
+				for (const [label, end] of Object.entries(ends)) addEdge(_escapeMermaidKeywords(start), _escapeMermaidKeywords(end), label, true);
+			}
+		}
+		return graph;
+	}
+};
+function isCompiledGraph(x) {
+	return typeof x.attachNode === "function" && typeof x.attachEdge === "function";
+}
+function _escapeMermaidKeywords(key) {
+	if (key === "subgraph") return `"${key}"`;
+	return key;
+}
+
+//#endregion
+export { Branch, CompiledGraph, Graph$1 as Graph };
+//# sourceMappingURL=graph.js.map