ohohcakester / any-angle-pathfinding Goto Github PK

Hello. You were studying the pathfinding algorithm and studying by writing your own code based on the code I wrote. You found a bug in the function and let me know. You should subtract the value in the root node when subtracting the minimum value, but you are subtracting the value corresponding to the last index, so you are not performing the minHeap function properly. When you change only the part that sets the index to the root node, it works properly. Thank you. I’m sorry but I’m not sure what you mean. Could you please rephrase your question in English? I’ll do my best to help you.