An implementation of a path finder in a search space of randomly generated polygons. And analsyed different graph search algorithms.
This module is used to plot all the necessary functions, paths and shapes onto graphs. Implemented using matplotlib.pyplot.
This module contains all the graph search algorithms used in this project.
This module contains all the necessary utility functions like euclidean distance, random shuffle and etc.
This module generates a search space for an instance, with random shapes created from a convex hull.
This module generates the visibility graph for the given 2D search space.
This is the main program file which contains the main class that runs various searches from the search.py file.