I'm implementing dijkstra's algorithm, and I'm implementing it using a priority queue so that the shortest distance is on top for fast access. The priority queue uses a vector for its operations.
Each node has the following properties:
Here is the issue: when I attempt to rearrange the priority queue (i.e. swap two elements during a percolate function to keep the lowest distance on the top), they overwrite eachother. So, let's take this example:
 = node1
 = node2
 = node3
Node 3's path points to node 1.
Now when I attempt to swap indexes 3 and 1 using a temp variable and assignment statements, node 1 becomes node 3, and node 3's path member points to itself infinitely, destroying what I have of my path so far.
Summary: I need to be able to swap elements without them overwriting eachother.
This problem has been killing me. I've spent 6+ hours on it. Thank you for your help.