1-PhG "ddlZddlmZddZdS)N)_spathFc |dkr ||jz }d|zdzf|jdz z}tj||z }tj||tj|d}tj|}tj||j|fdj}|j d||j |dzdz}tj|} tj|} tj| |tj |d} tj| |j| fdj} tj| |tj |d| j d} tj| |j| fdj}tj|| }|| |d \}}|D])}|t!|}|tjkrn*||}|s[tj|}tj|ddd|f|dd|dzdfgd}tj|}||fS) aBFind the shortest path through an n-d array from one side to another. Parameters ---------- arr : ndarray of float64 reach : int, optional By default (``reach = 1``), the shortest path can only move one row up or down for every step it moves forward (i.e., the path gradient is limited to 1). `reach` defines the number of elements that can be skipped along each non-axis dimension at each step. axis : int, optional The axis along which the path must always move forward (default -1) output_indexlist : bool, optional See return value `p` for explanation. Returns ------- p : iterable of int For each step along `axis`, the coordinate of the shortest path. If `output_indexlist` is True, then the path is returned as a list of n-d tuples that index into `arr`. If False, then the path is returned as an array listing the coordinates of the path along the non-axis dimensions for each step along the axis dimension. That is, `p.shape == (arr.shape[axis], arr.ndim-1)` except that p is squeezed before returning so if `arr.ndim == 2`, then `p.shape == (arr.shape[axis],)` cost : float Cost of path. This is the absolute sum of all the differences along the path. rr)axisF)orderNr)dtype)offsetsF) find_all_ends)ndimnpindicesinsertonesmultiplyreducereshapeTshapezerosfullr rMCP_Diff find_coststupleinf tracebackarray concatenatesqueeze)arrreachroutput_indexlistoffset_ind_shapeoffset_indices offset_sizer non_axis_shapenon_axis_indices non_axis_size start_indicesstarts end_indicesendsmcostsrendcosts S/var/www/html/test/jupyter/venv/lib/python3.11/site-packages/skimage/graph/spath.py shortest_pathr4s~H axx E A '38a<8Z 011E9NY~tRW=M5N5NUVWWWN+$$%566Kj#(K)@LLLNG Yuu% $(**(==Nz.11K&&~66MI.bh~6N6NUVWWWM Z -'@ L L L NF)  *:*@AAA  K :kCHm#> E  C  I *HY'' N qqq%4%x )AAAtaxzzM": ;!   Jy)) d?)rrF)numpyrrr4r5r3r9sGNNNNNNr5