I’m really gearing up to the completion of the path finding Dijkstra class. The progress is really slow and on the way I’m refactoring other components that will help me out. There other problems dealing with the language that kind of hinder my progress.
- I’m trying to wrap my mind of how to deal with backtracking and getting the other nodes. It will take some testing and trying to correctly get those paths. There will be other problems to solve after that, but it is something that has been holding me back.
- I’ll have to traverse the new coordinate array and try to follow the path of lowest fitness. It would be more efficient to do it all the first time, but I need to split the two parts, so that it is easier for me to comprehend.
I’m pretty much holding back on the Astrum Futura News feature and the Astrum Futura Installer until this is done. I’m close enough that I don’t think it will take that much more time to complete the path finding algorithms.
Possibly Related Posts:
- Game Engine Development and Open Source
- Plans for Base CMS
- Bullet: E-Book Library Management and Content Server
- Using ZendFramework 2 beta1 For Directory Project
- Project Plans