The text is clear. Lots of contents overlap with undergrad courses, such as DAG, trees, algorithms for shortest paths, minimum spanning trees, Euler path, Hamiltonian cycles, Sets and covers, bipartite matching, maximum network flow, graph coloring problems.
Not all contents are relevant so I skip-read, and use it as a reference book to look up graph concepts that can be applied to causal graphs.