ghZdZddlmZddlZddlmZddlmZmZddl m Z ddl m Z m Z mZmZmZmZmZmZmZddlmZmZdd lmZmZe rdd lmZdd lmZdd lm Z!Gd deZ"GddeZ#d5dZ$GddeZ%GddeZ&GddeZ'Gdde Z(eGddZ)Gd d!e Z*d6d%Z+d&d'd7d+Z,eGd,d-Z-d8d9d3Z.d8d9d4Z/dS):zGraph used in Runnables.) annotationsN) defaultdict) dataclassfield)Enum) TYPE_CHECKINGAnyCallable NamedTupleOptionalProtocol TypedDictUnionoverload)UUIDuuid4)_IgnoreUnserializableis_basemodel_subclass)Sequence) BaseModelRunnableceZdZdZddZdS) Stringifiablez7Protocol for objects that can be converted to a string.returnstrcdS)zConvert the object to a string.Nselfs [/var/www/FlaskApp/flask-venv/lib/python3.11/site-packages/langchain_core/runnables/graph.py__str__zStringifiable.__str__#sNrr)__name__ __module__ __qualname____doc__r"rr#r!rr s.AA......r#rc*eZdZUdZded< ded<dS) LabelsDictz4Dictionary of labels for nodes and edges in a graph.zdict[str, str]nodesedgesNr%r&r'r(__annotations__rr#r!r*r*'s3>>r#r*valuerrboolcJ t|n#t$rYdSwxYwdS)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)r/s r!is_uuidr30s; U uu 4s   cTeZdZUdZded<ded<dZded<dZd ed <ddd ddZdS)EdgezEdge in a graph. Parameters: source: The source node id. target: The target node id. data: Optional data associated with the edge. Defaults to None. conditional: Whether the edge is conditional. Defaults to False. rsourcetargetNOptional[Stringifiable]dataFr0 conditionalr6r7 Optional[str]rcXt|p|j|p|j|j|jS)a/Return a copy of the edge with optional new source and target nodes. Args: source: The new source node id. Defaults to None. target: The new target node id. Defaults to None. Returns: A copy of the edge with the new source and target nodes. r6r7r9r:)r5r6r7r9r:)r r6r7s r!copyz Edge.copyOs:(T[(T[(     r#)r6r<r7r<rr5)r%r&r'r(r.r9r:r?rr#r!r5r5@s{KKKKKK$(D((((K*.t        r#r5cLeZdZUdZded<ded<ded<ded<d d d dd Zd S)NodezNode in a graph. Parameters: id: The unique identifier of the node. name: The name of the node. data: The data of the node. metadata: Optional metadata for the node. Defaults to None. ridname*Union[type[BaseModel], RunnableType, None]r9Optional[dict[str, Any]]metadataNrBrCr<rcXt|p|j|p|j|j|jS)aReturn a copy of the node with optional new id and name. Args: id: The new node id. Defaults to None. name: The new node name. Defaults to None. Returns: A copy of the node with the new id and name. )rBrCr9rF)rArBrCr9rF)r rBrCs r!r?z Node.copyrs8}TW"]     r#)rBr<rCr<rrA)r%r&r'r(r.r?rr#r!rArAcso GGG III4444&&&&*.d        r#rAc(eZdZUdZded<ded<dS)BranchzBranch in a graph. Parameters: condition: A callable that returns a string representation of the condition. ends: Optional dictionary of end node ids for the branches. Defaults to None. zCallable[..., str] conditionzOptional[dict[str, str]]endsNr-rr#r!rJrJs6"!!!""""""r#rJcBeZdZdZdZdZdZdZdZdZ dZ d Z d Z d Z d Zd ZdS) 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#r!rNrNsP?? E F FHK FJJG DJKKKr#rNc>eZdZUdZdZded<dZded<dZded<d S) NodeStylesaCSchema for Hexadecimal color codes for different node types. Parameters: default: The default color code. Defaults to "fill:#f2f0ff,line-height:1.2". first: The color code for the first node. Defaults to "fill-opacity:0". last: The color code for the last node. Defaults to "fill:#bfb6fc". zfill:#f2f0ff,line-height:1.2rdefaultzfill-opacity:0firstz fill:#bfb6fclastN)r%r&r'r(rir.rjrkrr#r!rhrhsQ2G1111!E!!!!Dr#rhceZdZdZdZdZdS)MermaidDrawMethodz5Enum for different draw methods supported by Mermaid. pyppeteerapiN)r%r&r'r( PYPPETEERAPIrr#r!rmrms??I CCCr#rmrBr9rDcddlm}t|r||St||r|n|j}|ds|n |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. rrNr)langchain_core.runnables.baserr3 isinstanceget_namer% startswith)rBr9rdata_strs r! node_data_strryst766666 2;;$, ",T8"<"<Ot}}$-H#..z:: L88 Lr#F with_schemasnoder{%dict[str, Union[str, dict[str, Any]]]cddlm}ddlm}m}|ji}n$t |j|r8d|jt|j |jdd}nt |j|r5d||jdt|j |jdd}ntj |jrWt|jrC|r#d |j t dnd t|j |jd}nd t|j |jd}|j |j|d <|S) a8Convert the data of a node to a JSON-serializable format. Args: node: The node to convert. with_schemas: Whether to include the schema of the data if it is a Pydantic model. Defaults to False. Returns: A dictionary with the type of the data and the data itself. r)to_json_not_implemented)rRunnableSerializableNrunnablerG)typer9rBschema)schema_generatorunknownrF) langchain_core.load.serializablerrtrrr9rulc_idryrBinspectisclassrmodel_json_schemarrF)r|r{rrrjsons r!node_data_jsonrsIHHHHHLLLLLLLL y! DI3 4 4" ioo''%dgty99   DIx ( ( --di88>%dgty99    # # (=di(H(H    33%:4   !%dgty99 !$'4955   } =Z Kr#c eZdZUdZeeZded<eeZ ded<dddTd Z dUdZ dVdZ dWdddXdZ dYdZ dZd[d#Zd$d%d\d)Zd]d*Zd^d,Zd^d-Zd_d.Zd_d/ZdVd0Zd_d1Ze d`dad6Ze d`dbd8Z dcddd:Zd;ejddz!Graph.to_json..sE   4 G'$'**7QQ   r#r;Nr9Tr:cPg|]"}d|jit|#S)rBrz)rBr)rr|stable_node_idsr{s r! z!Graph.to_json..+sN /$'2$T EEEr#r+r,) enumerater+valuesr,r6r7r9r:append)r r{r,edge edge_dictrs ` @r!to_jsonz Graph.to_jsons  $TZ%6%6%8%899   ')J $ $D)$+6)$+6Iy$$(I &! 0+/ -( LL # # # # !J--//    r#c*t|jS)z'Return whether the graph has any nodes.)r0r+rs r!__bool__zGraph.__bool__5sDJr#rc(tjS)zfReturn a new unique node identifier. It that can be used to add a node to the graph. )rhexrs r!next_idz Graph.next_id9s ww{r#N)rFr9rDrBr<rFrErAc |||jvrd|d}t||p|}t|||t ||}||j|j<|S)a|Add a node to the graph and return it. Args: data: The data of the node. id: The id of the node. Defaults to None. metadata: Optional metadata for the node. Defaults to None. Returns: The node that was added to the graph. Raises: ValueError: If a node with the same id already exists. Nz Node with id z already exists)rBr9rFrC)r+r2rrAryrB)r r9rBrFmsgr|s r!add_nodezGraph.add_node@sw( >bDJ..5"555CS// !  !4<<>>rxmBPT>U>UVVV" 47 r#r|Nonecv|jjfd|jD|_dS)zyRemove a node from the graph and all edges connected to it. Args: node: The node to remove. c>g|]}j|j|jfv|Sr)rBr6r7)rrr|s r!rz%Graph.remove_node..cs5   474; :T+T+TD+T+T+Tr#N)r+poprBr,)r r|s `r! remove_nodezGraph.remove_node\sK tw    !Z    r#r6r7r8r:r5c|j|jvrd|jd}t||j|jvrd|jd}t|t|j|j||}|j||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. Defaults to None. conditional: Whether the edge is conditional. Defaults to False. 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>)rBr+r2r5r,r)r r6r7r9r:rrs r!add_edgezGraph.add_edgegs* 9DJ & &9999CS// ! 9DJ & &9999CS// !9VYT{    $ r#)prefixgraphr%tuple[Optional[Node], Optional[Node]]c6td|jDrdd fd |jfd|jD|jfd|jD||}}|r$| |j  nd |r$| |j  nd fS) aSAdd 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. Defaults to "". Returns: A tuple of the first and last nodes of the subgraph. c3>K|]}t|jVdSN)r3rBrr|s r! zGraph.extend..s,AADwtwAAAAAAr#rrBrrcrd|n|S)N:r)rBrs r!prefixedzGraph.extend..prefixeds!'-5f##r###2 5r#chi|].\}}|||/SrBr?)rkvrs r!rz Graph.extend..s= Q Q QTQXXa[[!&&HHQKK&00 Q Q Qr#cvg|]5}||j|j6Sr;r?r6r7)rrrs r!rz Graph.extend..sQ    $+!6!6xx ?T?T UU   r#rN)rBrrr) allr+rupdateitemsr,extend first_node last_noder?rB)r rrrjrkrs ` @r!rz Graph.extendsT AAEK,>,>,@,@AAA A A F 6 6 6 6 6 6  Q Q Q QU[=N=N=P=P Q Q Q        !K      &&((%//*;*;t16 @EJJ((58,,J - - -D/3 =DII$'**I + + +  r#ctt}|jD]'}||j|j(d|Dd fd tfd|jDfd|j DS) ztReturn a new graph with all nodes re-identified. Uses their unique, readable names where possible. c~i|]:\}}t|D]%\}}|t|dkr|n |d|dz&;S)_)rlen)r node_namenode_idsrnode_ids r!rzGraph.reid..sw   # 8'11  7 #h--1"4"4YYY:P:PQ:P:P    r#rrrc:|}t|r|S|Sr)r3)rlabel unique_labelss r! _get_node_idz Graph.reid.._get_node_ids'!'*Ew  Nr#chi|].\}}|||/Srr)rrBr|rs r!rzGraph.reid..sQB R  $))||B/?/?)"@"@r#cvg|]5}||j|j6Srr)rrrs r!rzGraph.reid..s\   '< 44'< 44r#r)rrrr) rlistr+rrCrrBrrr,)r node_name_to_idsr|rrs @@r!reidz Graph.reids 't,,J%%'' 8 8D TY ' . .tw 7 7 7 7  '7'='='?'?           $ 0 0 2 2 !J     r#Optional[Node]c t|S)zFind 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. ) _first_noders r!rzGraph.first_nodes 4   r#c t|S)zFind 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. ) _last_noders r!rzGraph.last_nodes $r#c|rRt|jgr=tfd|jDdkr|dSdSdSdS)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. excludec4h|]}|jjk|Sr)r6rB)rers r! z(Graph.trim_first_node..s'HHH1ah*-.G.GQ.G.G.Gr#rN)rrrBrr,r)r rs @r!trim_first_nodezGraph.trim_first_nodes __&&  )D:=/::: )HHHH HHHIIQNN   Z ( ( ( ( (  ) ) ) )ONr#c|rRt|jgr=tfd|jDdkr|dSdSdSdS)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. rc4h|]}|jjk|Sr)r7rB)rrrs r!rz'Graph.trim_last_node..s'GGG1ah),.F.FQ.F.F.Fr#rN)rrrBrr,r)r rs @r!trim_last_nodezGraph.trim_last_nodes NN$$  (4),888 (GGGG GGGHHAMM   Y ' ' ' ' '  ( ( ( (NMr#crddlm}|d|jD|jS)z&Draw the graph as an ASCII art string.r) draw_asciic(i|]}|j|jSrrGrs r!rz$Graph.draw_ascii..s @ @ @DTWdi @ @ @r#)$langchain_core.runnables.graph_asciirr+rr,)r rs r!rzGraph.draw_asciisLCCCCCCz @ @DJ,=,=,?,? @ @ @ J   r#cHt|dS)z'Print the graph as an ASCII art string.N)printrrs r! print_asciizGraph.print_asciis  doo     r#output_file_pathfontnamelabelsOptional[LabelsDict]cdSrrr rrrs r!draw_pngzGraph.draw_pngs sr#bytescdSrrrs r!rzGraph.draw_pngs r#Union[bytes, None]cddlm}d|jD}||t i|||dni||dni||S)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. Defaults to None. fontname: The name of the font to use. Defaults to None. 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) PngDrawerc(i|]}|j|jSrrGrs r!rz"Graph.draw_png..+sRRRdtw RRRr#Nr+r,r)"langchain_core.runnables.graph_pngrr+rr*draw)r rrrrdefault_node_labelss r!rzGraph.draw_pngs" A@@@@@RRdj>O>O>Q>QRRRy  )*0* ' 7;D D D D D D D D r#rrrr Sequence[str]rcfd|jDfd|jD}t|dkr|dndS)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. c0h|]}|jv |jSrr;rrrs r!rz_first_node..'QQQtdk6P6Pt{6P6P6Pr#c8g|]}|jv |jv|Srr)rr|rtargetss r!rz_first_node..<  7' ! !dgW&<&< &<&<&.rr#c8g|]}|jv |jv|Srr)rr|rsourcess r!rz_last_node..r r#rrNr!)rrr"r's ` @r!rrr#r#)r/rrr0)rBrr9rDrr)r|rAr{r0rr})r)rrrrrr)0r( __future__rr collectionsr dataclassesrrenumrtypingrr r r r r rrruuidrrlangchain_core.utils.pydanticrrcollections.abcrpydanticrrtr RunnableTyperr*r3r5rArJrNrhrmryrrrrrr#r!r2sf""""""######((((((((                      VVVVVVVVG((((((""""""FFFFFF.....H...          :    F     :   B # # # # #Z # # #"          MMMM&).777777t p p p p p p p  p f 1 1 1 1 1 1 1 1 1 1 1 1r#