Chapter 22 : Elementary Graph Algorithms

I quickly browse this chapter and turns out to be highly useful.  Now I learned the basic of another highly used graph representation : adjacency list.  

I also thought through some problems.   What it bugs me now is that I don't fully grok basic things such as BFS, DFS and topological sort is - I guess that makes sense, when I learn those things, they are all presented in the context of AI or machine learning.  It is hard that those presentations are very fundamental. 

What it fascinates me now is how generic of these methods and what they can achieve - that is way more interesting than AI or machine learning.