Please explain VERY DETAILED this question After running Dijkstra's algorithm in a link state protocol, a router X determines that the predecessor of A is Y, the predecessor of Z is X, and the...

Please explain VERY DETAILED this question

After running Dijkstra's algorithm in a link state protocol, a router X
determines that the predecessor of A is Y, the predecessor of Z is X, and the
predecessor of Y is Z. What is the path from X to A?

Ans: X->Z->Y->A