How to find shortest path length by adjacency matrix?

If I have adjacency matrix(i.e matrix that represent connection between nodes in a network) , i want to get matrix that its (i,j) represent the minimum number of steps from i node to j node giving adjacency matrix.

Thanks.

Answer 1

[Matt J]

Use the adjacency matrix A to create a graph object, and then use the distances() command.

https://www.mathworks.com/help/matlab/ref/graph.distances.html

distanceMatrix=distances(graph(A))