A package for A* Search Algorithm
Project description
A* Search Algorithm.
Anyone of you can use this library to do A* search Github Open Source
Existing methods
- feed(self,heuristic_value_list,adjacency_matrix,node_name_dictionary)
- path() - Show the solved path with lowest cost
using process
1st need to add the library
pip install astarRobi
2nd You must need to implement neccessary list and dictionary like this ->
node_dict = {
0:"S",
1:'A',
2:'B',
3:'C',
4:'D'
}
adj_node = [ [-1,1,4,-1,-1],
[-1,-1,2,5,12],
[-1,-1,-1,2,-1],
[-1,-1,-1,-1,3],
[-1,-1,-1,-1,-1]]
h_val = [7,2,6,1,0] #here heuristic value 0 denotes the goal node.
3rd import aster and feed the data into it
import astarRobi as astar
test = astar.feed(h_val,adj_node,node_dict) #feeding the algorithm neccessary data
test.path() #Showing the computed result :)
N.B: part 2 is customizable you could feed any graph you want here a demo data is given. :)
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
astarRobi-1.0.6.tar.gz
(2.5 kB
view hashes)
Built Distribution
Close
Hashes for astarRobi-1.0.6-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 7a5fcf26be1c64d8d7bbcb793cbeb4637b6568926b0860cba3c429e78d15bec3 |
|
MD5 | f3b7d926c28ee58e34a2763ad223a130 |
|
BLAKE2b-256 | 2ced207c408366afa910332f7dbe942880df7dfb15d69402d93db15341ba43b3 |