13. In the synchronous distributed Bellman-Ford algorithm in Figure 5.10, the termination condition for the algorithm assumed

Question:

13. In the synchronous distributed Bellman-Ford algorithm in Figure 5.10, the termination condition for the algorithm assumed that each process knew the number of nodes in the graph.

If this number is not known, what can be done to find it?

Step by Step Answer:

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