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 heuristicsearch.a_star_search import AStar
from heuristicsearch.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.1.1.tar.gz
(4.5 kB
view hashes)
Built Distribution
Close
Hashes for heuristicsearch-0.1.1-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 66f74d8c6771012c4f86c78501f2a4fbaaf5cbe9f2ab0a48d6d8844b769743ab |
|
MD5 | f865ab00e717c50dd539866ffc810712 |
|
BLAKE2b-256 | afa4c1893a495b42b4c47af75bfe261cc214d9631c7b03a6b19fc20a6a36bde2 |