Enter the wonderful world of graph algorithms, where you’ll learn when and how to apply these highly useful data structures to solve a wide range of fascinating (and fantastical) computational problems.
This book provides a fun and accessible introduction to graph algorithms, commonly used to solve a wide range of computational and mathematical problems. Full of humorous analogies, detailed diagrams, and real-world examples using the Python programming language, Graph Algorithms the Fun Way will show you how graph data structures can model a vast variety of phenomena — from physical mazes to communication networks — while helping you develop a strong foundation for how they work, when to use them, and how to create variants.
It starts with the structure of graphs, demonstrating the ways they can represent connections between nodes, such as the best route through a city or how rumors spread in a social network. Each subsequent chapter introduces new graph algorithms along with their underlying concepts and applications — from basic searches to more advanced methods of exploring graphs. You’ll have a blast solving brain-teasers including the 15-square puzzle, matching adopted pets with homes, calculating the maximum flow of a sewage network, traversing magical labyrinths, sorting recipe steps to craft the perfect cookies, and more. You’ll also learn how to:
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Jeremy Kubica is an engineering director with a BS in computer science from Cornell University and a PhD in robotics from Carnegie Mellon University where his work focused on creating algorithms to detect killer asteroids. He is the author of The CS Detective and Data Structures the Fun Way (both from No Starch Press).
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 17,21 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiEUR 7,75 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiDa: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9781718503861
Quantità: 6 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. Codice articolo 26400791508
Quantità: 3 disponibili
Da: Rarewaves.com UK, London, Regno Unito
Paperback. Condizione: New. This book provides a fun and accessible introduction to graph algorithms, commonly used to solve a wide range of computational and mathematical problems. Full of humorous analogies, detailed diagrams, and real-world examples using the Python programming language, Graph Algorithms the Fun Way will show you how graph data structures can model a vast variety of phenomena - from physical mazes to communication networks - while helping you develop a strong foundation for how they work, when to use them, and how to create variants. It starts with the structure of graphs, demonstrating the ways they can represent connections between nodes, such as the best route through a city or how rumours spread in a social network. Each subsequent chapter introduces new graph algorithms along with their underlying concepts and applications - from basic searches to more advanced methods of exploring graphs. You'll have a blast solving brain-teasers including the 15-square puzzle, matching adopted pets with homes, calculating the maximum flow of a sewage network, traversing magical labyrinths, sorting recipe steps to craft the perfect cookies, and more. You'll also learn how to: Work with weighted and directed graphs, Use heuristics to prioritize which paths in a graph to explore, Determine which components of a graph are key for its structural integrity, Generate random mazes. Guided by the bestselling author of Data Structures the Fun Way, this equally fun follow-up will help you build a strong understanding of a crucial coding topic and apply graph algorithms to your own projects. Codice articolo LU-9781718503861
Quantità: Più di 20 disponibili
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo EB-9781718503861
Quantità: 5 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 47524117-n
Quantità: 4 disponibili
Da: Rarewaves USA, OSWEGO, IL, U.S.A.
Paperback. Condizione: New. This book provides a fun and accessible introduction to graph algorithms, commonly used to solve a wide range of computational and mathematical problems. Full of humorous analogies, detailed diagrams, and real-world examples using the Python programming language, Graph Algorithms the Fun Way will show you how graph data structures can model a vast variety of phenomena - from physical mazes to communication networks - while helping you develop a strong foundation for how they work, when to use them, and how to create variants. It starts with the structure of graphs, demonstrating the ways they can represent connections between nodes, such as the best route through a city or how rumours spread in a social network. Each subsequent chapter introduces new graph algorithms along with their underlying concepts and applications - from basic searches to more advanced methods of exploring graphs. You'll have a blast solving brain-teasers including the 15-square puzzle, matching adopted pets with homes, calculating the maximum flow of a sewage network, traversing magical labyrinths, sorting recipe steps to craft the perfect cookies, and more. You'll also learn how to: Work with weighted and directed graphs, Use heuristics to prioritize which paths in a graph to explore, Determine which components of a graph are key for its structural integrity, Generate random mazes. Guided by the bestselling author of Data Structures the Fun Way, this equally fun follow-up will help you build a strong understanding of a crucial coding topic and apply graph algorithms to your own projects. Codice articolo LU-9781718503861
Quantità: Più di 20 disponibili
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condizione: New. Codice articolo V9781718503861
Quantità: 1 disponibili
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Paperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days. 526. Codice articolo B9781718503861
Quantità: 3 disponibili
Da: Rarewaves USA United, OSWEGO, IL, U.S.A.
Paperback. Condizione: New. This book provides a fun and accessible introduction to graph algorithms, commonly used to solve a wide range of computational and mathematical problems. Full of humorous analogies, detailed diagrams, and real-world examples using the Python programming language, Graph Algorithms the Fun Way will show you how graph data structures can model a vast variety of phenomena - from physical mazes to communication networks - while helping you develop a strong foundation for how they work, when to use them, and how to create variants. It starts with the structure of graphs, demonstrating the ways they can represent connections between nodes, such as the best route through a city or how rumours spread in a social network. Each subsequent chapter introduces new graph algorithms along with their underlying concepts and applications - from basic searches to more advanced methods of exploring graphs. You'll have a blast solving brain-teasers including the 15-square puzzle, matching adopted pets with homes, calculating the maximum flow of a sewage network, traversing magical labyrinths, sorting recipe steps to craft the perfect cookies, and more. You'll also learn how to: Work with weighted and directed graphs, Use heuristics to prioritize which paths in a graph to explore, Determine which components of a graph are key for its structural integrity, Generate random mazes. Guided by the bestselling author of Data Structures the Fun Way, this equally fun follow-up will help you build a strong understanding of a crucial coding topic and apply graph algorithms to your own projects. Codice articolo LU-9781718503861
Quantità: Più di 20 disponibili
Da: Speedyhen, London, Regno Unito
Condizione: NEW. Codice articolo NW9781718503861
Quantità: 2 disponibili