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.