A01=Jeremy Kubica
Age Group_Uncategorized
Age Group_Uncategorized
algebra
algorithm
Algorithmic Thinking
algorithms
Author_Jeremy Kubica
automatic-update
Bayesian Statistics the Fun Way
Best Practices of Spell Design
Category1=Non-Fiction
Category=UMB
Category=UMX
Category=UYQN
clean code
code
coding
coding for beginners
coding for kids
Computational Fairy Tales
computer
computer books
computer programmer gifts
computer programming
computer science
computers
connectivity
COP=United States
data
data structures
Data Structures the Fun Way
Delivery_Pre-order
Dive into Algorithms
eq_bestseller
eq_computing
eq_isMigrated=2
eq_nobargain
eq_non-fiction
geometry
graph algorithms
Language_English
learning python
logic
math
math books
Math for Security
mathematics
maths
numbers
PA=Not yet available
physics
Price_€50 to €100
programmer gifts
programming
PS=Forthcoming
python
python 3
python data science
python for beginners
python for data analysis
python machine learning
python programming
softlaunch
statistics
tech
technology
The Art of Randomness
The CS Detective
The Recursive Book of Recursion
Think Like a Programmer
Product details
- ISBN 9781718503861
- Dimensions: 178 x 235mm
- Publication Date: 19 Nov 2024
- Publisher: No Starch Press,US
- Publication City/Country: US
- Product Form: Paperback
- Language: English
Secure
checkout
Fast Shipping
Easy returns
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.
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 Detective, Data Structures the Fun Way (both from No Starch Press), and Computational Fairy Tales.
