KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
I have a priority queue of pointers to a struct city . I modify the objects pointed by these pointers outside the priority queue, and want to tell the priority queue to "reorder" itself according to the new values. What should I do? Example: #include <iostream> #include <queue> using namespace std; struct city { int data; city *previous; }; struct Compare { bool operator() ( city *lhs, city *rhs ) { return ( ( lhs -> data ) >= ( rhs -> data ) ); } }; typedef priority_queue< city *, vector< city * >, Compare > pqueue; int main() { pqueue cities; city *city1 = new city; city1 -> data = 5; city1 -> previous = NULL; cities.push( city1 ); city *city2 = new city; city2 -> data = 3; city2 -> previous = NULL; cities.push( city2 ); city1 -> data = 2; // Now how do I tell my priority_queue to reorder itself so that city1 is at the top now? cout << ( cities.top() -> data ) << "\n"; // 3 is printed :( return 0; }
Tags (comma-separated)
Save Edits
Cancel