You signed in with another tab or window.Reload to refresh your session.You signed out in another tab or window.Reload to refresh your session.You switched accounts on another tab or window.Reload to refresh your session.Dismiss alert
Java based solution to find the shortest path's distance between 2 Grid Cells. [A* Shortest Pathfinding Algorithm]
Paths and Values
Manhattan Path - Travels in vertical/horizontal directions (Vertical/Horizontal gCost = 1)Chebyshev Path - Travels in both diagonal and vertical/horizontal directions (Vertical/Horizontal gCost = 1, Diagonal gCost = 1)Euclidean Path - Travels in both diagonal and vertical/horizontal directions (Vertical/Horizontal gCost = 1, Diagonal gCost = 1.4)
Input
Grid size (NxN) => E.g: 20Percolation ratio (0-1) => E.g: 0.8x, y coordinates of the starting cell => E.g: 0, 0x, y coordinates of the ending cell => E.g: 19, 19
Output
Total path gCost Time taken to calculate the shortest pathManhattan Path - Yellow lineChebyshev Path - Squares filled in red colorEuclidean Path - Black line
Screenshots
Grid Size: 20x20, Percolation Ratio: 0.8
Grid Size: 20x20, Percolation Ratio: 0.6
About
Java based solution to find the shortest path between 2 Grid Cells. [A* Shortest Pathfinding Algorithm]