Heuristic Searches
Project description
Heuristic Searches
This module contains functions to perform a* search and ao* search algorithms
Installation
Run the following command to install:
pip install heuristicsearch
Useage
from a_star_search import AStar
from ao_star import AOStar
# object creation Astar(adjacency_list -> dictionary, heuristic_values -> dicitonary)
# call the apply_a_star method to find the shortest path
adjacency_list = {
'A': [('B', 1), ('C', 3), ('D', 7)],
'B': [('D', 5)],
'C': [('D', 12)]
}
heuristics = {'A':1, 'B':1, 'C':1, 'D':1}
graph1 = AStar(adjacency_list, heuristics)
graph1.apply_a_star(start='A',stop='B')
# similar approach for AOStar
# object creation AOStar(adjacency_list -> dictionary, heuristic_values -> dicitonary, startNode)
# call apply_AOStar method
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
heuristicsearch-0.0.3.tar.gz
(4.4 kB
view hashes)
Built Distribution
Close
Hashes for heuristicsearch-0.0.3-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 8bf1e0a6abb87aac7d766f9342df39801852853c646dba574436dcfa39bf5f35 |
|
MD5 | 94227de579c19fc72540159b87048001 |
|
BLAKE2b-256 | 7049f033c022e34390fbeb8d94540018cc06b65fef82bbd86258c7608b4bb0be |