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.
Graph Algorithms the Fun Way offers a refreshing approach to complex concepts by blending humor, imaginative examples, and practical Python implementations to reveal the power and versatility of graph based problem-solving in the real world. Through clear diagrams, engaging examples, and Python code, you’ll build a solid foundation for addressing graph problems in your own projects.
Explore a rich landscape of cleverly constructed scenarios where:
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
FREE shipping within U.S.A.
Destination, rates & speedsSeller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 47524117-n
Quantity: 4 available
Seller: Grand Eagle Retail, Mason, OH, U.S.A.
Paperback. Condition: new. Paperback. 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.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.Graph Algorithms the Fun Way offers a refreshing approach to complex concepts by blending humor, imaginative examples, and practical Python implementations to reveal the power and versatility of graph based problem-solving in the real world. Through clear diagrams, engaging examples, and Python code, you'll build a solid foundation for addressing graph problems in your own projects.Explore a rich landscape of cleverly constructed scenarios where-Hedge mazes illuminate depth-first searchUrban explorations demonstrate breadth-first searchIntricate labyrinths reveal bridges and articulation pointsStrategic planning illustrates bipartite matchingFrom fundamental graph structures to advanced topics, you will-Implement powerful algorithms, including Dijkstra's, A*, and Floyd-WarshallTackle puzzles and optimize pathfinding with newfound confidenceUncover real-world applications in social networks and transportation systemsDevelop robust intuition for when and why to apply specific graph techniquesDelve into topological sorting, minimum spanning trees, strongly connected components, and random walks. Confront challenges like graph coloring and the traveling salesperson problem.Prepare to view the world through the lens of graphs-where connections reveal insights and algorithms unlock new possibilities. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9781718503861
Quantity: 1 available
Seller: INDOO, Avenel, NJ, U.S.A.
Condition: New. Seller Inventory # 9781718503861
Quantity: 20 available
Seller: Lakeside Books, Benton Harbor, MI, U.S.A.
Condition: New. Brand New! Not Overstocks or Low Quality Book Club Editions! Direct From the Publisher! We're not a giant, faceless warehouse organization! We're a small town bookstore that loves books and loves it's customers! Buy from Lakeside Books! Seller Inventory # OTF-S-9781718503861
Quantity: 4 available
Seller: BooksRun, Philadelphia, PA, U.S.A.
Paperback. Condition: Very Good. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. Seller Inventory # 1718503865-8-1
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 47524117
Quantity: 4 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9781718503861
Quantity: 8 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. Seller Inventory # 26400791508
Quantity: 3 available
Seller: Rarewaves USA, OSWEGO, IL, U.S.A.
Paperback. Condition: 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. Seller Inventory # LU-9781718503861
Quantity: Over 20 available
Seller: Russell Books, Victoria, BC, Canada
paperback. Condition: New. Special order direct from the distributor. Seller Inventory # ING9781718503861
Quantity: 7 available