Algorithms in Java, Part 5: Graph Algorithms
Publisher: Addison-Wesley Professional | ISBN: 0201361213 | edition 2003 | CHM | 528 pages | 4,2 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.