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:
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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).
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
EUR 6,90 für den Versand von USA nach Deutschland
Versandziele, Kosten & DauerGratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerAnbieter: moluna, Greven, Deutschland
Zustand: New. Jeremy Kubica is an engineering director working at the intersection of computer science and astrophysics. He holds a PhD in robotics from Carnegie Mellon University and a BS in computer science from Cornell University. He is the author of The CS . Bestandsnummer des Verkäufers 1551205189
Anzahl: 5 verfügbar
Anbieter: BooksRun, Philadelphia, PA, USA
Paperback. Zustand: Very Good. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. Bestandsnummer des Verkäufers 1718503865-8-1
Anzahl: 1 verfügbar
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers DB-9781718503861
Anzahl: 6 verfügbar
Anbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes Königreich
Paperback / softback. Zustand: New. New copy - Usually dispatched within 4 working days. 526. Bestandsnummer des Verkäufers B9781718503861
Anzahl: 3 verfügbar
Anbieter: Rarewaves.com UK, London, Vereinigtes Königreich
Paperback. Zustand: 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. Bestandsnummer des Verkäufers LU-9781718503861
Anzahl: Mehr als 20 verfügbar
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. Bestandsnummer des Verkäufers 26400791508
Anzahl: 3 verfügbar
Anbieter: California Books, Miami, FL, USA
Zustand: New. Bestandsnummer des Verkäufers I-9781718503861
Anzahl: 5 verfügbar
Anbieter: Rarewaves USA, OSWEGO, IL, USA
Paperback. Zustand: 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. Bestandsnummer des Verkäufers LU-9781718503861
Anzahl: Mehr als 20 verfügbar
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Zustand: New. Bestandsnummer des Verkäufers V9781718503861
Anzahl: 1 verfügbar
Anbieter: Speedyhen, London, Vereinigtes Königreich
Zustand: NEW. Bestandsnummer des Verkäufers NW9781718503861
Anzahl: 2 verfügbar