9iG "SSKrSSKJr SSjrg)N)_spathc US:aX R- nSU-S-4URS- -n[R"U5U- n[R"XR[R"U5SS9n[R R U5n[R"XPRU4SS9RnURSUURUS-S-n[R"U5n [R R U5n [R"X[R"U5SS9n [R"XRU 4SS9Rn [R"U U[R"USU RS 9SS9n [R"XRU 4SS9Rn[R"XS 9nURXS S 9unnUH'nU[!U5nU[R":wdM' O UR%W5nU(dX[R&"U5n[R("USS2SU24USS2US-S24/SS9n[R*"U5nUW4$) aFind 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)orderN)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/land-doc-ocr/venv/lib/python3.13/site-packages/skimage/graph/spath.py shortest_pathr4s-H ax E A '388a<8ZZ 01E9NYY~RWW=M5NUVWN++$$%56Kjj((K)@LNNG YYu% $(*(==Nzz.1KK&&~6MII.bhh~6NUVWM ZZ -'@ L N NF))  *:*@*@A  K ::kHHm#  C I HHY' NN q%4%x )AtaxzM": ;! JJy) d?)rr F)numpyrrr4r5r3r9sNr5