directed unweighted graphs C

Question

I'm planning to write a program in C that builds the adjacency list, performs the depth first search, performs the breadth first search, and performs the topological sort.
Where can I get some info about this subject in C?
Any help is appreciated

Answer 1

If you don't have a good algorithms textbook, I'd recommend getting a copy of Robert Sedgewick's Algorithms in C, Part 5: Graph Algorithms.

I own the C++ and Java versions of the book, and both are very good. I do not own the C version of the book, so it might be atrocious (I doubt it; it's probably very good too).

The Parts 1-4 book is a good algorithms reference book as well; the material is presented very clearly.

Answer 2

Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein is a classic. However, it does not have a specific language approach.

Data Structures In C by Noel Kalicharan if you want a C approach.