ó ŸÙrZc@ sˆddlmZmZddlmZddlmZdeƒkrNeZ nd„Z d„Z d„Z d„Z d e d d „Zd S( iÿÿÿÿ(tprint_functiontdivision(tislice(tarraytxrangec  sÅt|ƒ}t||ƒ‰‡‡fd†}d}d}xt|dƒD]m}|d}xZt|d|dƒD]A} | d} |||ƒ|| | ƒ||| ƒ||| ƒ} | dkrr|| 7}|d7}|ˆ|jˆ|ƒ|ˆ|jˆ| ƒ|ˆ|jˆ|ƒ|ˆ|jˆ| ƒ|ˆ| jˆ| ƒ|ˆ| jˆ|ƒ|ˆ| jˆ| ƒ|ˆ| jˆ|ƒt||ƒˆ(qrqrWqJW||fS(s9Tries to optimize solution, found by the greedy algorithmc s<ˆ|}ˆ|}||kr,ˆ||Sˆ||SdS(N((titjtpitpj(t distancestpath(sI/home/guillaumes/Documents/class/ing2/s4/ml/opti/tsp/tsp_solver/greedy.pytdss     giii(tlent restore_pathRtremovetappend( R t connectionst endpointstNR td_totalt optimizationstatbtctdtdelta_d((R R sI/home/guillaumes/Documents/class/ing2/s4/ml/opti/tsp/tsp_solver/greedy.pytoptimize_solutions.   6   c C sÕ|dkrLgt|ƒD]$\}}t|ƒdkr|^q\}}n |\}}|g}d}|}xatrÐg||D]} | |kr| ^q} | s©Pn| d} |j| ƒ|| }}qpW|S(sáTakes array of connections and returns a path. Connections is array of lists with 1 or 2 elements. These elements are indices of teh vertices, connected to this vertex Guarantees that first index < last index iiN(tNonet enumerateR tTrueR( RRtidxtconntstarttendR t prev_pointt cur_pointtpntt next_pointst next_point((sI/home/guillaumes/Documents/class/ing2/s4/ml/opti/tsp/tsp_solver/greedy.pyR 3s" '     cC sNxGt|ƒD]9\}}t|ƒ|kr tdjtƒƒ‚q q WdS(s4Ensure that matrix is left-triangular at least. sXDistance matrix must be left-triangular at least. Row {row} must have at least {i} itemsN(RR t ValueErrortformattlocals(R Rtrow((sI/home/guillaumes/Documents/class/ing2/s4/ml/opti/tsp/tsp_solver/greedy.pyt_assert_triangularMsc sdg}x>t|ƒD]0}x't|ƒD]}|j||fƒq&WqW|jd‡fd†ƒ|S(sLreturns list of coordinate pairs (i,j), sorted by distances; such that i < jtkeyc sˆ|d|dS(Nii((tij(R (sI/home/guillaumes/Documents/class/ing2/s4/ml/opti/tsp/tsp_solver/greedy.pyt\s(RRtsort(RR tindicesRR((R sI/home/guillaumes/Documents/class/ing2/s4/ml/opti/tsp/tsp_solver/greedy.pyt pairs_by_distTs ic  s8t|ƒ‰ˆdkrgSˆdkr/dgSt|ƒtddgƒˆ‰ˆdk r™ˆ\‰‰ˆˆkr‚tdƒ‚ndˆˆs  #