The schedule will be updated a fair bit, given that this is the first time we are trying to teach graph algorithms as part of this course. Please bookmark this and reload on at least a weekly basis.
The required textbook for the formal languages/automata theory part will be Sipser. For the other material I will be drawing from a few different texts.
For the graph algorithms section we will stick mostly to this book Algorithms Unlocked by Thomas Cormen. However it does not have any section on spanning trees.