§
    _-PhŸ  ã                   ó   — d Z ddlZd„ ZdS )z.Reference implementations of graph algorithms.é    Nc                 ó†  — | j         d         }t          j        |ft          j        ¦  «        }t          j        |fdt          j        ¬¦  «        }d||<   |||<   d}|sad}t          | j        | j        | j        ¦  «        D ]<\  }}}|dk    r0||         |z   ||         k     r||         |z   ||<   ||         ||<   d}Œ=|¯a||fS )a…  Execute reference implementation of Bellman-Ford.

    Parameters
    ----------
    A : coo sparse matrix
        n x n directed graph with positive weights

    c : array_like
        list of cluster centers

    Returns
    -------
    m : ndarray
        cluster index

    d : ndarray
        distance to cluster center

    See Also
    --------
    amg_core.graph.bellman_ford

    r   g      ð¿)ÚdtypeFT)	ÚshapeÚnpÚfullÚinfÚint32ÚzipÚrowÚcolÚdata)	ÚAÚcÚNnodeÚdÚmÚdoneÚiÚjÚAijs	            úO/var/www/html/test/jupyter/venv/lib/python3.11/site-packages/pyamg/graph_ref.pyÚbellman_ford_referencer      sá   € ð0 ŒGAŒJ€EÝ
Œ"œ&Ñ!Ô!€AÝ
Œ˜$¥b¤hÐ/Ñ/Ô/€Aà€A€aDØ€A€aDà€DØð ØˆÝ˜QœU A¤E¨1¬6Ñ2Ô2ð 	ð 	‰IˆAˆq#ØQŠwˆw˜1˜Qœ4 #™:¨¨!¬Ò,Ð,Ø˜”t˜c‘z!‘Ø˜”t!‘Øøð ð ð ˆqˆ6€Mó    )Ú__doc__Únumpyr   r   © r   r   ú<module>r      s0   ðØ 4Ð 4Ø Ð Ð Ð ð(ð (ð (ð (ð (r   