The construction of a geographic accessibility matrix, A(G), is a rather simple undertaking:
- Build the valued graph matrix (L). The above L-matrix shows the shortest distance in kilometers between five nodes (Node A to Node E).
- Build the geographic accessibility matrix A(G). The A(G) matrix is similar to the L-matrix expect that the summation of rows and columns is divided by the number of locations in the network. The summation values are the same for columns and rows since this is a transposable matrix. The most accessible place is Node C, since it has the lowest summation of distances.