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.
Gratis 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 . Artikel-Nr. 1551205189
Anzahl: 3 verfügbar
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Artikel-Nr. DB-9781718503861
Anzahl: 3 verfügbar
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Taschenbuch. Zustand: Neu. Neuware -'This book provides a fun and accessible introduction to graph algorithms, a type of data structure used to solve a wide range of problems in mathematics and computer science. The book uses diagrams and real-world examples in the Python programming language to teach readers about the structure of graphs and how they can represent connections using different graphing algorithms. Readers will apply this knowledge to problems such as finding the shortest paths through a graph; estimating costs of paths through a graph; randomizing graphs; prioritizing nodes; determining which components in a graph are essential to maintaining its integrity; and calculating how much data can flow from one point in a graph to the next'-- Provided by publisher.Libri GmbH, Europaallee 1, 36244 Bad Hersfeld 383 pp. Englisch. Artikel-Nr. 9781718503861
Anzahl: 2 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Neuware - 'This book provides a fun and accessible introduction to graph algorithms, a type of data structure used to solve a wide range of problems in mathematics and computer science. The book uses diagrams and real-world examples in the Python programming language to teach readers about the structure of graphs and how they can represent connections using different graphing algorithms. Readers will apply this knowledge to problems such as finding the shortest paths through a graph; estimating costs of paths through a graph; randomizing graphs; prioritizing nodes; determining which components in a graph are essential to maintaining its integrity; and calculating how much data can flow from one point in a graph to the next'-- Provided by publisher. Artikel-Nr. 9781718503861
Anzahl: 2 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Artikel-Nr. ria9781718503861_new
Anzahl: 5 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Paperback. Zustand: Brand New. 264 pages. 9.25x7.00x9.25 inches. In Stock. Artikel-Nr. __1718503865
Anzahl: 2 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Paperback. Zustand: Brand New. 264 pages. 9.25x7.00x9.25 inches. In Stock. Artikel-Nr. xr1718503865
Anzahl: 2 verfügbar