3rd ed. — Addison-Weasley Professional, 2001. — 550 p. — ISBN: 9780768685329.
A complete overview of graph properties and types.
Diagraphs and DAGs.
Minimum spanning trees.
Shortest paths.
Network flows.
Diagrams, sample C code, and detailed algorithm descriptions.