Consider a 2-d mesh with faulty blocks, assuming that node (0, 0) is the source and node

Question:

Consider a 2-d mesh with faulty blocks, assuming that node (0, 0) is the source and node (i, j) is the destination. Prove that if there is no faulty block that goes across the X and Y axes, then there exists at least one minimal path from (0, 0), i.e., the length of this path is |i| + |j|.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: