Commit 24f47a0

authored

Added additional information about the algorithm implementation

1 parent 99eeec4 commit 24f47a0Copy full SHA for 24f47a0

File tree

-0

lines changed

-0

lines changed

Lines changed: 4 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -8,3 +8,7 @@ Important Details:`
`8`	`8`	`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.)`
`9`	`9`
`10`	`10`	`3. If the source/target node happens to be such a node which is not walkable, then the algorithm will return an empty path with a total cost of 0.`
	`11`	`+`
	`12`	`+ 4. This particular implementation will only work for 2D maps.`
	`13`	`+`
	`14`	`+ 5. In order to get more test cases, please refer to https://www.movingai.com/benchmarks/grids.html`

Comments

(0)