D_i6ZSrSSKJr SSKrSSKJr SSKJrJr SSK J r SSK J r J r JrJrJrJr SSKJrJr SS KJr SS KJrJr SS KJrJr \ (aSS KJrJr SS K J!r! SSKJr" "SS\5r#"SS\5r$S(Sjr%"SS\5r&"SS\5r'"SS\5r("SS\ 5r)\"SS55r*"SS\ 5r+S)S jr,S!S".S*S#jjr-\"S$S%55r.S+S,S&jjr/S+S,S'jjr0g)-zGraph used in Runnables.) annotationsN) defaultdict) dataclassfield)Enum) TYPE_CHECKINGAny NamedTupleProtocol TypedDictoverload)UUIDuuid4)to_json_not_implemented)RunnableRunnableSerializable)_IgnoreUnserializableis_basemodel_subclass)CallableSequence) BaseModel)rc"\rSrSrSrSSjrSrg) Stringifiablez7Protocol for objects that can be converted to a string.cg)zConvert the object to a string.Nselfs X/home/james-whalen/.local/lib/python3.13/site-packages/langchain_core/runnables/graph.py__str__Stringifiable.__str__"srNreturnstr)__name__ __module__ __qualname____firstlineno____doc__r __static_attributes__rr"rrrs A.r"rc0\rSrSr%SrS\S'S\S'Srg) LabelsDict&z4Dictionary of labels for nodes and edges in a graph.zdict[str, str]nodesedgesrNr&r'r(r)r*__annotations__r+rr"rr-r-&s>  r"r-c<[U5 g![a gf=f)zCheck if a string is a valid UUID. Args: value: The string to check. Returns: `True` if the string is a valid UUID, `False` otherwise. FT)r ValueError)values ris_uuidr6/s' U   s  cf\rSrSr%SrS\S'S\S'SrS\S'S rS \S 'SSS .SS jjrSr g)Edge?zEdge in a graph.r%sourcetargetNStringifiable | NonedataFbool conditionalr:r;c[U=(d URU=(d URURURS9$)zReturn a copy of the edge with optional new source and target nodes. Args: source: The new source node id. target: The new target node id. Returns: A copy of the edge with the new source and target nodes. r:r;r=r?)r8r:r;r=r?)rr:r;s rcopy Edge.copyKs9(T[[(T[[((   r"r)r: str | Noner;rEr$r8) r&r'r(r)r*r2r=r?rCr+rr"rr8r8?s? K K!%D %2K*+/d  r"r8ch\rSrSr%SrS\S'S\S'S\S'S\S 'S S S .SS jjrS rg )Node]zNode in a graph.r%idname%type[BaseModel] | RunnableType | Noner=dict[str, Any] | NonemetadataNrIrJc[U=(d URU=(d URURURS9$)zReturn a copy of the node with optional new id and name. Args: id: The new node id. name: The new node name. Returns: A copy of the node with the new id and name. )rIrJr=rM)rGrIrJr=rM)rrIrJs rrC Node.copyis6}TWW"]]   r"r)rIrErJrEr$rG)r&r'r(r)r*r2rCr+rr"rrGrG]sW G, I //##*          r"rGc0\rSrSr%SrS\S'S\S'Srg) BranchzBranch in a graph.zCallable[..., str] conditiondict[str, str] | NoneendsrNr1rr"rrRrRs!!K @r"rRcH\rSrSrSrSrSrSrSrSr Sr S r S r S r S rS rSrSrg) CurveStylez5Enum for different curve styles supported by Mermaid.basisbumpXbumpYcardinal catmullRomlinear monotoneX monotoneYnaturalstep stepAfter stepBeforerN)r&r'r(r)r*BASISBUMP_XBUMP_YCARDINAL CATMULL_ROMLINEAR MONOTONE_X MONOTONE_YNATURALSTEP STEP_AFTER STEP_BEFOREr+rr"rrXrXsA? E F FHK FJJG DJKr"rXcD\rSrSr%SrSrS\S'SrS\S'SrS\S 'S r g ) NodeStyleszSchema for Hexadecimal color codes for different node types. Args: default: The default color code. first: The color code for the first node. last: The color code for the last node. zfill:#f2f0ff,line-height:1.2r%defaultzfill-opacity:0firstz fill:#bfb6fclastrN) r&r'r(r)r*rur2rvrwr+rr"rrsrss'2GS1!E3!D#r"rsc"\rSrSrSrSrSrSrg)MermaidDrawMethodz5Enum for different draw methods supported by Mermaid. pyppeteerapirN)r&r'r(r)r* PYPPETEERAPIr+rr"rryrys?I, C2r"ryc[U5(aUcU$[U[5(aUR5O URnUR S5(dU$USS$)zConvert the data of a node to a string. Args: id: The node id. data: The node data. Returns: A string representation of the data. Nr)r6 isinstancerget_namer& startswith)rIr=data_strs r node_data_strrsT 2;;$, ",T8"<"%dggtyy9   # #(=dii(H(H ! 33%:4 !%dggtyy9 !$''4995  }} ==Z Kr"c ^\rSrSr%Sr\"\S9rS\S'\"\ S9r S\S'SS .S*S jjr S+S jr S,S jr S-S S.S.SjjjrS/SjrS0S1SjjrSS.S2SjjrS3SjrS4SjrS4SjrS5SjrS5SjrS,SjrS5Sjr\S6S7Sjj5r\S6S8Sjj5rS9S:SjjrS\R8S S S S!.S;S"jjr\R8S S S \R>S#S$S%S&S S S S'. Sr/rs r__bool__Graph.__bool__-sDJJr"c*[5R$)zVReturn a new unique node identifier. It that can be used to add a node to the graph. )rhexrs rnext_id Graph.next_id1s w{{r"N)rMc Ub X R;aSUS3n[U5eU=(d UR5n[XQU[ XQ5S9nX`RUR 'U$)aAdd a node to the graph and return it. Args: data: The data of the node. id: The id of the node. metadata: Optional metadata for the node. Returns: The node that was added to the graph. Raises: ValueError: If a node with the same id already exists. z Node with id z already exists)rIr=rMrJ)r/r4rrGrrI)rr=rIrMmsgid_rs radd_nodeGraph.add_node8sb( >bJJ.!"_5CS/ !"DLLNs}S?WX" 477 r"cURRUR5 URVs/sH,o!RURUR 1;dM*UPM. snUlgs snf)zaRemove a node from the graph and all edges connected to it. Args: node: The node to remove. N)r/poprIr0r:r;)rrrs r remove_nodeGraph.remove_nodeTsR tww!ZZ 'T774;; :T+TDZ   s )A0!A0cNURUR;aSURS3n[U5eURUR;aSURS3n[U5e[URURX4S9nURR U5 U$)adAdd an edge to the graph and return it. Args: source: The source node of the edge. target: The target node of the edge. data: Optional data associated with the edge. conditional: Whether the edge is conditional. Returns: The edge that was added to the graph. Raises: ValueError: If the source or target node is not in the graph. z Source node z not in graphz Target node rB)rIr/r4r8r0r)rr:r;r=r?rrs radd_edgeGraph.add_edge_s* 99DJJ &  =9CS/ ! 99DJJ &  =9CS/ !99VYYT  $ r")prefixc ^[SURR555(aSmSU4SjjnURRURR 5VVs0sH!upEU"U5UR U"U5S9_M# snn5 UR RUR Vs/sH3nUR U"UR5U"UR5S9PM5 sn5 UR5UR5pU(aUR U"UR5S9OSU(a UR U"UR5S94$S4$s snnfs snf)a Add all nodes and edges from another graph. Note this doesn't check for duplicates, nor does it connect the graphs. Args: graph: The graph to add. prefix: The prefix to add to the node ids. Returns: A tuple of the first and last nodes of the subgraph. c3L# UHn[UR5v M g7fN)r6rI).0rs r Graph.extend..sA,@Dwtww,@s"$rc$>T(aTSU3$U$)N:r)rrs rprefixedGraph.extend..prefixeds(.fXQse$ 7C 7r"rIr@N)rr%r$r%) allr/rupdateitemsrCr0extendr:r; first_node last_noderI) rgraphrrkvrrvrws ` rr Graph.extends? AEKK,>,>,@A A AF 8 =B[[=N=N=P Q=PTQXa[!&&HQK&0 0=P Q  "KK 'D $++!6x ?T U'  &&(%//*;t16EJJ(588,J -D/3DII$''*I +  9=   R s -(E1 :E7c ^ [[5nURR5H*nXRR UR 5 M, UR5VVVVs0sH6up4[U5H!upVU[U5S:XaUO USUS-3_M# M8 snnnnm SU 4Sjjn[URR5VVs0sH!upU"U5URU"U5S9_M# snnURV s/sH3n U RU"U R5U"U R5S9PM5 sn S9$s snnnnfs snnfs sn f)zdReturn a new graph with all nodes re-identified. Uses their unique, readable names where possible. _c6>TUn[U5(aU$U$r)r6)node_idlabel unique_labelss r _get_node_id Graph.reid.._get_node_ids"!'*Ew Nr"rr@r)rr%r$r%)rlistr/rrJrrIrrlenrrCr0r:r;) rnode_name_to_idsr node_namenode_idsrrrrrrs @rreid Graph.reidsT 't,JJ%%'D YY ' . .tww 7( (8'='='? '?# '1  #h-1"4YYKqQ:P P1 '?   "&!1!1!3!3ICS!499 S0A9#BB!3!JJ  'D  ' 4' 4'    s.=E (E :E! c[U5$)a Find the single node that is not a target of any edge. If there is no such node, or there are multiple, return `None`. When drawing the graph, this node would be the origin. Returns: The first node, or None if there is no such node or multiple candidates. ) _first_noders rrGraph.first_nodes4  r"c[U5$)aFind the single node that is not a source of any edge. If there is no such node, or there are multiple, return `None`. When drawing the graph, this node would be the destination. Returns: The last node, or None if there is no such node or multiple candidates. ) _last_noders rrGraph.last_nodes$r"c UR5nU(ar[XR/S9(aX[URVs1sH o"R UR:XdMUiM" sn5S:XaUR U5 ggggs snf)zRemove the first node if it exists and has a single outgoing edge. i.e., if removing it would not leave the graph without a "first" node. excluderN)rrrIrr0r:r)rres rtrim_first_nodeGraph.trim_first_nodeso __& D==/: H 1hh*--.GQ HIQN   Z (O; H B %B c UR5nU(ar[XR/S9(aX[URVs1sH o"R UR:XdMUiM" sn5S:XaUR U5 ggggs snf)zRemove the last node if it exists and has a single incoming edge. i.e., if removing it would not leave the graph without a "last" node. rrN)rrrIrr0r;r)rrrs rtrim_last_nodeGraph.trim_last_nodeso NN$ 4,,8 G 1hh),,.FQ GHAM   Y 'N9 GrcSSKJn U"URR5Vs0sHo"RUR _M snUR 5$s snf)zKDraw the graph as an ASCII art string. Returns: The ASCII art string. r) draw_ascii)$langchain_core.runnables.graph_asciirr/rrIrJr0)rrrs rrGraph.draw_asciisK D,0JJ,=,=,? @,?DWWdii ,? @ JJ  @s Ac6[UR55 g)z'Print the graph as an ASCII art string.N)printrrs r print_asciiGraph.print_ascii s doo r"cgrrroutput_file_pathfontnamelabelss rdraw_pngGraph.draw_png s r"cgrrrs rrrs r"cSSKJn URR5Vs0sHoURUR _M nnU"U[ 0UEUbUSO0EUbUSO0S95RX5$s snf)a]Draw the graph as a PNG image. Args: output_file_path: The path to save the image to. If `None`, the image is not saved. fontname: The name of the font to use. labels: Optional labels for nodes and edges in the graph. Defaults to `None`. Returns: The PNG image as bytes if output_file_path is None, None otherwise. r) PngDrawerr/r0r)"langchain_core.runnables.graph_pngrr/rrIrJr-draw)rrrrrrdefault_node_labelss rrrs& A>Bjj>O>O>QR>Qdww 1>QR  )*0*r$zdict[str, list[dict[str, Any]]])r$r>r#r)r=rKrIrErMrLr$rG)rrGr$None)NF) r:rGr;rGr=r<r?r>r$r8)rrrr%r$ztuple[Node | None, Node | None])r$r)r$ Node | None)r$r)NN)rr%rrErLabelsDict | Noner$r)rrrrErrr$bytes)NNN)rrErrErrr$z bytes | None) rr>rrXrNodeStyles | NonerintrrLr$r%)rrXrrrr rrErryrr%rr rr rfloatrrLrrErrUr$r)"r&r'r(r)r*rdictr/r2rr0rrrrrrrrrrrrrrr rrXrkr ryr~rr+rr"rrrs#48E?8d3E:3.3# J  +/ 3  (   8  &*! #     D.0$ $ '*$ ($ L! F !   ) (  ! $$( "    $$( "   (,#$( '$ ' '" '  'J!","3"3)-"#485 5  5 ' 5  5 25  5 t#-"3"3)-"#'+):)>)> ' 48#)-I  I ' I  I % I 'I I I I I 2I I 'I  I I r"rcLURVs1sH o"RU;dMURiM" nnURR 5Vs/sH)nUR U;dMUR U;dM'UPM+ nn[ U5S:XaUS$S$s snfs snf)zFind the single node that is not a target of any edge. Exclude nodes/sources with IDs in the exclude list. If there is no such node, or there are multiple, return `None`. When drawing the graph, this node would be the origin. rrN)r0r:r;r/rrIr)rrrtargetsrfounds rrr(-{{Q{tkk6P{t{{{GQKK&&((D 77' ! &*ggW&< (  5zQ580D0 RBBB!,B!>B!cLURVs1sH o"RU;dMURiM" nnURR 5Vs/sH)nUR U;dMUR U;dM'UPM+ nn[ U5S:XaUS$S$s snfs snf)zFind the single node that is not a source of any edge. Exclude nodes/targets with IDs in the exclude list. If there is no such node, or there are multiple, return `None`. When drawing the graph, this node would be the destination. rrN)r0r;r:r/rrIr)rrrsourcesrr%s rrrr&r')r5r%r$r>)rIr%r=rKr$r%)rrGrr>r$zdict[str, str | dict[str, Any]])r)rrrz Sequence[str]r$r)1r* __future__rr collectionsr dataclassesrrenumrtypingrr r r r r uuidrr langchain_core.load.serializablerlangchain_core.runnables.baserrlangchain_core.utils.pydanticrrcollections.abcrrpydanticr RunnableTyperr-r6r8rGrRrXrsryrrrrrrr"rr6s"#(DHV2"F.H.   : <  :  FAZA"     33M M /M M().4 4!%4$4n B B  B J1$1r"