Finding the shortest path using Dijkstra's and min heap

Hi all,
I'm trying to find the shortest path between nodes using dijkstra's algorithm and a min heap. I'm having a difficult time understanding how to re-heapify my min heap when I decrease the key of a node. Can anyone please help me with this? Thank you!
Check the node key against its parent, if it is lower then swap and recurse.
Topic archived. No new replies allowed.