🎉 Celebrating 25 Years of GameDev.net! 🎉

Not many can claim 25 years on the Internet! Join us in celebrating this milestone. Learn more about our history, and thank you for being a part of our community!

Back to Artificial Intelligence

Dijkstra

None · 2021-11-09T14:44:48

Ive set to write an implementation for the Dijkstra pathfinding algorithm. Its a wip so please have patience with me. Im going to try not to use containers (Standard Template Library vector etc.). I will use the same array to store both visited and unvisited nodes. I know this will make the algorithm slow because I will have to traverse the entire array each time. Also Im not going to hold the nodes in structures. Im going to keep several arrays of the same dimension, one array for each structure member. I do all this because I find it easier going this route. arbm and arim are arrays enveloped in a class. I did this wrapping to make the array safer to use. arim::arim() { container = new int[800]; csize = 800; }; arbm::arbm() { container = new bool[800]; csize = 800; } void arbm::Init(int contside) { side = contside; } void arim::Init(int contside) { side = contside; } bool arbm::G(int x, int z) { if(side > -1) { if((z * side + x < csize)&&(z * side + x > -1 )) return container[z * side + x]; } } void arbm::S(int x, int z, bool value) { if(side > -1) { if((z * side + x < csize)&&(z * side + x > -1 )) container[z * side + x] = value; } }; void arim::S(int x, int z, int value) { if(side > -1) { if((z * side + x < csize)&&(z * side + x > -1 )) container[z * side + x] = value; } }; bool arbm::G(int index) { if(index < csize) { return container[index]; } else { } }; int arim::G(int index) { if(index < csize) { return container[index]; } else { return -1; } };

Artificial Intelligence Programming

Started by Calin November 02, 2021 03:37 PM

11 comments, last by Calin 2 years, 7 months ago

Calin

456

Author

November 04, 2021 11:46 AM

almost done, the only thing left to do is to extract the path from the LastNode array.

My project`s facebook page is “DreamLand Page”

Calin

456

Author

November 09, 2021 02:44 PM

Ive got the code debugged and working. heres the final result:

the source bug free. I have a memory leak somewhere in my project that makes passing int variables to the function impossible (I get trash values in them) so I made a class (ints) to store the variables I want to pass to the function.

My project`s facebook page is “DreamLand Page”

🎉 Celebrating 25 Years of GameDev.net! 🎉

Dijkstra

This topic is closed to new replies.

Popular Topics

Recommended Tutorials

🎉 Celebrating 25 Years of GameDev.net! 🎉

Dijkstra

This topic is closed to new replies.

Popular Topics

Recommended Tutorials

Reticulating splines