MadeEasy Test Series: Computer Networks - Distance Vector Routing

Question

Comments

Yes, there is a shortcut.

Take each Edge (Not node ) and see there is an Alternative better path available for that edge or not. If available then mark that otherwise mark chosen Edge.Finally, count the Unmarked Edge.

---

for each node check each of its neighbour if you get any other shorter path for that neighbour node rather than the adjacent edge .You can remove that edge .

Here the answer will  be 3

AG

GC

EF

---

I think it will be

BC

GC

EF

Answer 1

the answer is 2 paths- BC, CG only are unused

Answer 2

BC , GC , EF = 3