First update:

Link-State - Node U

Node	U	V	W	X	Y	Z
Distance	-	2	5	1	INF	INF

Recieved Link-State of Node X

Node	U	V	W	X	Y	Z
Distance	1	2	3	-	1	INF

Least-Cost Paths of U

D(A) = min(D(A) , [cost(A, B)] + D(B))

Node	U	V	W	X	Y	Z
Cost/Path	-	2/U	4/X	1/U	/	INF

Second update:

Least-Cost Paths of U

Node	U	V	W	X	Y	Z
Cost/Path	-	2/U	4/X	1/U	2/X	INF

Link-State - Node U

Node	U	V	W	X	Y	Z
Distance	-	2	5	1	INF	INF

Recieved Link-state of node Y

Node	U	V	W	X	Y	Z
Distance	INF	INF	1	1	-	2

Updated Least-Cost Paths of U

D(A) = min(D(A) , [cost(A, B)] + D(B))

Node	U	V	W	X	Y	Z
Cost/Path	-	2/U	3/	1/U	2/X	/Y

Third update:

Least-Cost Paths of U

Node	U	V	W	X	Y	Z
Cost/Path	-	2/U	3/Y	1/U	2/X	4/Y

Link-State - Node U

Node	U	V	W	X	Y	Z
Distance	-	2	5	1	INF	INF

Recieved Link-state of node V

Node	U	V	W	X	Y	Z
Distance	2	-	3	2	INF	INF

Updated Least-Cost Paths of U

D(A) = min(D(A) , [cost(A, B)] + D(B))

Node	U	V	W	X	Y	Z
Cost/Path	-	2/U	3/Y	/U	2/X	4/Y

NOTE: No change in Costs after receiving this packet from W

Fourth update:

Least-Cost Paths of U

Node	U	V	W	X	Y	Z
Cost/Path	-	2/U	3/Y	1/U	2/X	4/Y

Link-State - Node U

Node	U	V	W	X	Y	Z
Distance	-	2	5	1	INF	INF

Recieved Link-state of node W

Node	U	V	W	X	Y	Z
Distance	5	3	-	3	1	5

Updated Least-Cost Paths of U

D(A) = min(D(A) , [cost(A, B)] + D(B))

Node	U	V	W	X	Y	Z
Cost/Path	-	2/U	3/Y	1/U	2/X	4/Y

NOTE: No change in Costs after receiving this packet from W

Recieved Link-state of node Z

Node	U	V	W	X	Y	Z
Distance	INF	INF	5	INF	2	-

Updated Least-Cost Paths of U

D(A) = min(D(A) , [cost(A, B)] + D(B))

Node	U	V	W	X	Y	Z
Cost/Path	-	2/U	3/Y	1/U	2/	4/Y