Using the A* Algorithm and Simulated Annealing Algorithm, find the shortest path for the dataset. Note that the solutions should contain nodes that have been visited only once and every node should be visited. This question we are trying to solve here is a travelling salesman problem (TSP). For the algorithm an arbitrary starting and ending node will have to be chosen. Using A* algorithm, there should be a python A* that will read the matrix and will finally display the best solution.

The dataset is as follows: (a 5x5 matrix)

[0.0, 3.0, 4.0, 2.0, 7.0]

[3.0, 0.0, 4.0, 6.0, 3.0]

[4.0, 4.0, 0.0, 5.0, 8.0]

[2.0, 6.0, 5.0, 0.0, 6.0]

[7.0, 3.0, 8.0, 6.0, 0.0]

This question was answered by an expert and a code was provided, on checking out the code, the output is not matching the one I got when solved on paper, the answer on paper was 15. Please help and enormous thanks for the previous help.