Algorithms in C, Part 5: Graph Algorithms, Third Edition

References for Part Five

The algorithms textbooks listed below cover most of the basic graph-processing algorithms in Chapters 17 through 21. These books are basic references that give careful treatments of fundamental and advanced graph algorithms, with extensive references to the recent literature. The book by Even and the monograph by Tarjan are devoted to thorough coverage of many of the same topics that we have discussed. Tarjan’s original paper on the application of depth-first search to solve strong connectivity and other problems merits further study. The source-queue topological sort implementation in Chapter 19 is from Knuth’s book. Original references for some of the other specific algorithms that we have covered are listed below. ...