Given a graph, A* finds the optimal path, if it exists, joining the start node to the goal node. Hybrid A* takes vehicle dynamics into consideration and generates a smoother path which the vehicle can follow. Both the implementations are optimized using dictionaries & heaps