Uyir | Short Film
You all know that I was pretty interested in Leukemia in the near past. Well yeah, you're right. This time too I have done something really serious.
Dijkstra’s Algorithm For Path Finding Problems
The blog is migrated to https://thiloshon.wordpress.com The path finding is one of the most common problems found in computer science, especially in game development and AI. The problem has been analyzed, scrutinized and dissected by various people and several possible solutions and algorithms have been implemented. The important part is not to implement one by ourselves but to understand what each does and how its effective from one another. In the CW, this is exactly what’s expected. You don’t necessarily have to implement the best solution. You just have to implement one and understand how efficient it is. I.e. derive the growth rate. It can be a slow algorithm. If its slow say its slow and justify why its slow. Derive the growth rate and support your rationale. I’m using the Dijkstra’s Algorithm in this blog to find the shortest distance path. Don’t be intimidated by the name of the Algorithm, its fairly simple one. It uses Greedy Algorithm with a simple tweak and is
Comments
Post a Comment