Algorithms In Java Graph Algorithms

Afbeeldingen

Artikel vergelijken

  • Engels
  • Paperback
  • 9780201361216
  • 15 juli 2003
  • 497 pagina's
Alle productspecificaties

Samenvatting

Provides an introduction to important algorithms. This work focuses on graph algorithms, which are critical for a range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. It offers theory and practice, and addresses fundamental algorithms, data structures, sorting, and more.

Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In this book, Sedgewick offers the same successful blend of theory and practice that has made his work popular with programmers for many years. Michael Schidlowsky and Sedgewick have developed concise new Java implementations that both express the methods in a natural and direct manner and also can be used in real applications. Algorithms in Java, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick's thoroughly revised and rewritten series. The first book, Parts 1-4, addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book's expanded coverage features new algorithms and implementations, enhanced descriptions and diagrams, and a wealth of new exercises for polishing skills. The natural match between Java classes and abstract data type (ADT) implementations makes the code more broadly useful and relevant for the modern object-oriented programming environment. The Web site for this book (www.cs.princeton.edu/~rs/) provides additional source code for programmers along with a variety of academic support materials for educators. Coverage includes: A complete overview of graph properties and types Diagraphs and DAGs Minimum spanning trees Shortest paths Network flows Diagrams, sample Java code, and detailed algorithm descriptions A landmark revision, Algorithms in Java, Third Edition, Part 5 provides a complete tool set for programmers to implement, debug, and use graph algorithms across a wide range of computer applications. 0201361213B06272003

Productspecificaties

Inhoud

Taal
en
Bindwijze
Paperback
Oorspronkelijke releasedatum
15 juli 2003
Aantal pagina's
497
Illustraties
Nee

Betrokkenen

Hoofdauteur
Robert Sedgewick
Tweede Auteur
Robert Sedgewick
Hoofdredacteur
Robert John Fuller
Hoofduitgeverij
Addison-Wesley Professional

Overige kenmerken

Editie
3
Extra groot lettertype
Nee
Product breedte
197 mm
Product hoogte
25 mm
Product lengte
229 mm
Studieboek
Ja
Verpakking breedte
198 mm
Verpakking hoogte
237 mm
Verpakking lengte
22 mm
Verpakkingsgewicht
851 g

EAN

EAN
9780201361216

Je vindt dit artikel in

Boek, ebook of luisterboek?
Boek
Taal
Engels
Beschikbaarheid
Leverbaar
Studieboek of algemeen
Algemene boeken
Nog geen reviews

Kies gewenste uitvoering

Bindwijze : Paperback

Prijsinformatie en bestellen

De prijs van dit product is 46 euro en 12 cent. Dit is een tweedehands product.
Alleen tweedehands
Goed
.
1 - 2 weken
Verkoop door BAY EXPRESS
7,4
In winkelwagen
  • Bestellen en betalen via bol
  • Prijs inclusief verzendkosten, verstuurd door BAY EXPRESS
  • 30 dagen bedenktijd en gratis retourneren

Lijst met gekozen artikelen om te vergelijken

Vergelijk artikelen