First update:

Link-State - Node U

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

Recieved Link-State of Node V

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

Least-Cost Paths of U

D(U) = min(D(U) , [cost(U, V)] + D(V))

Node	U	V	X	Y	Z

Second update:

Least-Cost Paths of U

Node	U	V	X	Y	Z
Cost/Path	-	5/U	2/U	6/V	10/V

Link-State - Node U

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

Recieved Link-state of node X

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

Updated Least-Cost Paths of U

D(U) = min(D(U) , [cost(U, V)] + D(V))

Node	U	V	X	Y	Z

Third update:

Least-Cost Paths of U

Node	U	V	X	Y	Z
Cost/Path	-	5/U	2/U	3/X	10/V

Link-State - Node U

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

Recieved Link-state of node Y

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

Updated Least-Cost Paths of U

D(U) = min(D(U) , [cost(U, V)] + D(V))

Node	U	V	X	Y	Z

Fourth update:

Least-Cost Paths of U

Node	U	V	X	Y	Z
Cost/Path	-	5/U	2/U	3/X	10/V

Link-State - Node U

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

Recieved Link-state of node Z

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

Updated Least-Cost Paths of U

D(U) = min(D(U) , [cost(U, V)] + D(V))

Node	U	V	X	Y	Z