I was reading about TSP problem in general & about Hungarian method in particular, and found a 6x6 matrix, where applying Hungarian method didn't give me an answer (solved by hand & checked on 2 math websites [1] [2]).
\begin{bmatrix}0&6&5&2&1&5\\10&0&6&11&3&5\\1&10&0&12&15&1\\2&12&4&0&5&6\\7&8&3&5&0&3\\2&12&10&10&5&0\end{bmatrix}
That's why i'm wondering, which requirements should a TSP matrix fulfill in order to be solved by Hungarian method (except having a Hamiltonian cycle).
I would be very grateful, if you could explain it to me.
Thank you in advance!