search

BucknellMARC / MicroMouse-Sim

OpenGL simulator for the MicroMouse competition
MIT License
2 stars 1 forks source link

Dijkstra's Algorithm #8

Closed DepthDeluxe closed 10 years ago

DepthDeluxe commented 10 years ago

This clearly looks like a much more efficient implementation for computing the flood fill of a maze. It may not be necessary though.

http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm

DepthDeluxe commented 10 years ago

this may be a nice alternative if current iterative flood fill code doesn't run fast enough on the microcontroller

DepthDeluxe commented 10 years ago

turns out to speed up the concept of FloodFill, I implemented a fairly similar graph search algorithm that uses a queue along with breadth-first search to get a solution with relatively few computations