Algorithms in C, Part 5: Graph Algorithms
- Exclusive ContentScan the cover in the app
- CommunityDiscuss & Share
About this book
This volume is the fifth part of Robert Sedgewick's Algorithms in C series, revised for its third edition and focused entirely on graphs. Graphs model many practical problems, from how networks stay connected to how circuits are laid out, how jobs get scheduled, how transactions are processed, and how scarce resources are distributed. The book pairs explanations of the underlying theory with short C implementations that readers can run and test against real-world examples.
The material opens with a thorough look at graph properties and the different kinds of graphs, then moves into directed graphs and directed acyclic graphs. Later sections cover minimum spanning trees, shortest-path algorithms, and network flow. Each topic comes with diagrams, sample code, and step-by-step algorithm descriptions.
The programs are organized around abstract data types, which makes them easier to reuse in modern object-oriented software. The revised edition adds new algorithms, clearer descriptions, and many new exercises. It is aimed at programmers and students who want working tools for building and debugging graph-based software. Sedgewick is a computer science professor at Princeton University, and additional source code and teaching materials are available on his website.
Reader reviews
No reviews yet. Share your thoughts on this book in the Appilog app.
Book Details
- ISBN
- 9780201316636
- Author
- Robert Sedgewick
- Publisher
- Addison-Wesley Professional
- Genres
- Technology & Computing
Media & Extras
This book has 0 videos that play on its cover. Scan the cover with the Appilog app to watch.
Get the app




