![Algorithms in Java, Part 5: Graph Algorithms (3rd Edition) (Pt.5) by Robert Sedgewick [Repost]](https://pixhost.icu/avaxhome/76/13/001b1376_medium.jpeg)
Algorithms in Java, Part 5: Graph Algorithms (3rd Edition) (Pt.5) by Robert Sedgewick [Repost]
![Algorithms in Java, Part 5: Graph Algorithms (3rd Edition) (Pt.5) by Robert Sedgewick [Repost]](https://pixhost.icu/avaxhome/76/13/001b1376.jpeg)
Algorithms in Java, Part 5: Graph Algorithms (3rd Edition) (Pt.5) by Robert Sedgewick
English | July 25, 2003 | ISBN: 0201361213 | 528 Pages | CHM | 10 MB
English | July 25, 2003 | ISBN: 0201361213 | 528 Pages | CHM | 10 MB
Algorithms in Java, Third Edition, Part 5: Graph Algorithms, contains six chapters that cover graph properties and types, graph search, directed graphs, minimal spanning trees, shortest paths, and networks. The descriptions here are intended to give students an understanding of the basic properties of as broad a range of fundamental graph algorithms as possible. In the third edition, many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions.