Algorithms in C, Part 5

Algorithms in C, Part 5

Mīkstajos vākos2001 m.512 lpp. Piegāde 3-4 nedēļās
€64,04€66,49-3%
Pašlaik nav noliktavāAtstājiet savu e-pasta adresi, un mēs jums paziņosim, tiklīdz grāmata atkal būs pieejama (parasti 3-4 nedēļu laikā).
14 dienu atgriešanas garantijaPārdomājāt? Pasūtījumu varat atcelt jebkurā brīdī vai to atgriezt 14 dienu laikā. Atgriešanas noteikumi

Par grāmatu

Discover the essential insights of graph algorithms with Algorithms in C, Part 5 by Robert Sedgewick. Published by Pearson Education (US) in 2001, this comprehensive paperback edition spans 512 pages and is the third edition of this pivotal work.

Graph algorithms play a vital role in various applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In this book, Sedgewick presents a wealth of algorithms alongside clear explanations. Each algorithm is accompanied by detailed figures and insightful commentary, making complex concepts accessible to readers.

Whether you are a student, a professional, or an enthusiast in the field of computer science, Algorithms in C, Part 5 is an invaluable resource that will enhance your understanding of graph algorithms and their practical applications.

AutorsRobert Sedgewick
IzdevējsPearson Education (US)
Izdošanas gads2001 m.
ValodaAngļu
Lappuses512 psl.
FormātsMīkstajos vākos
Izdevums3 ed
ISBN9780201316636

Vairāk no autora Robert Sedgewick

Visas šī autora grāmatas →

Nesen skatītās