If I remember correctly, Dijkstra’s algorithm was the very first graph algorithm they taught us in Discrete mathematics lectures.

And I think there are many reasons to why it is a good starting point.

• finite graph traversal is a key technique