UgT dZddlmZddlmZddlmZddlmZ ddl Z ddl m Z m Z  ddl Z dd lmZmZmZddlZddlZddlZddlZddlZd d lmZed gdZej:j=ej>deZ ejBejDejDddd ejDddd dddejDejDddZ#ejBejDddddd fejDddddd fejDddddd fejHddd ejJdddejDddd ejDddd ejDddd ejHejLejLejDddZ'ejBej:jQejRejLejHddd fejDddddd fe dddejDddd ejDddd ejLejLejDddZ*ejBejDddddd fejDddddd fe ejJdddZ+dZ,ejBejZejDddddd fejDejJejJdddejHejDddddd fejDddd ejDddd ejDddd ddZ.dZ/ejBejDddddd fejDddddd fejDddddd fejDddddd fejJej>e ejLejLejJ dddej`ejHejHejHddZ1d Z2d!Z3d"Z4ejBejZejDddddd fejDddddd fddd#d$Z5d%Z6Gd&d'Z7Gd(d)e7Z8Gd*d+e7Z9Gd,d-e7Z:Gd.d/e7Z;d0Z.funcsIJ J)r r rs rrrs  K r)gaussiansobel_hsobel_v)ngjit SegmentLength)minmaxmeanT)resultdiff)nopythonnogilfastmathlocalscL|d|dz }||z}|d|dz }|||zz }|S)z/Find the Euclidean distance between two points.rrr)abrrs rdistance_betweenr%0sB Q4!A$;D D[F Q4!A$;D dTkF Mr) next_point current_point step_vectoriposindexdistancectj||j}|d}d}d}|t|kr||}||dk(r2d|cxkrt|dz krnn||zdz }|||<|dz }|dz }nN||dkDr5||}||z |z } t |D]} || | zz||<|dz }|}|dz }n|||<|dz }|}|dz }|t|kr|||<|S)Ndtyperr)npzerosr/lenrange) segments new_segmentsn_points_to_addndimsr&r'r*r+pointsr(r)s rresample_segmentr:?s0 %x~~6JQKM C E #h- e_ E "a 'A,KX9J,K*Z71O #h- e_ #M:> -11 1a%6U3x=STCT6UJ*Z71r8changetotal_resamplesr7 resampleds r resample_edgerHsQ 0DHDZ0\,FO_ /51DIXy/5A rcB|Dcgc]}t|||c}Scc}wN)rH) edge_segmentsr>r8r5s rresample_edgesrLs1) +) ($:E B) ++ +s)r)r5previouscurrentr&c tdD]v}t|dz }td|D]W}||dz ||||dz} }}d|z ||z|||| |zzdz z||<d|z ||z|||| |zzdz z||<Yxy)N r0rr4r3) r5tensionidxidy_ seg_lengthr)rMrNr&s rsmooth_segmentrWs2Y]Q& q*%A,4QUOXa[(STWXSX/zgHi5$hsmjo&EFJLGCLi5$hsmjo&EFJLGCL &rc.|D]}t||||yrJ)rW)rKrRrSrTr5s rsmoothrYs!x#s3"r)itr)xyc t|D]} tdt|dz D]} tj|| |f|z} tj|| |f|z} || |fxx|| | f|z z cc<|| |fxx|| | f|z z cc<t dt || |fd|| |f<t dt || |fd|| |f<| dzdk(st |||}|S)Nrrr0)r4r3r1r<rrrH) verthorizr5 iterationsaccuracyr>rSrTr8rZr)r[r\s radvect_and_resamplerbsJq#h-!+,A (1c6*X56A (1c6*X56A QV ad h 6 6  QV QT X 5 5 "1c(1c6*:A&>?HQV "1c(1c6*:A&>?HQV  - 6Q;$X/EuMH  OrcX|\}} |D cgc]} t|| | |||||| c} Scc} wrJ)rb) gradientsrKr`rar>rSrTr8r^r_edgess radvect_resample_allrfsKKD%' (& eUJJ` #S% 1& (( (s'c#VKtdt||D] }||||zyw)z*Yield successive n-sized batches from seq.rNrQ)seqnr)s rbatchesrjs- 1c#h "!AEl#s')ctj|dz|dzftj}|D] }||||t||dz S)Nrr.r0)sigma)r1r2rDr)rK bandwidthra accumulatorimgr5s rdraw_to_surfacerpsJ ((HqL(Q,/rzz BC!C8," Cy1} --r)rrr c t|jdD]h}t|jdD]K}tj|||fdz|||fdzzdz}|||fxx|zcc<|||fxx|zcc<Mjy)Nrrr0gh㈵>)r4shaper1r=)r^r_r)j magnitudes rnormalize_gradientsrus4::a= !tzz!}%Aad QadQ >?$FI AJ) #J !Q$K9 $K&"rc~|tj|z}t|}t|}t ||||fSrJ)r1rrrru)ror_r^s r get_gradientsrws:266#;C CLE 3>rctj|d|d|dg|d|d|dggtjS)Nrrr0rr.r1arrayrDedges rcreate_segmentz UnweightedSegment.create_segmentIxx$q'47DG4tAwQa6QR jj* *rcl|D]/}|t|d|zt|d|zfxxdz cc<1y)Nrr0intror9rapoints r accumulatezUnweightedSegment.accumulate#?E E!Hx'(#eAh.A*BB Cq H CrN rrrr8rSrT staticmethodrrrrrrrrrrsp EHC//?? * * I IrrcneZdZdZd\ZZedZedZee dZ ee dZ y)EdgelessUnweightedSegmentr0rrc2|j|jgSrJrrs rrz%EdgelessUnweightedSegment.get_columns.s&((##rc gdSrrrs rrz,EdgelessUnweightedSegment.get_merged_columns2rrcptj|d|dg|d|dggtjS)Nrrr0rr.rrs rrz(EdgelessUnweightedSegment.create_segment6s8xx$q'47+d1gtAw-?@ SSrcl|D]/}|t|d|zt|d|zfxxdz cc<1y)Nrrrrs rrz$EdgelessUnweightedSegment.accumulate;rrNrrrrrr*sr EHC$$?? T T I IrrcneZdZdZd\ZZedZedZee dZ ee dZ y)WeightedSegmentrrcJd|j|j|jgSrr[r\weightrs rrzWeightedSegment.get_columnsFs688VXXv}}==rc&ddddd|jgS)Nrrrrrrrs rrz"WeightedSegment.get_merged_columnsJs7GWgv}}MMrctj|d|d|d|dg|d|d|d|dggtjS)Nrrr0rrr.rrs rrzWeightedSegment.create_segmentNsZxx$q'47DGT!W=q'47DGT!W=?FHjjR Rrcr|D]2}|t|d|zt|d|zfxx|dz cc<4y)Nrr0rrrs rrzWeightedSegment.accumulateTCE E!Hx'(#eAh.A*BB CuQx O CrNrrrrrrBst EHC>>NN R R P PrrcneZdZdZd\ZZedZedZee dZ ee dZ y)EdgelessWeightedSegmentrrcH|j|j|jgSrJrrs rrz#EdgelessWeightedSegment.get_columns_s&((FMM22rc$dddd|jgS)Nrrrrrrs rrz*EdgelessWeightedSegment.get_merged_columnscs'7FMMBBrctj|d|d|dg|d|d|dggtjS)Nrrrr0rr.rrs rrz&EdgelessWeightedSegment.create_segmentgrrcr|D]2}|t|d|zt|d|zfxx|dz cc<4y)Nrrr0rrs rrz"EdgelessWeightedSegment.accumulatemrrNrrrrrr[sr EHC33CC * * P Prrctj|||jgd}|j|jd|j di}tj|||j gd}|j|jd|j di}|j}|j}|j}|r|jdd i}|jxr|j|v}|r|rt}nt}n|rt}nt}|j|j!| }g}|j#D]~}|j$|j&|j(|j*f} |r|j,f| z} |r| t/||jfz } |j1|j3| ||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)left_on right_indexrr)columnsrridr)items)pdmergesourcerenamer[r\target sort_index reset_indexinclude_edge_idrrrrrfilterr itertuplesrrrrrgetattrappendr) nodesrerdfrinclude_weight segment_classrKtuprs r_convert_graph_to_edge_segmentsrts %T JB FHHgvxxA BB "efmm_$ GB FHHgvxxA BB B  B,,O YYi0Y 1]]=v}}'=N +M-M 3M5M 99&A BBM}} 399cii; KK>D(D  WS&--02 2D]99$?@  - ''rc,tjt|d|jftj}t t jt||}ttj|}|j||_ |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. r) r1r{r3r8r|list itertoolschainzipr concatenaterr)rKrr delimiterscombinedrs r#_convert_edge_segments_to_dataframersn#m,a1D1DErvvNJIOOS %CDEH 2>>(+ ,B**62BJ IrceZdZdZej ddZej ddZej ddZej d d Z ej d d d Z ejddZ dZ y ) 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. r[z2 Column name for each node's x coordinate.defaultdocr\z2 Column name for each node's y coordinate.rz, 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.r allow_NonerFz. Include edge IDs in bundled dataframec htj||}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)selfrrerprs r__call__zconnect_edges.__call__s8  v .>ueQO}25-KKr)rrr__doc__rStringr[r\rrrBooleanrrrrrrrs  S'5 6A  S'5 6AU\\(1/0FU\\(1/0FU\\$4>KLF$emmE812OLrrc||z ||z z SrJrXloweruppers rminmax_normalizers I%%- ((rc|||z z|zSrJrrs rminmax_denormalizers   &&rceZdZdZej dddZej dddZejd d d Z ejd d d Z ej ddddZ ejddddZ ejddddZ ej ddddZej ddddZej dddZej$d d!"Zd#Zy$)% 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.r)rNz5 Number of passes for the smoothing algorithmi Nz, Number of edges to process togetherg333333?)rNgz; Exponential smoothing factor to use when smoothing)rr precedenceri)riz* 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 segmentrTrrFz< Whether to use dask to parallelize the computation.rc tt tdtj||}|j r=t t}t t}t t}t t}nt}t}t}t}tj||jtj||j} } tj||jtj||j} } |j!}t#||j| | ||j<t#||j| | ||j<t%|||\}} t't)||j*}t-|j.dz|j0dz|j.|j0zdz dz}|Dcgc]}|||| j2}}t5|j6D]}|j8|j:|dzzz|j<z}|dkrn|Dcgc]!}||||j<| j>#}}tA|}||}|Dcgc]C}||||jB|j<|| jD| jF| j2E}}|Dcgc]}|||| j2}}|j rtI|d}g}|D]}|jK|tM||jN| jD| jFtQ|| |}tS||j| | ||j<tS||j| | ||j<|Scc}wcc}wcc}wcc}w)Nzshammer_bundle operation requires dask and scikit-image. Ensure you install the dependency before applying bundling.r0rr)*daskskimager rruse_daskrrLrprwrfr1rr[rr\copyrrrrj batch_sizermin_segment_lengthmax_segment_lengthr8r4r`initial_bandwidthdecayrarsumadvect_iterationsrSrTrextendrYrRrr)rrrerrresample_edges_fndraw_to_surface_fnget_gradients_fnadvect_resample_all_fnxminxmaxyminymaxr edge_batchesr>batchrKr)rmsegmentimages overall_imagerdnew_segsrs rrzhammer_bundle.__call__s <7?*+ +  v . :: ' 7 !(!9 &}5 %,-@%A " . !0 , %8 "VVE!##J'acc );dVVE!##J'acc );d %eACCj$=acc %eACCj$=acc  ?ueQO}GE1<<89 !. ! #Q%9%91%<""Q%9%99Q > B" KWXJV+52H(5(;(;=JV Xq||$A++aggA.>>KI1}&34%2'))QZZIaIab%2 4KM(7I-: ;-: 4IwH[H[12=S1>1B1BMDUDU1>1D1DF-: ;#%2MZ[LY+74J(5(;(;=LY [ ::#M215M"E OOE "# xM$5$5}7H7HI1=! L%RWdD9133$RWdD9133 aX4;[s,O&OAO 'ON)rrrrrNumberrrIntegerr`rrRrar rrrrrrrrrrrrsQ% TI./ ELLI;O PEq>89JuHB/0Jell3h$L>?Gu}}S TO-.H& bDV>?&e8tY?@&e8tY?@U\\(tBKLFu}}U1?@HYrr)Dr __future__rmathrpandasr collectionsrrrrr rskimage.filtersrrr Exceptionnumpyr1rrnumbanbrutilsrrtypes NamedUniTuplefloat64segment_length_typejitrDr%r<int64uint64r:TuplebooleanrArHrLvoidrWrYuint8rbrfrjrprurwryrrrrrrParameterizedFunctionrdirectly_connect_edgesrrrrrrr2s- #"%:: O-CD hh,,RZZMJBJJrzz#A# 3Q30   jj"** 5 BJJq1ubjj3Q3'AccE):BIIccNBHHU   jj1oCaCzz#A# YYyyJJ  >;BHHNNBJJ 299SqS>:;BJJq1uI     +  BGGBJJq1u rzz288RXX>    YYJJq1u%JJssO::cc?jj1o   M M4BJJq1ubjj3Q3'AccE):BJJq1u