Original Post
I have a minimum ordered binary heap. (I'm using A* pathfinding) at one point or another I come to a point where I must modify a node that may or may not be the top or bottom of the tree.
How would I go about resorting the entire array (since, I don't know the exact position within the heap of the node i modified)?
How would I go about resorting the entire array (since, I don't know the exact position within the heap of the node i modified)?