Consider the following network With the indicated link costs

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 step by step. Also, provide the forwarding table for node x.

Solution

Explanation:In first row,we find distance of other nodes from node x.Those are not not connected we set it to infinity.After that we select minimum distance from row and take that vertex and consider it next itearation.hence x->v

After in next row,we calculate distance of other nodes from x considering we travel through v.Again we select minimum path and add it to solution.Above steps are reapeted until we visit all nodes.Thus after full traversal we get shortest path as x->v->u->w->y->t->z

Step	N\'	D(t),p(t)	D(u),p(u)	D(v),p(v)	D(w),p(w)	D(y),p(y)	D(z),p(z)
0	x			3,x	6,x	6,x	8,x
1	xv	7,v	6,v	3,x	6,x	6,x	8,x
2	xvu	7,v	6,v	3,x	6,x	6,x	8,x
3	xvuw	7,v	6,v	3,x	6,x	6,x	8,x
4	xvuwy	7,v	6,v	3,x	6,x	6,x	8,x
5	xvuwyt	7,v	6,v	3,x	6,x	6,x	8,x
6	xvuwytz	7,v	6,v	3,x	6,x	6,x	8,x