Question 186
Let $E=\{-1,0,1\}$ and $M$ be a set of grid points of the plane. The points in $M$ are connected by a route network $(S)$ in such a way that you can get from any point in $M$ to any other point in $M$ without leaving $(S)$. The routes of the route network can also contain other end points in addition to the grid points.
Determine the shortest total length of the route network if:
a) $M=\{(i, j) \mid i, j \in E$ and $i \cdot j=0\}$
b) $M=\{(i, j) \mid i, j \in E\}$
Determine the shortest total length of the route network if:
a) $M=\{(i, j) \mid i, j \in E$ and $i \cdot j=0\}$
b) $M=\{(i, j) \mid i, j \in E\}$