a Df|@s*ddlmZddlmZddlZddlZddlZddl m Z m Z m Z ddl mZddlmZddlmZmZmZd d lmZd d lmZd d lmZmZmZmZmZGd ddeZGdddeZ GdddeZ!GdddeZ"Gddde e Z#Gddde#Z$GdddeZ%Gddde#Z&dS)) defaultdict) FunctionTypeN)Dataset Dimension Element2D)Redim) Operation) is_dataframe max_rangesearch_indices)Points)Path)circular_layoutconnect_edges_pdconnect_tri_edges_pdquadratic_bezier split_pathcs"eZdZdZdfdd ZZS) RedimGraphz| Extension for the redim utility that allows re-dimensioning Graph objects including their nodes and edgepaths. Nc sntj|fi|}|jf}|jjr@||jjj|fi|f}|jjrd||jjj|fi|f}||SN) super__call__data_objnodesredim _edgepaths edgepathsclone)selfspecs dimensionsZredimmedZnew_data __class__e/nfs/NAS7/SABIOD/METHODE/ermites/ermites_venv/lib/python3.9/site-packages/holoviews/element/graphs.pyrszRedimGraph.__call__)N)__name__ __module__ __qualname____doc__r __classcell__r%r%r#r&rsrc@sDeZdZdZejdddZejdddZej iddZ d dd Z dS) layout_nodesa Accepts a Graph and lays out the corresponding nodes with the supplied networkx layout function. If no layout function is supplied uses a simple circular_layout function. Also supports LayoutAlgorithm function provided in datashader layouts. Fz* Whether to return Nodes or Graph.defaultdocNz# A NetworkX layout functionz9 Keyword arguments passed to the layout function.cCs|jjrt|jjtrddl}|ddg}||}d|jjvr||jjd}t|||D]\\}}} | |j ||f|<q\|jj|fi|jj} ddt | D} n||j ddd} |j ddd} t t | | g} |jjr td| i}|jj||fi|jj} | gd } nt| } || } |jrn|jjD]*}|j |}| j|t| j|d d } qB|jjr|| S||j| fS) Nrr weightcSsg|]\}}t||fqSr%)tuple).0idxposr%r%r& Bz)layout_nodes._process..Fexpandedindex)xyr9T)Zvdim)playout isinstancerZnetworkxarrayZ from_edgelistkwargszipedgessorteditemsdimension_valuesnpunique concatenatepdZ DataFramedframer node_type_nodesrvdims add_dimensionlen only_nodesrr)r elementkeyZnxrBgraphr0stw positionsrsourcetargetdfdvalsr%r%r&_process8s4        zlayout_nodes._process)N) r'r(r)r*paramBooleanrPCallabler=Dictr@r]r%r%r%r&r,'s r,c@s>eZdZdZejedededgddZejdddZ d S) Nodesz Nodes is a simple Element representing Graph nodes as a set of Points. Unlike regular Points, Nodes must define a third key dimension corresponding to the node index. r:r;r9rdr.boundsTr.constantN) r'r(r)r*r^ListrkdimsStringgroupr%r%r%r&rbWsrbc@seZdZdZejdddZdS) EdgePathszh EdgePaths is a simple Element representing the paths of edges connecting nodes in a graph. TrgN)r'r(r)r*r^rkrlr%r%r%r&rmdsrmcseZdZdZejdddZejededgddZ e Z e Z d$fd d Zed d Zd dZddZd%fdd Zd&ddZeddZd'fdd Zd(fdd ZeddZed d!Zed)d"d#ZZS)*Graphad Graph is high-level Element representing both nodes and edges. A Graph may be defined in an abstract form representing just the abstract edges between nodes and optionally may be made concrete by supplying a Nodes Element defining the concrete positions of each node. If the node positions are supplied the EdgePaths (defining the concrete edges) can be inferred automatically or supplied explicitly. The constructor accepts regular columnar data defining the edges or a tuple of the abstract edges and nodes, or a tuple of the abstract edges, nodes, and edgepaths. Trgstartend)rrreNc  st|tr*|ddt|}|\}}}n4t|t|rN||j|j}}}n|dd}}}|durd}t||jrxqt|tr|jdkr||}q|}d}nd}|durt||j s| |}||_ ||_t j |f||d||dur| ||dS)NrrdrjrM)r>r1rOtyperrrKrndims edge_typerLr__init___add_node_info _validate) r rrjrMparamsrBrr node_infor#r%r&rus.      zGraph.__init__cCs t|ddS)NZdatasetmode)rr r%r%r&rsz Graph.redimc s(|jjddgd}t||jrD|jfitt|jddd|j}|jsbt |t |krbt d|jdj }| }| |jr|jdnt d |}d |jvrȈj d ksȈjd d id d }fd d |jD}||}tj||j dd|j|jddg|jd}||_dS)Npandas dictionary)datatyperRTlabelzThe supplied node data does not match the number of nodes defined by the edges. Ensure that the number of nodes matchor supply an index as the sole key dimension to allow the Graph to merge the data.r9Z__index)columnscs$g|]}|jvs|jkr|qSr%)rname)r2cr3Znode_dfr%r&r5s  z(Graph._add_node_info..left)left_onZright_onhowrrq)rrr>rKrdictrAr"rjrO ValueErrorrrJrZ reset_indexrrenamerImergerMrL)r ryrrZ node_info_dfcolsr%rr&rvs4     zGraph._add_node_infocCs|jdurdSg}t|jj|jjD]$\}}||kr$||d|q$|r`tdd|t|jj }t|}||krd}|dkr|j d}| d}tt t |d}t |ds|d7}||k}|rtd||fdS) Nz != zIEnsure that the first two key dimensions on Nodes and EdgePaths match: %sz, Tr rrz_Ensure that the number of edges supplied to the Graph (%d) matches the number of edgepaths (%d))rrArrjrappendrjoinrOrsplitrErFwhereisnan)r ZmismatchZkd1Zkd2ZnpathsZnedgesrBr\r%r%r&rws2   zGraph._validatecs||dur6|j|jf}|jdur*||jf}|j|d<n&t|ts\||jf}|jr\||jf}tj||||g|Ri|S)NZplot_id) rrrrZ_plot_idr>r1rr)r rZ shared_datanew_typelinkargsZ overridesr#r%r&rs       z Graph.clonerBc sddlm}|dur&t||s&tdfdd|D}|rVtfdd|Dr^|sb|sbSjjdjjj fd d|D}|r|j jd d d }j|}njj fit |fi|}fd d|D}d} t |t jkr~dd\} } t|dd } |dkrdj| j| i} j| j| i}| |B} j}nj| j| | j| i} d}|rj|}| dur|dur|| M}n| }|durj |}t|s6||f}|jdd d}|jdd d}tt||g}|jddddt|f}d}jrj}||j||}t jjdkr||g}n j}j}|||fS)a Allows selecting data by the slices, sets and scalar values along a particular dimension. The indices should be supplied as keywords mapping between the selected dimension and value. Additionally selection_specs (taking the form of a list of type.group.label strings, types or functions) may be supplied, which will ensure the selection is only applied if the specs match the selected object. Selecting by a node dimensions selects all edges and nodes that are connected to the selected nodes. To select only edges between the selected nodes set the selection_mode to 'nodes'. r)dimNzThe first positional argument to the Dataset.select method is expected to be a holoviews.util.transform.dim expression. Use the selection_specs keyword argument to specify a selection specificationcs*i|]"\}}|ddgvr||qS)rangesZselection_maskr")r2rselr|r%r& s z Graph.select..c3s|]}|VqdSr)matches)r2spr|r%r& r6zGraph.select..cs i|]\}}|jvr|qSr%rjr2kv) index_dimr r%r&rs  FT)computeZ keep_indexcsi|]\}}|vr||qSr%r%rrr%r&rr6rBrr7r )Zutil.transformrr>rrDanyrrjrrMapplyselectrrOlistrEZ interfaceZ select_maskrFallrrGrHr_split_edgepathsZ select_pathsrrJ)r Zselection_exprselection_specsselection_mode selectionrZnode_selectionmaskrZnodemaskxdimydimindicesZmask1Zmask2rZ new_graphrXrYZ unique_nodespathsrr%)r"rr r&rsl         z Graph.selectcCs0t|t|jjkr|jS|jt|jSdSr)rOrrrrr|r%r%r&rGszGraph._split_edgepathscsZ|jrJ||jvrJ|j|||}|jrF|j|||}t||gS|St|||Sr)rr"rangerr r)r Z dimensionZ data_rangeZdimension_rangeZ node_rangeZ path_ranger#r%r&rNs z Graph.rangerFcszt||}|dkrv|jdur0|j||}n>|jj|jj}|dvrXdd|D}n|dvrndd|D}||S|S)Nr)rTshortcSsg|] }|jqSr%)rr2r[r%r%r&r5_r6z$Graph.dimensions..)longrcSsg|] }|jqSr%rrr%r%r&r5ar6)rr"rLrrKrjrM)r rrr"Z node_dimsr#r%r&r"Ws zGraph.dimensionscCs>|jdur8ddlm}t|dd|_d|j_||j_|jS)z Computes the node positions the first time they are requested if no explicit node information was supplied. Nr)chainT)rP)rLZoperation.elementrr,Z_datasetinstanceZ _pipeline)r rr%r%r&res    z Graph.nodescCs.|jr |jSt|}|j||jjdddS)zl Returns the fixed EdgePaths or computes direct connections between supplied nodes. Nrr)rrrtrrj)r rr%r%r&rsszGraph.edgepathsc st|ts||fi|}tt|D]\}}t|j||D]&\}}t|ttfr`qH||qHt|t rt |}t|t rt |}d|d|q*tfddD} dd| D} t fddddg| D} j j dd \} } |r`| |j d jtfd dD\}}d d tt|D}ng}d}ttt|D]\}}|j|}|durq||\}}j|| j||D],\}}t|ttfrqΈ||qt|D] \}}||||qt|t r:t |}| j|q|tfddD}j| j| jg|t|}t fdd|D}g}|D]L}t|trt |}n&|dur||jvr||}n|}||qj ||d}| |f| dS)aw Generate a HoloViews Graph from a networkx.Graph object and networkx layout function or dictionary of node positions. Any keyword arguments will be passed to the layout function. By default it will extract all node and edge attributes from the networkx.Graph but explicit node information may also be supplied. Any non-scalar attributes, such as lists or dictionaries will be ignored. Args: G (networkx.Graph): Graph to convert to Graph element positions (dict or callable): Node positions Node positions defined as a dictionary mapping from node id to (x, y) tuple or networkx layout function which computes a positions dictionary kwargs (dict): Keyword arguments for layout function Returns: Graph element rorpcs0g|](}|dvrt|tdkr|qS))rorprorOr2rrBr%r&r5sz'Graph.from_networkx..cSs"g|]}t|trt|n|qSr%)r>intstrr2colr%r%r&r5r6c3s|]}|VqdSrr%rrr%r&rr6z&Graph.from_networkx..Nrdrc3s"|]\}}|kr||fVqdSrr%r)idx_dimr%r&rr6cSsi|]\}}||qSr%r%)r2ir\r%r%r&rr6z'Graph.from_networkx..cs6g|].}|jjvrt|tjkr|qSr%)rKrjrOrr)cls node_columnsrr%r&r5sc3s|]}|VqdSrr%r)rr%r&rr6)rM)r>rrrrBrCZadjrDrr1rrKrjrrrArget enumeraterrMZ get_dimension)rGrWrr@rorpattrvalueZ edge_colsZ edge_vdimsZ edge_datarZidimZ info_colsvaluesryr3r4noder:r;rrZ node_colsr node_datarMrr%)rrBrrrr& from_networkx~sn          zGraph.from_networkx)NN)NTNT)NNrB)TT)rF)N)r'r(r)r*r^rkrlrirrjrbrKrmrtrupropertyrrvrwrrrrr"rr classmethodrr+r%r%r#r&rnms0 $ T    rncsveZdZdZejgddddZejdddZe Z dfd d Z e d d Z d dZeddZdfdd ZZS)TriMesha@ A TriMesh represents a mesh of triangles represented as the simplices and nodes. The simplices represent a indices into the nodes array. The mesh therefore follows a datastructure very similar to a graph, with the abstract connectivity between nodes stored on the TriMesh element itself, the node positions stored on a Nodes element and the concrete paths making up each triangle generated when required by accessing the edgepaths. Unlike a Graph each simplex is represented as the node indices of the three corners of each triangle. )node1node2Znode3rcz@ Dimensions declaring the node indices of each triangle.r.rfr/TrgNc st|tr*|ddt|}|\}}}n4t|t|rN||j|j}}}n|dd}}}tj|f||d||durt|dkrg}ntdt||j rnt||j r| t | ddt t|}nt|t r|jdvrt|r,t|jdd}|jjpd} | ||| g}nfz4| |} t |  ddt t| } | | }Wn0ty} ztd | WYd} ~ n d} ~ 00|durt||js||}||_||_dS) Nrrdrqrz8TriMesh expects both simplices and nodes to be supplied.r9r)rrdzNodes argument could not be interpreted, expected data with two or three columns representing the x/y positions and optionally the node indices.)r>r1rOrrrrrrurrK point_typerrNrFZarangersr rrr9r ExceptionrtrL) r rrjrMrxrBrrcoordsr9pointsZdser#r%r&rusD     $   zTriMesh.__init__cCstzddlm}Wnty,tddYn0t|ts@t|}t|sT|ggfS||ddg}||j|fS)zc Uses Delauney triangulation to compute triangle simplices for each point. r)Delaunayz@Generating triangles from points requires SciPy to be installed.Nr )Z scipy.spatialr ImportErrorr>rrOr?Z simplices)rrrZtrisr%r%r& from_verticess   zTriMesh.from_verticescCs|jr |jSt|s8|jg|jjddd}||_|St|}|jt|ddf}tj |ddgdddf t ddtj dd ddd }|j|g|jjddd gd }||_|S) R Returns the EdgePaths by generating a triangle for each simplex. Nrrrd)rr rr)rr)rr rrh)Z pad_widthr{Zconstant_valuesrZ multitabular)rjr) rrOrtrrjrrZreshaperFpadastypefloatnan)r rrZZptsrr%r%r&_initialize_edgepaths0s,zTriMesh._initialize_edgepathscCs|S)r)rr|r%r%r&rGszTriMesh.edgepathsc s |tjfddd|S)a Allows selecting data by the slices, sets and scalar values along a particular dimension. The indices should be supplied as keywords mapping between the selected dimension and value. Additionally selection_specs (taking the form of a list of type.group.label strings, types or functions) may be supplied, which will ensure the selection is only applied if the specs match the selected object. Nr)rr)rrr)r rrr#r%r&rNs  zTriMesh.select)NN)N)r'r(r)r*r^rirjrkrlrrrurrrrrrr+r%r%r#r&rs +  rc@s8eZdZdZejddddZejdddZd d d Zd S) layout_chordsa> layout_chords computes the locations of each node on a circle and the chords connecting them. The amount of radial angle devoted to each node and the number of chords are scaled by the value dimension of the Chord element. If the values are integers then the number of chords is directly scaled by the value, if the values are floats then the number of chords are apportioned such that the lowest value edge is given one chord and all other nodes are given nodes proportional to their weight. The max_chords parameter scales the number of chords to be assigned to an edge. The chords are computed by interpolating a cubic spline from the source to the target node in the graph, the number of samples to interpolate the spline with is given by the chord_samples parameter. 2)rNzB Number of samples per chord for the spline interpolation.riz, Maximum number of chords to render.r-Nc0 sRjr$jd}j|dd}n0jddd}jddd}tt||g}|jj}fddtdD\}} t ||} t | |} j rd} | j j d vrtj td d } nT| j j d krt| d | } | |kr$t| t| |} | d} ntj td d } tt|t|f} t| | | D] \}}}| ||f|7<qF| jdd| jdd}||dtj}t|jdd}||dd<|}tj|ddgdd}t|}t|}g}t|jdD]Z}||}||||d}}t||t|}ttt|t|}||qt tj!tj!gg}g}ttD]}| || |} }!|| ||!}"}#| | |!f}$g}%tt|$D]}&|"r|#sҐq|""\}'}(|#sq|#"\})}*t#|'|(f|)|*f|'d|(df|)d|*df|jj$d}+|%|+|%|qdd|%ddD}%|%rp|t|%n|t%dqxrt&t'rjnt'jdd|gfddj D},t(fdd|,D} nt'jdg} },t|r|||f| }-nt(dd|,D}-t'|-|,d}t)|}.t*j+||.fdd}/||/_,|/S)NrFr7rr c3s|]}|VqdSrrE)r2r)rQr%r&rr6z)layout_chords._process..rZuifr)dtypefg?int64)Zaxisg?Zvalidrzg@)ZstepscSsg|]}t|r|qSr%r)r2r<r%r%r&r5r6z*layout_chords._process..)rrcsg|]}|vr|qSr%r%r2Zvdrr%r&r5r6c3s|]}|VqdSrrr)nodes_elr%r&rr6r%css|] }gVqdSrr%)r2_r%r%r&rr6rq)r)-rLrjrErFrGrHr< max_chordsrr rMrkindZonesrOceilminsumrrzerosrApishapeZcumsumZconvolvecossinZlinspacerrrr?rpopr chord_samplesemptyr>rbr1rmChordr_angles)0r rQrRrrrXrYrsrcZtgtZsrc_idxZtgt_idxrZmatrixrTrUrZweights_of_areasZareas_in_radiansrZ midpointsZmxsZmysZ all_areasrZn_connZp0p1ZanglesrrrZsidxZtidxZsrc_areaZtgt_areaZn_connsZsubpathsrZx0Zy0x1y1brMrrBchordr%)rQrjrr&r]ws                  zlayout_chords._process)N) r'r(r)r*r^ZIntegerrrr]r%r%r%r&r_srcsHeZdZdZejdddZd fdd ZeddZ ed d Z Z S) ra. Chord is a special type of Graph which computes the locations of each node on a circle and the chords connecting them. The amount of radial angle devoted to each node and the number of chords are scaled by a weight supplied as a value dimension. If the values are integers then the number of chords is directly scaled by the value, if the values are floats then the number of chords are apportioned such that the lowest value edge is given one chord and all other nodes are given nodes proportional to their weight. TrgNc  sJ|dust|tr&|gkr&gggff}t|trP|ddt|}|\}}}n|dd}}}|durt|ts|jdkrt|}n&t|}|j|jd|jddd}t t |j |f||d||r||_ t |} | j|_ | j|_| j|_nHt|tstdt|d||_ t|ts8tdt|||_|dS) Nrrdrr rqz%Expected Nodes object in data, found .z,Expected EdgePaths object in data, found %s.)r>rr1rOrrsrbrrjrrnrurLrrrrr TypeErrorrrrmrw) r rrjrMrrxrBrrrr#r%r&rus<           zChord.__init__cCs|jSr)rr|r%r%r&rszChord.edgepathscCs|jSr)rLr|r%r%r&rsz Chord.nodes)NNT) r'r(r)r*r^rkrlrurrrr+r%r%r#r&rs # r)' collectionsrtypesrnumpyrFr}rIr^corerrrZcore.accessorsrZcore.operationr Z core.utilr r r Zchartrpathrutilrrrrrrr,rbrmrnrrrr%r%r%r&s.       0  r