Add A* Implementation Back to GIO #25
Description
Goal: Sometimes Gold Star finds distances that are biologically infeasible - let's traverse through the mask to find the shortest distance
Problem: Masks have holes in them around landmarks of interest
Possible solutions:
- Use masks without holes in them
- Fill in holes using (insert ML, blob, identify where particles are using x,y csv and then filling in mask respectively)
- Something else!
Things to reference:
- https://pypi.org/project/astar/
- http://theory.stanford.edu/~amitp/GameProgramming/AStarComparison.html
- https://www.redblobgames.com/pathfinding/a-star/introduction.html
- https://www.teachyourselfpython.com/challenges.php?a=01_Solve_and_Learn&s=02d_A__Algorithm&t=7-Sorting_Searching_Algorithms
- https://www.analytics-link.com/post/2018/09/14/applying-the-a-path-finding-algorithm-in-python-part-1-2d-square-grid