Yes, Dijkstra’s algorithm is a greedy algorithm. It makes the optimal choice at each step by selecting the nearest node not yet processed.