a `E@sdZddlmZmZmZddlmZddlmZm Z ddl m Z z ddl Z ddl mZmZmZWneyvdZ Yn0ddlZddlZddl ZddlZdd lmZed d Zejd d ZejddZddZe ddZejddZ ddZ!eddZ"ddZ#e ddZ$ddZ%e d d!Z&e d"d#Z'Gd$d%d%e(Z)Gd&d'd'e)Z*Gd(d)d)e)Z+Gd*d+d+e)Z,Gd,d-d-e)Z-d.d/Z.d0d1Z/Gd2d3d3ej0Z1e1Z2d4d5Z3d6d7Z4Gd8d9d9e1Z5dS):aBundle a graph's edges to emphasize the graph structure. Given a large graph, the underlying structure can be obscured by edges in close proximity. To uncover the group structure for clearer visualization, edges are split into smaller edges and bundled with neighbors. Ian Calvert's `Edgehammer`_ is the original implementation of the main algorithm. .. _Edgehammer: https://gitlab.com/ianjcalvert/edgehammer )absolute_importdivisionprint_function)ceil)computedelayed) DataFrameN)gaussiansobel_hsobel_v)ngjitcCs,|d|dd|d|dddS)z/Find the Euclidean distance between two points.rr g?)abrr2lib/python3.9/site-packages/datashader/bundling.pydistance_between#src Cstj||jd}|d}d}d}|t|kr||}t||} | |krd|krdt|dkrnn&||d}|||<|d7}|d7}q | |krtt| ||d} t| D]$} || ||| ||<|d7}q|}|d7}q |||<|d7}|}|d7}q |||<|S)N)dtyperr r)npzerosrlenrintrrange) segmentsZ new_segmentsmin_segment_lengthmax_segment_lengthndims next_point current_pointposindexdistancepointsirrrresample_segment)s2 (      r%c Cs|d}d}d}d}|t|kr||}t||}||kr|d|krVt|dkr|nn"d}||d}|d7}|d7}q||krd}tt|||d} || 7}|}|d7}q|d7}|}|d7}q|d7}||fS)Nrr FrT)rrrr) rrrrr!totalZ any_changerr"r#rrrcalculate_lengthJs.  (    r'cCs:t|||\}}|s|St||f}t||||||SN)r'remptyr%)rrrrZchangeZtotal_resamplesZ resampledrrr resample_edgehs r*cCs&g}|D]}|t||||q|Sr()appendr*) edge_segmentsrrrZreplaced_edgesrrrrresample_edgesqsr-c Cst|d}td|D]}||d||||d}}}d||||||||d||<d||||||||d||<qdS)Nrr )rr) rtensionidxidyZ seg_lengthr$Zpreviouscurrentrrrrsmooth_segmentys  $,r2cCs|D]}t||||qdSr()r2)r,r.r/r0rrrrsmoothsr3c Cstdt|dD]}t||||}t||||}||||||f||||<||||||f||||<tdt|||d|||<tdt|||d|||<qdS)Nr r)rrrmaxmin) rverthorizaccuracyr/r0r$xyrrradvect_segmentss$$ r;c CsDt|D]6}t|||||j|j|ddkrt||||j}q|S)Nrr)rr;r/r0r*r) r6r7r iterationsr8rr segment_classitrrradvect_and_resamples   r?cs&|\fdd|DS)Nc s"g|]}t|qSr)r?).0edgesr8r7r<rrr=r6rr sz'advect_resample_all..r) gradientsr,r<r8rrr=rrBradvect_resample_allsrEccs,tdt||D]}||||VqdS)z(Yield successive n-sized batches from l.rN)rr)lnr$rrrbatchessrHcCsFt|d|df}|D]}|D]}||||q"qt||ddS)Nr r)Zsigma)rrr )r, bandwidthr8Z accumulatorimgrpointrrrdraw_to_surfaces rLcCsP|t|}t|}t|}t|d|dd}||}||}||fS)Nrgh㈵>)rr4r r Zsqrt)rJr7r6Z magnituderrr get_gradientssrMc@seZdZeddZdS) BaseSegmentcCstd|jftjS)Nr )rZfullrnan)clsrrrcreate_delimiterszBaseSegment.create_delimiterN)__name__ __module__ __qualname__ classmethodrQrrrrrNsrNc@sReZdZdZd\ZZeddZeddZee j ddZ ee d d Z d S) UnweightedSegmentr rcCsd|j|jgSNedge_idr9r:paramsrrr get_columnsszUnweightedSegment.get_columnscCsgdSN)rZsrc_xsrc_ydst_xdst_yrr\rrrget_merged_columnssz$UnweightedSegment.get_merged_columnscCs2t|d|d|dg|d|d|dggS)Nrr rrWrZarrayedgerrrcreate_segmentsz UnweightedSegment.create_segmentcCs0|t|d|t|d|fd7<dS)Nr rrrJrKr8rrr accumulateszUnweightedSegment.accumulateNrRrSrTrr/r0 staticmethodr^rdnbjitrir rlrrrrrVs   rVc@sReZdZdZd\ZZeddZeddZee j ddZ ee d d Z d S) EdgelessUnweightedSegmentrrr cCs |j|jgSr(r[r\rrrr^sz%EdgelessUnweightedSegment.get_columnscCsgdSr_rr\rrrrdsz,EdgelessUnweightedSegment.get_merged_columnscCs&t|d|dg|d|dggS)Nrr rrWrfrgrrrrisz(EdgelessUnweightedSegment.create_segmentcCs0|t|d|t|d|fd7<dS)Nrr rjrkrrrrlsz$EdgelessUnweightedSegment.accumulateNrmrrrrrqs   rqc@sReZdZdZd\ZZeddZeddZee j ddZ ee d d Z d S) WeightedSegmentrerXcCsd|j|j|jgSrYr9r:weightr\rrrr^szWeightedSegment.get_columnscCsddddd|jgS)NrZr`rarbrcrur\rrrrdsz"WeightedSegment.get_merged_columnscCs>t|d|d|d|dg|d|d|d|dggS)Nrr rrWrerfrgrrrriszWeightedSegment.create_segmentcCs4|t|d|t|d|f|d7<dS)Nr rrWrjrkrrrrlszWeightedSegment.accumulateNrmrrrrrss   rsc@sReZdZdZd\ZZeddZeddZee j ddZ ee d d Z d S) EdgelessWeightedSegmentrWrrcCs|j|j|jgSr(rtr\rrrr^ sz#EdgelessWeightedSegment.get_columnscCsdddd|jgS)Nr`rarbrcrvr\rrrrdsz*EdgelessWeightedSegment.get_merged_columnscCs2t|d|d|dg|d|d|dggS)Nrr rerrWrfrgrrrrisz&EdgelessWeightedSegment.create_segmentcCs4|t|d|t|d|f|d7<dS)Nrr rrjrkrrrrlsz"EdgelessWeightedSegment.accumulateNrmrrrrrxs   rxcCstj|||jgdd}|j|jd|jdid}tj|||jgdd}|j|jd|jdid}|}|}|j r|jdd id}|j o|j |v}|j r|rt }qt }n|rt }nt}|j||d }g}|jD]}|||q||fS) aB Merge graph dataframes into a list of edge segments. Given a graph defined as a pair of dataframes (nodes and edges), the nodes (id, coordinates) and edges (id, source, target, weight) are joined by node id to create a single dataframe with each source/target of an edge (including its optional weight) replaced with the respective coordinates. For both nodes and edges, each id column is assumed to be the index. We also return the dimensions of each point in the final dataframe and the accumulator function for drawing to an image. T)Zleft_onZ right_indexr`ra)columnsrbrcidrZ)items)pdmergesourcerenamer9r:targetZ sort_indexZ reset_indexinclude_edge_idrursrVrxrqfilterrdvaluesr+ri)nodesrAr]dfZinclude_weightr=r,rhrrr_convert_graph_to_edge_segmentss* rcs2fdd}ttt|}||_|S)z Convert list of edge segments into a dataframe. For all edge segments, we create a dataframe to represent a path as successive points separated by a point with NaN as the x or y value. c3sD]}|VVqdSr()rQrgr,r=rr edge_iteratorYsz:_convert_edge_segments_to_dataframe..edge_iterator)rrZ concatenatelistr^ry)r,r=r]rrrrr#_convert_edge_segments_to_dataframeOs  rc@sneZdZdZejdddZejdddZejdddZejd d dZ ejd d d dZ ej dddZ ddZ d S) connect_edgesz Convert a graph into paths suitable for datashading. Base class that connects each edge using a single line segment. Subclasses can add more complex algorithms for connecting with curved or manhattan-style polylines. r9z2 Column name for each node's x coordinate.)defaultdocr:z2 Column name for each node's y coordinate.r~z, Column name for each edge's source.rz, Column name for each edge's target.NTH Column name for each edge weight. If None, weights are ignored.rZ allow_NonerFz. Include edge IDs in bundled dataframecKs(t||}t|||\}}t|||S)a( Convert a graph data structure into a path structure for plotting Given a set of nodes (as a dataframe with a unique ID for each node) and a set of edges (as a dataframe with with columns for the source and destination IDs for each edge), returns a dataframe with with one path for each edge suitable for use with Datashader. The returned dataframe has columns for x and y location, with paths represented as successive points separated by a point with NaN as the x or y value. )paramParamOverridesrr)selfrrAr]pr=rrr__call__~s zconnect_edges.__call__)rRrSrT__doc__rStringr9r:r~rruZBooleanrrrrrrrcsrcCs||||Sr(rXlowerupperrrrminmax_normalizesrcCs||||Sr(rrrrrminmax_denormalizesrc@seZdZdZejddddZejddddZejd d d dZ ejd d d dZ ejdddddZ ejdd dddZ ejdddddZ ejdddddZejdddddZejddddZdd Zd!S)" hammer_bundlez Iteratively group edges and return as paths suitable for datashading. Breaks each edge into a path with multiple line segments, and iteratively curves this path to bundle edges into groups. g?)Nz+ Initial value of the bandwidth....)rboundsrgffffff?)rg?zL Rate of decay in the bandwidth value, with 1.0 indicating no decay.re)r Nz5 Number of passes for the smoothing algorithmi Nz, Number of edges to process togetherg333333?)rNgz; Exponential smoothing factor to use when smoothing)rrZ precedenceriz* Number of entries in table for...2z; Number of iterations to move edges along gradientsgMb?z< Minimum length (in data space?) for an edge segmentgMb?z< Maximum length (in data space?) for an edge segmentruTrrc stdurtdt||t|jt|j}}t|jt|j}}| }t |j|||j<t |j|||j<t ||\}t t |j}fdd|D} tjD]j} jj| djdkrqBfdd| D} t| } t| fdd| D} qևfdd| D} t| } td D]&} | D]} t| jjjqnqfg}| D]} || qt|}t|j|||j<t|j|||j<|S) Nzjhammer_bundle operation requires scikit-image. Ensure you install the dependency before applying bundling.cs g|]}t|jjjqSrr-rrr)r@batchrr=rrrCz*hammer_bundle.__call__..r rcsg|]}t|jjqSr)rLr8rlr@Zsegment)rIrr=rrrCrc s(g|] }t|jjjjqSr)rEadvect_iterationsr8rrr)rDrr=rrrCscs g|]}t|jjjqSrrrrrrrCr )skimage ImportErrorrrrr5r9r4r:copyrrrrH batch_sizerr<initial_bandwidthdecayr8sumrMrr3r.r/r0extendrr)rrrAr]ZxminZxmaxZyminZymaxZ edge_batchesr,r$ZimagesZ overall_imagerZnew_segsrr)rIrDrr=rrsB ""   zhammer_bundle.__call__N)rRrSrTrrNumberrrZIntegerr<rr.r8rrrrrurrrrrrsr)6rZ __future__rrrZmathrZdaskrrZpandasrrZskimage.filtersr r r ExceptionZnumbaroZnumpyrr|rZutilsr rrpr%r'r*r-r2r3r;r?rErHrLrMobjectrNrVrqrsrxrrZParameterizedFunctionrZdirectly_connect_edgesrrrrrrrs`                0+