I can highly reccomend the book “mazes for programmers” which introduces a lot of graph related alorithms in a clear, accessible way. Dijkstra’s algorithm is on page 36 and explained in 8 paragrpahs. https://media.pragprog.com/titles/jbmaze/first.pdf
bad taste, you give a link to 10 page version and tell people to look at p. 36
Ah, ah ha. Hah. My bad.