Graph Algorithms the Fun Way

Powerful Algorithms Decoded, Not Oversimplified

Jeremy Kubica

$130

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

No Starch Press,US
19 November 2024

Algorithms & data structures; Programming & scripting languages: general; Neural networks & fuzzy systems

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 search Urban explorations demonstrate breadth-first search Intricate labyrinths reveal bridges and articulation points Strategic planning illustrates bipartite matching

From fundamental graph structures to advanced topics, you will-

Implement powerful algorithms, including Dijkstra's, A
*, and Floyd-Warshall Tackle puzzles and optimize pathfinding with newfound confidence Uncover real-world applications in social networks

and transportation systems Develop robust intuition for when and why to apply specific graph techniques

Delve 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.

By: Jeremy Kubica
Imprint: No Starch Press,US
Country of Publication: United States
Dimensions: Height: 235mm, Width: 178mm,
Weight: 369g
ISBN: 9781718503861
ISBN 10: 1718503865
Pages: 264
Publication Date: 19 November 2024
Audience: General/trade , ELT Advanced
Format: Paperback
Publisher's Status: Active

Part 1: Graph Basics Chapter 1: Representing Graphs Chapter 2: Neighbors and Neighborhoods Chapter 3: Paths Through Graphs Part 2: Search and Shortest Paths Chapter 4: Depth-First Search Chapter 5: Breadth-First Search Chapter 6: Solving Puzzles Chapter 7: Shortest Paths Chapter 8: Heuristic Searches Part 3: Connectivity and Ordering Chapter 9: Topological Sort Chapter 10: Minimum Spanning Tree Chapter 11: Bridges and Articulation Points Chapter 12: Strongly Connected Components Chapter 13: Markov Systems Part 4: Max-Flow and Bipartite Matching Chapter 14: Max-Flow Algorithms Chapter 15: Bipartite Graphs and Bipartite Matching Part 5: Hard Graph Problems Chapter 16: Graph Coloring Chapter 17: Independent Sets and Cliques Chapter 18: Tours Through Graphs Appendix A: Constructing Graphs Appendix B: Priority Queue Appendix C: Union-Find Data Structures

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.

Reviews for Graph Algorithms the Fun Way: Powerful Algorithms Decoded, Not Oversimplified

"""Graphs may be the most natural data structure in the world. This comprehensive book unpacks the magic and mystery of many fascinating graph algorithms that enable powerful applications and insights from graphs."" —Kirk Borne, PhD, Chief Science Officer at DataPrime"