ELF@@8@88$$Ptd444ttQtdRtdppGNUb<{zHMϒ   ue}F"%_wU2]B  , R D%H__gmon_start___ITM_deregisterTMCloneTable_ITM_registerTMCloneTable__cxa_finalize_ZdlPvmmemmove__stack_chk_guard_Znwmmemsetmemcpy_ZSt20__throw_length_errorPKc__stack_chk_fail_Unwind_Resume__gcc_personality_v0PyArg_ParseTupleAndKeywordsPy_BuildValue_Py_DeallocPyExc_ValueErrorPyErr_FormatPyErr_SetStringPyExc_TypeErrorPyInit__lsapPyImport_ImportModulePyObject_GetAttrStringPyCapsule_TypePyCapsule_GetPointerPyModule_Create2PyExc_RuntimeErrorPyErr_PrintPyExc_ImportErrorlibstdc++.so.6libgcc_s.so.1libc.so.6ld-linux-aarch64.so.1CXXABI_1.3.9GLIBCXX_3.4GLIBC_2.17GCC_3.0GCC_3.3.10yѯ /t)< H0P&y Sa_& [Hx44@4H4@@@+H!XX+    ( 0 8 @HPX`hpx {a{_{G?    @ @"  @B @b @ @ @ @ "@ &@" *@B .@b 2@ 6@ :@ >@ B@ F@" J@B N@b R@ G@_    ! ?T!Ga_ ! !"A !ABGb_ { `"F9@7GX@ R`"9 @{¨_     O?#{P@OA?JT@ &|Өhf  xhmyfnyj ЊЈx)ЌTFAmT@K x%? Txfh@BBIyd  BA?KT{#_ P BBBTBxb  {#_ ?#{c TS[ @"D@z`(_bzgezdfzhT_TT%_dzdfzcT  @fzcT`ze*T@ _fzeTT_@@dzdfzcT`zeKT  T MT8T_T#@z %_@CA !A!zaCA"@@BC8"_"TSA[BcC{Ĩ#_  ?#{@{#A@!{#_  ?#{@{#A@!˶{#_  ?#{ @ a@!˧   @{¨#_ ?`T?#{S [c?T @t@@xt xcJTb_ T`s"TSA[BcC{Ĩ#_d_c"ѡxd*T dd_'@xdKTTc_?#{c$@kRs3CG@ !TGA@BA\TC*cCkDsE3@{Ǩ#_|tqA /T@/ TgB_ Tzb aG `!R*49@ @!AAAAAAAA/@?hUT/@!G}O8R?HTT!G4};6R#?|!#a`=TT;@" R2@;@RO@RR;s{/@w@F}WAFD@!}?3SRj F}[|!F%@!}C7_cRL;@ e;@c#@kAT;@'" R:'@k@Rc@/@"K!KC$š$"!gg Aa{  T@'T?@R 3@CD@G@ @ @?`$TC@R7@CD@K@ @  T T/ 1 ՟@!@FAD*a "@""š!&}{dg`{a{`az``xb(`8e8c aT0 b T bTz`Ba!?T@ h` T`{e}@z`_D!@!FD*!`! ""š @f{pfk% _TD@`(T!Gw}TRB c@-T@T @}}ӵT @?Tc aT@/7Z@c T@@/@@aTI"@`@`z `z ;@`[@]W@ZW@@!R;@NKHO@E*{w@0(b{7F"zb?@Tx`{`azaA8a(a{ AT0 F""{b?Taz`{`A8a8a{  T Հzrz2x`x ATT@?lTB/@`x x`x kTR7@ @K@ 3@`@G@o?2@}˹C TG?`T?T"R@T Cx!?!TR%CBKB|a@?@T @@@T"_ _gxbexji mT_'@exbKT! Th`@bxah @Ah TR"@@GAA@ҁTKGAA@T?6GAA@T.GAA@aT"$@AA@ҁTL$!Gq$!GYWe$!G$S@jGeC$^G$!G$$_@-S@K$!G?#cG{S[cb@cB 4cЀR@S@"@3A@?$RRR`? @_q T@@@X@R @;R(tAҕR!R? @RR @R!RuA? @ @q$ @<1T1 T`"b@ 7Bbbz"@7B"@7!сSDcF;@G! @a`@7`@SDcFG@@B T{C[E#_N`@7` ;@EBSDcF;@b@Ң6 @@7 4SDcF;@SDcF;@G!!@:b@b6 @7 `G! @)`@ 6G!@!@ b@7ҊSc;?#{" S!#@7!сaa@G?Ta@7!a @3R r?kT@LC?0qT@HC? 4qTSA{¨#`~R@G!@#@`@7`SAG!`,@{¨#_SA@G!@@ ?**!`$SA@G!LC@ ?*!%RSAG!+@SAG!@*@SAG!#@SA {{_vector::_M_default_appendcannot create std::vector larger than max_size()O|pexpected a matrix (2-D array), got a %d arrayinvalid cost matrix objectcost matrix is infeasiblematrix contains invalid numeric entriesOOnumpy.core._multiarray_umath_ARRAY_API_ARRAY_API is not PyCapsule object_ARRAY_API is NULL pointermodule compiled against ABI version 0x%x but this version of numpy is 0x%xmodule compiled against API version 0x%x but this version of numpy is 0x%x . Check the section C-API incompatibility at the Troubleshooting ImportError section at https://numpy.org/devdocs/user/troubleshooting-importerror.html#c-api-incompatibility for indications on how to solve this problem .FATAL: module compiled as unknown endianFATAL: module compiled as little endian, but detected different endianness at runtimenumpy.core.multiarray failed to importlinear_sum_assignmentSolve the linear sum assignment problem. Parameters ---------- cost_matrix : array The cost matrix of the bipartite graph. maximize : bool (default: False) Calculates a maximum weight matching if true. Returns ------- row_ind, col_ind : array An array of row indices and one of corresponding column indices giving the optimal assignment. The cost of the assignment can be computed as ``cost_matrix[row_ind, col_ind].sum()``. The row indices will be sorted; in the case of a square cost matrix they will be equal to ``numpy.arange(cost_matrix.shape[0])``. See Also -------- scipy.sparse.csgraph.min_weight_full_bipartite_matching : for sparse inputs Notes ----- The linear sum assignment problem [1]_ is also known as minimum weight matching in bipartite graphs. A problem instance is described by a matrix C, where each C[i,j] is the cost of matching vertex i of the first partite set (a 'worker') and vertex j of the second set (a 'job'). The goal is to find a complete assignment of workers to jobs of minimal cost. Formally, let X be a boolean matrix where :math:`X[i,j] = 1` iff row i is assigned to column j. Then the optimal assignment has cost .. math:: \min \sum_i \sum_j C_{i,j} X_{i,j} where, in the case where the matrix X is square, each row is assigned to exactly one column, and each column to exactly one row. This function can also solve a generalization of the classic assignment problem where the cost matrix is rectangular. If it has more rows than columns, then not every row needs to be assigned to a column, and vice versa. This implementation is a modified Jonker-Volgenant algorithm with no initialization, described in ref. [2]_. .. versionadded:: 0.17.0 References ---------- .. [1] https://en.wikipedia.org/wiki/Assignment_problem .. [2] DF Crouse. On implementing 2D rectangular assignment algorithms. *IEEE Transactions on Aerospace and Electronic Systems*, 52(4):1679-1696, August 2016, :doi:`10.1109/TAES.2016.140952` Examples -------- >>> import numpy as np >>> cost = np.array([[4, 1, 3], [2, 0, 5], [3, 2, 2]]) >>> from scipy.optimize import linear_sum_assignment >>> row_ind, col_ind = linear_sum_assignment(cost) >>> col_ind array([1, 0, 2]) >>> cost[row_ind, col_ind].sum() 5 _lsapSolves the rectangular linear sum assignment.cost_matrixmaximize;p \lT<80XzRx  0,(< @THA BNd(|x<B-Au A-A SA-8A-A@BECqABA-(`8A-AE A-C AA-(t8A-AE A-C AA-$<LA-A BMA-DdC-A@BBB^ A-A R-zPLRx x @ wA-Ap FDHQ pFHA-A C B B B ] AAAA A AAAA A A A A DtA-AD NCD[@AAALALA-A -ICC AAA K AAA A AAA QIJAAA`PHA-A Fm BA-D SHA-B -C A M A M A G A G A GT H 'o0 e  x oooo  x44@4H4@@+!X+/usr/lib/debug/.dwz/aarch64-linux-gnu/python3-scipy.debug~\-ׇ!1\I!6285d1f4d63c7ba81f7ac08ff348f2f04dcf92.debug\ .shstrtab.note.gnu.build-id.gnu.hash.dynsym.dynstr.gnu.version.gnu.version_r.rela.dyn.rela.plt.init.text.fini.rodata.eh_frame_hdr.eh_frame.gcc_except_table.init_array.fini_array.dynamic.got.got.plt.data.bss.gnu_debugaltlink.gnu_debuglink $o$( 000e8oBEoTxx^B h c pn|t''z2'' 44t55LT8T8XXN4