|
1 | 1 | # Unidirectional-&-Bidirectional-A-Star-Search-Algorithm-Python-Implementation |
2 | 2 |
|
3 | | -This is the Unidirectional and Bidirectional A Star Search Algorithm Python Implementation. |
| 3 | +This is the Unidirectional and Bidirectional A Star Search Algorithm Python Implementation. For more info about this algorithm: https://en.wikipedia.org/wiki/A*_search_algorithm |
4 | 4 |
|
5 | | -Important Details (Unidirectional A star search Algorithm): |
| 5 | +Important Details Regarding the Implementation (Unidirectional A star search Algorithm): |
6 | 6 |
|
7 | 7 | 1. For the heuristic, Euclidean distance/octile have been used to get an estimate from the given node to the goal node. |
8 | 8 |
|
9 | 9 | 2. In order to address the ties (nodes having the same F value in our (discovered) heap, then we prefer using that node whihc are closer to the goal node i.e. node having higher H value.) |
10 | 10 |
|
11 | | - Important Details (Bidirectional A star search Algorithm): |
| 11 | + Important Details Regarding the Implementation (Bidirectional A star search Algorithm): |
12 | 12 |
|
13 | 13 | 1. For the heuristic, Euclidean distance/octile have been used to get an estimate from the given node to the goal node. |
14 | 14 |
|
|
0 commit comments