Algorithms in Java Graph Algorithms

Name: Algorithms in Java Graph Algorithms
Price: 6.75 USD
Availability: InStock
ISBN: 9780201361216

ISBN-10: 0201361213

ISBN-13: 9780201361216

Edition: 3rd 2004 (Revised)

Authors: Robert Sedgewick

List price: $59.99

30 day, 100% satisfaction guarantee!

Marketplace

2 new & used from $6.75

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

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. Unlike any other book on algorithms, not only will students get practical information on using algorithms in their work, they can also be assured that these algorithms rest on the most…

Book details

List price: $59.99
Edition: 3rd
Copyright year: 2004
Publisher: Addison Wesley Professional
Publication date: 7/15/2003
Binding: Paperback
Pages: 528
Size: 7.75" wide x 9.00" long x 1.00" tall
Weight: 1.782
Language: English



Graph Algorithms



Graph Properties and Types



Glossary



Graph ADT



Adjacency-Matrix Representation



Adjacency-Lists Representation



Variations, Extensions, and Costs



Graph Generators



Simple, Euler, and Hamilton Paths



Graph-Processing Problems



Graph Search



Exploring a Maze



Depth-First Search



Graph-Search ADT Methods



Properties of DFS Forests



DFS Algorithms



Separability and Biconnectivity



Breadth-First Search



Generalized Graph Search



Analysis of Graph Algorithms



Digraphs and DAGs



Glossary and Rules of the Game



Anatomy of DFS in Digraphs



Reachability and Transitive Closure



Equivalence Relations and Partial Orders



DAGs



Topological Sorting



Reachability in DAGs



Strong Components in Digraphs



Transitive Closure Revisited



Perspective



Minimum Spanning Trees



Representations



Underlying Principles of MST Algorithms



Prim's Algorithm and Priority-First Search



Kruskal's Algorithm



Boruvka's Algorithm



Comparisons and Improvements



Euclidean MST



Shortest Paths



Underlying Principles



Dijkstra's Algorithm



All-Pairs Shortest Paths



Shortest Paths in Acyclic Networks



Euclidean Networks



Reduction



Negative Weights



Perspective



Network Flow



Flow Networks



Augmenting-Path Maxflow Algorithms



Preflow-Push Maxflow Algorithms



Maxflow Reductions



Mincost Flows



Network Simplex Algorithm



Mincost-Flow Reductions



Perspective


References for Part Five


Index