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.
展开▼
