In the Dijkstra algorithm, how to calculate intermediate distance values of all the nodes at each iteration?
a) Using matrix multiplication
b) Performing depth-first search
c) Employing dynamic programming
d) Utilizing priority queues