STL priority queue and overloading with pointers

Question

This is my first time using a priority queue. I\'m trying to implement Dijkstra\'s algorithm for school and I figured I need a min heap to do this. Right now my nodes are po

Answer 1

You would need your comparison functor to implement bool operator()(....), not bool operator<(....):

struct node_comparison 
{
   bool operator()( const Node* a, const Node* b ) const 
   {
    return a->totalWeight < b->totalWeight;
   }
};