I thought about making a search superclass, like maloof's implementation, but UCS and AStar already are derived from pathplanning superclass, so all of this OOP stuff would be a little messy. Since there is only two derivations of BFS-based path planning search, I think this is fine. Also, the bug is still there.
I thought about making a search superclass, like maloof's implementation, but UCS and AStar already are derived from pathplanning superclass, so all of this OOP stuff would be a little messy. Since there is only two derivations of BFS-based path planning search, I think this is fine. Also, the bug is still there.