Computer Networks

5.6 Consider the following network. With the indicated link costs, use Dijkstra's shortest- path algorithm to compute the shortest path from x to all network nodes. Show how the algorithm works by computing a table similar to the textbook example. In cases when several candidate nodes have the same minimal costs, choose a node according to non decreasing alphabetical order. 4 2. 4