1,615 views
1 votes
1 votes

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

1 Answer

Best answer
3 votes
3 votes

First of all go through the definition of tour 

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

selected by

Related questions

3 votes
3 votes
3 answers
1
firki lama asked Jan 12, 2017
13,312 views
i know time complexity is O(nlogn) but can upper bound given in question consider as TRUE..
0 votes
0 votes
0 answers
3
LavTheRawkstar asked Mar 26, 2017
412 views
Calculate the shortest path using TSP Greedy Appraoch
1 votes
1 votes
1 answer
4
amrit22 asked Sep 24, 2023
627 views
consider the following message BCCABBDDAECCBBAEDDCC find the no of bits requiered for huffman encoding of above message