Link State Routing

Question

Why do we use Dijkstra algorithm in Link State Routing Protocol? I understand that it is essential to compute the shortest path to every other node, but is Dijkstra algorithm run for each system in the graph and does each node have its own Shortest Path Tree?

Comments

Dijkstra algorithm first chooses the shortest distant node from start, then calculate distance of each of adjacent nodes choose shortest among them or, update if less distant found.

And, since LSR is generally used in large network Dijkstra works faster here to find shortest path.

---

what do u want to say from shortest path tree??