how to realize a* or best first search in 2d matrix?

Hello, i have a random n*n matrix and i need to find path from one point to another using a* or BFS. You can move only up/down and left/right

For example [ 6 9 6 8;

8 6 3 9;

9 2 6 1 ]

We start from (1;1) to (3;4) and the way is gonna be like 6 - 8 - 6 - 2 - 6 - 1 and the distance will be 6+8+6+2+6+1=29

Answer 1

[Shubham Rawat]

Hi Vlad,

You may use this link for the BFS using Adjacency matrix:

Implementing Breadth first search using connectivity matriX - MATLAB Answers - MATLAB Central (mathworks.com)

Hope this Helps!