g3fi6ZdZddlmZddlZddlmZddlmZmZddl m Z ddl m Z m Z mZmZmZmZddlmZmZdd lmZdd lmZmZdd lmZmZe rdd lmZmZdd l m!Z!ddlmZ"GddeZ#GddeZ$d(dZ%GddeZ&GddeZ'GddeZ(Gdde Z)eGddZ*Gdde Z+ d)d Z,d!d" d*d#Z-eGd$d%Z.d+d,d&Z/d+d,d'Z0y)-zGraph used in Runnables.) annotationsN) defaultdict) dataclassfield)Enum) TYPE_CHECKINGAny NamedTupleProtocol TypedDictoverload)UUIDuuid4)to_json_not_implemented)RunnableRunnableSerializable)_IgnoreUnserializableis_basemodel_subclass)CallableSequence) BaseModel)rceZdZdZddZy) Stringifiablez7Protocol for objects that can be converted to a string.cy)zConvert the object to a string.Nselfs \/var/www/auto_recruiter/arenv/lib/python3.12/site-packages/langchain_core/runnables/graph.py__str__zStringifiable.__str__"sNreturnstr)__name__ __module__ __qualname____doc__rrr rrrs A.r rc(eZdZUdZded< ded<y) LabelsDictz4Dictionary of labels for nodes and edges in a graph.zdict[str, str]nodesedgesNr$r%r&r'__annotations__rr rr)r)&s>  r r)c: t|y#t$rYywxYw)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_uuidr1/s' U   s  cZeZdZUdZded< ded< dZded< dZd ed < ddd d d Zy)EdgezEdge in a graph.r#sourcetargetNStringifiable | NonedataFbool conditionalr4r5ct|xs |j|xs |j|j|jS)a Return 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. r4r5r7r9)r3r4r5r7r9)rr4r5s rcopyz Edge.copyKs9(T[[(T[[((   r )r4 str | Noner5r>r"r3)r$r%r&r'r-r7r9r=rr rr3r3?s: K K!%D %2K*+/d r r3c\eZdZUdZded< ded< ded< ded< d d d  d d Zy ) NodezNode in a graph.r#idname%type[BaseModel] | RunnableType | Noner7dict[str, Any] | NonemetadataNrArBct|xs |j|xs |j|j|jS)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. )rArBr7rE)r@rArBr7rE)rrArBs rr=z Node.copyis6}TWW"]]   r )rAr>rBr>r"r@)r$r%r&r'r-r=rr rr@r@]sR G, I //##*         r r@c(eZdZUdZded< ded<y)BranchzBranch in a graph.zCallable[..., str] conditiondict[str, str] | NoneendsNr,rr rrIrIs!!K @r rIc@eZdZdZdZdZdZdZdZdZ dZ d Z d Z d Z d Zd Zy) CurveStylez5Enum for different curve styles supported by Mermaid.basisbumpXbumpYcardinal catmullRomlinear monotoneX monotoneYnaturalstep stepAfter stepBeforeN)r$r%r&r'BASISBUMP_XBUMP_YCARDINAL CATMULL_ROMLINEAR MONOTONE_X MONOTONE_YNATURALSTEP STEP_AFTER STEP_BEFORErr rrNrNsA? E F FHK FJJG DJKr rNc<eZdZUdZdZded<dZded<dZded<y ) 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:#bfb6fclastN)r$r%r&r'rir-rjrkrr rrhrhs'2GS1!E3!D#r rhceZdZdZdZ dZy)MermaidDrawMethodz5Enum for different draw methods supported by Mermaid. pyppeteerapiN)r$r%r&r' PYPPETEERAPIrr rrmrms?I, C2r rmct|r||St|tr|jn |j}|j ds|S|ddS)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)r1 isinstancerget_namer$ startswith)rAr7data_strs r node_data_strrxsL 2;$, ",T8"%dggtyy9   #(=dii(H ! 33%:4 !%dggtyy9 !$''4995  }} ==Z Kr c (eZdZUdZeeZded<eeZ ded<ddd(d Z d)d Z d*d Z d+d d  d,dZ d-dZ d. d/dZdd d0dZd1dZd2dZd2dZd3dZd3dZd*dZd3dZe d4 d5dZe d4 d6dZ d7 d8dZdej6d dd d  d9d!Zej6d dd ej<d"d#d$d%d d d d& d:d'Zy );GraphzGraph of nodes and edges. Args: nodes: Dictionary of nodes in the graph. Defaults to an empty dictionary. edges: List of edges in the graph. Defaults to an empty list. )default_factoryzdict[str, Node]r*z list[Edge]r+FrycFt|jjDcic]3\}}|jt |jr|n |j5}}}g}|j D]^}||j ||jd}|j|j|d<|jrd|d<|j|`|jjDcgc] }d||jit||"c}|dScc}}wcc}w)a Convert the graph to a JSON-serializable format. Args: with_schemas: Whether to include the schemas of the nodes if they are Pydantic models. Returns: A dictionary with the nodes and edges of the graph. r:r7Tr9rAryr*r+) enumerater*valuesrAr1r+r4r5r7r9appendr)rrzirstable_node_idsr+edge edge_dicts rto_jsonz Graph.to_jsons"%TZZ%6%6%89 4 GG'$''*Q 7  ')JJ $D)$++6)$++6Iyy$$(II &!+/ -( LL # $"!JJ--/  /$''2$T E  ! "s 8D-%Dc,t|jS)z'Return whether the graph has any nodes.)r8r*rs r__bool__zGraph.__bool__-sDJJr c*tjS)zfReturn a new unique node identifier. It that can be used to add a node to the graph. )rhexrs rnext_idz Graph.next_id1s w{{r N)rEc |||jvrd|d}t||xs|j}t|||t ||}||j|j <|S)aXAdd 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)rAr7rErB)r*r/rr@rxrA)rr7rArEmsgid_rs radd_nodezGraph.add_node8sk( >bDJJ.!"_5CS/ !"DLLNs}SRV?WX" 477 r c|jj|j|jDcgc])}|j|j|j hvs(|+c}|_ycc}w)zyRemove a node from the graph and all edges connected to it. Args: node: The node to remove. N)r*poprAr+r4r5)rrrs r remove_nodezGraph.remove_nodeTsP tww!ZZ 4774;; :T+TD   s )A+A+cN|j|jvrd|jd}t||j|jvrd|jd}t|t|j|j||}|jj ||S)aAdd 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 r<)rAr*r/r3r+r)rr4r5r7r9rrs radd_edgezGraph.add_edge_s* 99DJJ &  =9CS/ ! 99DJJ &  =9CS/ !99VYYT{  $ r )prefixc td|jjDrddfd }|jj|jj Dcic]$\}}|||j ||&c}}|j j|j Dcgc]5}|j ||j||j7c}|j|j}}|r"|j ||jnd|r#|j ||jfSdfScc}}wcc}w)aCAdd 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. c3FK|]}t|jywN)r1rA).0rs r zGraph.extend..sADwtwwAs!rcrd|S|S)N:r)rrs rprefixedzGraph.extend..prefixeds(.fXQse$ 7C 7r rAr:N)rr#r"r#) allr*rupdateitemsr=r+extendr4r5 first_node last_noderA) rgraphrrkvrrjrks ` rrz Graph.extends5 AEKK,>,>,@A AF 8 =B[[=N=N=P QTQXa[!&&HQK&0 0 Q  "KK  $++!6x ?T U  &&(%//*;t16EJJ(588,J -D/3DII$''*I +  9=   R s &)E( ::E.c  tt}|jjD]*}||jj |j ,|jDcic]3\}}t|D] \}}|t|dk(r|n |d|dz"5c}}}} d fd }t|jjDcic]$\}}|||j||&c}}|jD cgc]5} | j|| j|| j7c} Scc}}}}wcc}}wcc} w)ztReturn a new graph with all nodes re-identified. Uses their unique, readable names where possible. _c,|}t|r|S|Sr)r1)node_idlabel unique_labelss r _get_node_idz Graph.reid.._get_node_ids!'*Ew Nr rr:r)rr#r"r#)rlistr*rrBrrArrlenrr=r+r4r5) rnode_name_to_idsr node_namenode_idsrrrrrrs @rreidz Graph.reids\ 't,JJ%%' 8D TYY ' . .tww 7 8 (8'='='?  # 8'1 7 #h-1"4YYKqQ:P P    "&!1!1!3CS!499 S0A9#BB!JJ    ' 4' 4   s-8E )E :E ct|S)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 rrzGraph.first_nodes4  r ct|S)a>Find 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 rrzGraph.last_nodes$r c |j}|rlt||jgrSt|jDchc]}|j |jk(s| c}dk(r|j |yyyycc}w)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)rrrArr+r4r)rres rtrim_first_nodezGraph.trim_first_nodeso __& D:==/: H1ahh*--.GQHIQN   Z (O; H BBc |j}|rlt||jgrSt|jDchc]}|j |jk(s| c}dk(r|j |yyyycc}w)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)rrrArr+r5r)rrrs rtrim_last_nodezGraph.trim_last_nodeso NN$ 4),,8 G1ahh),,.FQGHAM   Y 'N9 Grcddlm}||jjDcic]}|j|j c}|j Scc}w)zcDraw the graph as an ASCII art string. Returns: The ASCII art string. r) draw_ascii)$langchain_core.runnables.graph_asciirr*rrArBr+)rrrs rrzGraph.draw_asciisG D,0JJ,=,=,? @DTWWdii  @ JJ  @sAc6t|jy)z'Print the graph as an ASCII art string.N)printrrs r print_asciizGraph.print_ascii s doo r cyrrroutput_file_pathfontnamelabelss rdraw_pngzGraph.draw_png s r cyrrrs rrzGraph.draw_pngs r cddlm}|jjDcic]}|j|j }}||t i|||dni||dnij||Scc}w)aDraw 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*r+r)"langchain_core.runnables.graph_pngrr*rrArBr)draw)rrrrrrdefault_node_labelss rrzGraph.draw_pngs& A>Bjj>O>O>QRdtww 1RR  )*0*rErDr"r@)rr@r"None)NF) r4r@r5r@r7r6r9r8r"r3)rrrr#r"ztuple[Node | None, Node | None])r"r)r" Node | None)r"r)NN)rr#rr>rLabelsDict | Noner"r)rrrr>rrr"bytes)NNN)rr>rr>rrr"z bytes | None) rr8rrNrNodeStyles | NonerintrrDr"r#)rrNrrrrrr>rrmrr#rrrrrfloatrrDrr>rrKr"r) r$r%r&r'rdictr*r-rr+rrrrrrrrrrrrrrr rrNr`rrmrqrrr 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 r rc*|jDchc]}|j|vs|j}}|jj Dcgc] }|j |vr|j |vr|"}}t |dk(r|dSdScc}wcc}w)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)r+r4r5r*rrAr)rrrtargetsrfounds rrr(-{{Qtdkk6Pt{{QGQKK&&(  77' !dggW&< E 5zQ580D0 RB B %Bc*|jDchc]}|j|vs|j}}|jj Dcgc] }|j |vr|j |vr|"}}t |dk(r|dSdScc}wcc}w)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)r+r5r4r*rrAr)rrrsourcesrrs rrrrr)r0r#r"r8)rAr#r7rCr"r#)rr@rzr8r"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)r1r3r@rIrNrhrmrxrrrrrr rrs"#(DHV2"F.H.   : <  :  FAZA"     33M M /M M().4 4!%4$4n B B  B J1$1r