How to create a graph with X:Y coordinates and values and then find the shortest path?

I have array with X:Y coordinates(400k), and i have another array of values for each pair of X:Y. Then i plotted points on the map with their values(in attach). I need to create graph with these points and find the shortest path from one random point to another point. Are there any ways to solve this problem without using adjacency matrix? Or how can i get this matrix?

[Image Analyst]

On your image, I don't know what are the points that you plotted.

Can we assume the points are on a planar surface, or do you need to consider them as latitude and longitude on a 3-D map of the earth (a globe)?

A wild guess - have you tried pdist2() or looked up the traveling salesman problem?

Please attach the data that has the two sets of coordinates. Do you need to find the distance of each point in set 1 to the corresponding point in set 2, or do you need to find distances of all points in set 1 to all points in set 2 (which is what pdist2() does).

[Vlad Bibikov]

I have 416609x1 var for Y coordinate and i have 416609x1 var for Y coordinate. I plotted these points. Also i have 416609x1 var with values for each. Points colored according to their values. Min value 0, max 20. For example, points with 0 are blue on the map, red ones with 20. I need to find a shortest way from one point to other point on the map. I attached example of x,y and values arrays

[Chad Greene]

There is some confusion because this looks like gridded data. It is unclear why you would want to find the shortest path between gridded data.

Regardless of whether or not the data are gridded, the text of your question suggests that you are talking about a traveling salesman problem. Google that phrase and you may be able to find the solution you're looking for. I know several solutions exist for it on the File Exchange.