Log In
Or create an account -> 
Imperial Library
  • Home
  • About
  • News
  • Upload
  • Forum
  • Help
  • Login/SignUp

Index
Title Page Copyright and Credits
Hands-On Artificial Intelligence for Search
Packt Upsell
Why subscribe? PacktPub.com
Contributors
About the author About the reviewer Packt is searching for authors like you
Preface
Who this book is for What this book covers To get the most out of this book
Download the example code files Download the color images Conventions used
Get in touch
Reviews
Understanding the Depth-First Search Algorithm
Installing and setting up libraries
Setting up Python Setting up Graphviz Installing pip
Introduction to file searching applications Basic search concepts Formulating the search problem Building trees with nodes Stack data structure The DFS algorithm
Recursive DFS
Do it yourself Summary
Understanding the Breadth-First Search Algorithm
Understanding the LinkedIn connection feature Graph data structure Queue data structure The BFS algorithm BFS versus DFS
Order of traversal Data structures Memory Optimal solution
Do it yourself Summary
Understanding the Heuristic Search Algorithm
Revisiting the navigation application The priority queue data structure Visualizing a search tree Greedy BFS A* Search What is a good heuristic function?  
Properties of a good heuristic function
Admissible Consistent
Summary
Other Books You May Enjoy
Leave a review - let other readers know what you think
  • ← Prev
  • Back
  • Next →
  • ← Prev
  • Back
  • Next →

Chief Librarian: Las Zenow <zenow@riseup.net>
Fork the source code from gitlab
.

This is a mirror of the Tor onion service:
http://kx5thpx2olielkihfyo4jgjqfb7zx7wxr3sd4xzt26ochei4m6f7tayd.onion