Answer:The packet will take a shorter path through networks 2 and 4, but networks 1, 3, and 5 might be faster at forwarding packets than 2 and 4. These are the kinds of choices network routers constantly make.What is shortest path routing in computer networks?
The goal of shortest path routing is to find a path between two nodes that has the lowest total cost, where the total cost of a path is the sum of arc costs in that path. For example, Dijikstra uses the nodes labelling with its distance from the source node along the better-known route.
Explanation:
