Find the shortest tour for given graph using greedy approach

Question

$\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) ?

Comments

@lavtherawkstar,technique used is Greedy,so why are u taking edges with maximum weights..take edges with min weights. after visiting each node,get back to origin

---

mam weight is not given
distance is given from one city to another

---

we will consider all the travelling distances and then using NN or SE approach try to solve the TSP using greedy method

Answer 1

First of all go through the definition of tour 

http://www.algorithmist.com/index.php/Graph_Theory_-_basic_definitions

Comments

so,we dun need to get back to origin??

---

Yes no need. From start to end each node must be visited only once.