Shortest paths in regular grids
J.J. Narraway · IEE Proceedings - Circuits Devices and Systems · 1998
Explicit expressions are obtained for the number of shortest-length paths between pairs of vertices in square grids, triangular grids and hexagonal grids. Occurrence probabilities are given for vertices and edges in randomly selected shortest paths.