Algorithms in Java Graph Algorithms

ISBN-10: 0201361213

ISBN-13: 9780201361216

Edition: 3rd 2004 (Revised)

Authors: Robert Sedgewick

List price: $59.99
eBook available
30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy


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 solid scientific foundations. And a new emphasis on abstract data types throughout the books makes the programs more broadly useful and relevant in modern object-oriented programming environments. This book is useful as a text early in the computer science curriculum, after students have acquired basic programming skills and familiarity with computer systems, but before they have taken specialized courses in advanced areas of computer science or computer applications. There is sufficient coverage of basic material for the book to be used to teach data structures to beginners, and there is sufficient detail and coverage of advanced material for the book to be used to teach the design and analysis of algorithms to upper-level students. Some instructors may wish to emphasize implementations and practical concerns; others may wish to emphasize analysis and theoretical concepts. For a more comprehensive course, this book is also available in a special bundle with Parts 1-4 (ISBN for bundle of Parts 1-4 and Part 5 is 0201775786); thereby instructors can cover fundamentals, data structures, sorting, searching, and graph algorithms in one consistent style.
eBooks Starting from $47.99
Buy eBooks
what's this?
Rush Rewards U
Members Receive:
You have reached 400 XP and carrot coins. That is the daily max!
Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Calculus 1 Online content $4.95 $1.99
Add to cart
Study Briefs
SQL Online content $4.95 $1.99
Add to cart
Study Briefs
MS Excel® 2010 Online content $4.95 $1.99
Add to cart
Study Briefs
MS Word® 2010 Online content $4.95 $1.99
Customers also bought

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.70" wide x 8.90" long x 1.10" tall
Weight: 0.990
Language: English

Graph Algorithms
Graph Properties and Types
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
Topological Sorting
Reachability in DAGs
Strong Components in Digraphs
Transitive Closure Revisited
Minimum Spanning Trees
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
Negative Weights
Network Flow
Flow Networks
Augmenting-Path Maxflow Algorithms
Preflow-Push Maxflow Algorithms
Maxflow Reductions
Mincost Flows
Network Simplex Algorithm
Mincost-Flow Reductions
References for Part Five
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.