$\begin{bmatrix} 0& 29& 19& 25& 22\\ 20& 0& 21& 23& 21\\ 19& 21& 0& 21& 20\\ 25& 23& 21& 0& 32\\ 22& 21& 20& 22& 0 \end{bmatrix}$
Find the shortest tour for given graph using greedy approach.
\\It is Weighted Adjacency Matrix
\\It is directed graph as forward /backward distances are not same.
But how to solve using Greedy Approach using TravelSalesman Problem(TSP) ?