OFFRE LISEUSES
Une liseuse achetée = une housse offerte* jusqu'au 21 juin
Graph Algorithms the Fun Way. Powerful Algorithms Decoded, Not Oversimplified
Par :Formats :
Disponible dans votre compte client Decitre ou Furet du Nord dès validation de votre commande. Le format ePub est :
- Compatible avec une lecture sur My Vivlio (smartphone, tablette, ordinateur)
- Compatible avec une lecture sur liseuses Vivlio
- Pour les liseuses autres que Vivlio, vous devez utiliser le logiciel Adobe Digital Edition. Non compatible avec la lecture sur les liseuses Kindle, Remarkable et Sony
, qui est-ce ?Notre partenaire de plateforme de lecture numérique où vous retrouverez l'ensemble de vos ebooks gratuitement
Pour en savoir plus sur nos ebooks, consultez notre aide en ligne ici
C'est si simple ! Lisez votre ebook avec l'app Vivlio sur votre tablette, mobile ou ordinateur :
- Nombre de pages416
- FormatePub
- ISBN978-1-7185-0387-8
- EAN9781718503878
- Date de parution19/11/2024
- Protection num.pas de protection
- Taille27 Mo
- Infos supplémentairesepub
- ÉditeurNo Starch Press
Résumé
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.
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.
