{"product_id":"graph-algorithms-the-fun-way-isbn-9781718503861","title":"Graph Algorithms the Fun Way","description":"\u003cb\u003eEnter 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.\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e\u003ci\u003eGraph Algorithms the Fun Way\u003c\/i\u003e 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.\u003cbr\u003e\u003cbr\u003eExplore a rich landscape of cleverly constructed scenarios where:\u003cbr\u003e\u003cbr\u003e\u003cul\u003e\n\u003cli\u003eHedge mazes illuminate depth-first search\u003c\/li\u003e\n\u003cli\u003eUrban explorations demonstrate breadth-first search\u003c\/li\u003e\n\u003cli\u003eIntricate labyrinths reveal bridges and articulation points\u003c\/li\u003e\n\u003cli\u003eStrategic planning illustrates bipartite matching\u003c\/li\u003e\n\u003c\/ul\u003e\u003cbr\u003eFrom fundamental graph structures to advanced topics, you will:\u003cbr\u003e\u003cul\u003e\n\u003cli\u003eImplement powerful algorithms, including Dijkstra’s, A*, and Floyd-Warshall\u003c\/li\u003e\n\u003cli\u003eTackle puzzles and optimize pathfinding with newfound confidence\u003c\/li\u003e\n\u003cli\u003eUncover real-world applications in social networks  and transportation systems\u003c\/li\u003e\n\u003cli\u003eDevelop robust intuition for when and why to apply specific graph techniques\u003c\/li\u003e\n\u003c\/ul\u003e\u003cbr\u003eDelve into topological sorting, minimum spanning trees, strongly connected components, and random walks. Confront challenges like graph coloring and the traveling salesperson problem.\u003cbr\u003e\u003cbr\u003ePrepare to view the world through the lens of graphs—where connections reveal insights and algorithms unlock new possibilities.Introduction\u003cbr\u003e\u003cbr\u003ePart I: Graph Basics\u003cbr\u003eChapter 1: Representing Graphs\u003cbr\u003eChapter 2: Neighbors and Neighborhoods\u003cbr\u003eChapter 3: Paths Through Graphs\u003cbr\u003e\u003cbr\u003ePart II: Search and Shortest Paths\u003cbr\u003eChapter 4: Depth-First Search\u003cbr\u003eChapter 5: Breadth-First Search\u003cbr\u003eChapter 6: Solving Puzzles\u003cbr\u003eChapter 7: Shortest Paths\u003cbr\u003eChapter 8: Heuristic Guided Searches\u003cbr\u003e\u003cbr\u003ePart III: Connectivity and Ordering\u003cbr\u003eChapter 9: Topological Sort\u003cbr\u003eChapter 10: Minimum Spanning Tree\u003cbr\u003eChapter 11: Bridges and Articulation Points\u003cbr\u003eChapter 12: Strongly Connected Components\u003cbr\u003eChapter 13: Random Walks\u003cbr\u003e\u003cbr\u003ePart IV: Max-Flow and Bipartite Matching\u003cbr\u003eChapter 14: Max-Flow Algorithms\u003cbr\u003eChapter 15: Bipartite Graphs and Bipartite Matching\u003cbr\u003e\u003cbr\u003ePart V: Hard Graph Problems\u003cbr\u003eChapter 16: Graph Coloring\u003cbr\u003eChapter 17: Independent Sets and Cliques\u003cbr\u003eChapter 18: Tours Through Graphs\u003cbr\u003e\u003cbr\u003eAppendix A: Constructing Graphs\u003cbr\u003eAppendix B: Priority Queue\u003cbr\u003eAppendix C: Union-Find\u003cbr\u003e\u003cbr\u003eConclusion\"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.\"\u003cbr\u003e\u003cb\u003e—Kirk Borne, PhD, Chief Science Officer at DataPrime\u003c\/b\u003e\u003cb\u003eJeremy Kubica\u003c\/b\u003e 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 \u003ci\u003eThe CS Detective\u003c\/i\u003e, \u003ci\u003eData Structures the Fun Way\u003c\/i\u003e (both from No Starch Press), and \u003ci\u003eComputational Fairy Tales\u003c\/i\u003e.","brand":"No Starch Press","offers":[{"title":"Default Title","offer_id":46304395919589,"sku":"NP9781718503861","price":59.99,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/1842\/7735\/files\/9781718503861.jpg?v=1767728439","url":"https:\/\/k12savings.com\/products\/graph-algorithms-the-fun-way-isbn-9781718503861","provider":"K12savings","version":"1.0","type":"link"}