Status Updates From Algorithms Unlocked

Great description of Dijkstra's algorithm in terms of runners leaving nodes, with the time expressed as edge weights; it really gives a concrete feel as to why pred[v] is sets it is. I also appreciate how succinctly Cormen specifies the problem space to which each algorithm applies.

Very straightforward and accessible so far; I'm especially wanting to review the concepts presented in chapters 5, 6, 8, and 10! This is a great review for those in computer science, and a fairly gentle introduction to such a core concept in computing.