title: MATLAB - efficient way of computing distances between points in a graph/network using the adjacency matrix and coordinates
body: <p>I have the network representation in a 2D coordinate space. I have an adjacency matrix <code>Adj</code>(which is sparse) and a <code>coordinate</code> matrix with the x,y values of all the points/nodes/vertices in the graph which are drawn. </p>
  
  <p>I would like to compute as efficiently as possible the distance between these points. I would like to avoid cycling through the entries in the matrix and computing the pairwise distances one by one. </p>