Distribution Algorithm

Problem 1.3 * Reachable Configuration (4 points) Configuration d is reachable if it is reachable from an initial configuration. To check whether each state is reachable naively we need to send a query for each (S, D), i.e., every pair source- destination. However, an obvious reason for the limited efficiency of this approach, is that this approach does not exploit the assumption that not all pairs in S xD are reachable. Consequently, this approach can also not reuse any intermediate computations and thus likely performs many redundant computations. Briefly propose an alternative algorithm to check for reachability more efficiently. The answer does not need to describe the algorithm to the smallest details. Problem 1.3 * Reachable Configuration (4 points) Configuration d is reachable if it is reachable from an initial configuration. To check whether each state is reachable naively we need to send a query for each (S, D), i.e., every pair source- destination. However, an obvious reason for the limited efficiency of this approach, is that this approach does not exploit the assumption that not all pairs in S xD are reachable. Consequently, this approach can also not reuse any intermediate computations and thus likely performs many redundant computations. Briefly propose an alternative algorithm to check for reachability more efficiently. The answer does not need to describe the algorithm to the smallest details