how to make a priority queue/min heap
im working on a program and what i have to do is pass in process time of jobs into a priority queue processing min time jobs first. there is also a high priority job which should stop everything and be processed right away which is the 30 with priority 1 job. im stuck on how to do this i have my jobs being created and their processing times done. i am trying to make a function where i would pass thoe processing times in along with priority to put them into the queue to be processed but i have no idea how to implement this. this is my code so far creating all the jobs and process times. ive never used priority queues or heaps and i tried googling it to learn but i just dont understand if any1 can exaplin what to do or how i can achieve this that would be great.
|
|
priority_queue is part of the STL. Just use that.
http://www.cplusplus.com/reference/queue/priority_queue/
http://www.cplusplus.com/reference/queue/priority_queue/
@dhayden
i was trying to do that but it didnt work with me i was just trying to store it in a regular queue and that wasnt really working when im trying to print it out
i was trying to do that but it didnt work with me i was just trying to store it in a regular queue and that wasnt really working when im trying to print it out
|
|
In your example, myqueue is a local variable and you are either adding something to it (lines 9-10) or printing it out (line 14) but not both, so you're guaranteed to print an empty queue only.
Your priority queue must be part of the class or passed into pass2queue by reference etc. Also, what's in the priority queue probably has to be a class containing the process priority, remaining process runtime, maybe process id. You might call it class Process :). Add an
Your priority queue must be part of the class or passed into pass2queue by reference etc. Also, what's in the priority queue probably has to be a class containing the process priority, remaining process runtime, maybe process id. You might call it class Process :). Add an
operator <() to sort the Jobs by priority.
As dhayden suggested, you can modify the STL priority queue. You can declare a modified priority queue like:
This means that the priority queue is filled with a class Job, which can have your different times and priority in it; it uses a vector for queue storage, and the last one is the comparing method on how to sort things within the queue.
You can make your own operator overload class function to tell the queue how you want things sorted. Since you said by processing times, you can make a class function that overloads () and takes in two types of jobs, compares their processing time, and return true/false if one job is lower processing time than the other.
Check out this website: http://comsci.liu.edu/~jrodriguez/cs631sp08/c++priorityqueue.html
About half way down the page is what I'm talking about.
priority_queue<Job, vector<Job>, "Some comparative here"> myQueue;This means that the priority queue is filled with a class Job, which can have your different times and priority in it; it uses a vector for queue storage, and the last one is the comparing method on how to sort things within the queue.
You can make your own operator overload class function to tell the queue how you want things sorted. Since you said by processing times, you can make a class function that overloads () and takes in two types of jobs, compares their processing time, and return true/false if one job is lower processing time than the other.
Check out this website: http://comsci.liu.edu/~jrodriguez/cs631sp08/c++priorityqueue.html
About half way down the page is what I'm talking about.
Last edited on
@dhayden
ok so i think my first problem is i dont have a class. never learned them too well so i need a class to make the priority queue to work?
ok so i think my first problem is i dont have a class. never learned them too well so i need a class to make the priority queue to work?
what i was trying to do it while the endtime is greater than 0 add the stuff to the queue then when the endtime goes below 0 it would print it all out
@danghotties
so like when you delcare all those things inside the priority queue and class it will automatically run those each time some thing is put into it automatically storing it??
so like when you delcare all those things inside the priority queue and class it will automatically run those each time some thing is put into it automatically storing it??
Yes, any time you push/pop to/from queue it will adjust itself based on the specifications you made when declared.
@danghotties
Ok now it's starting to make more sense ima go try it see what I can do :)
Ok now it's starting to make more sense ima go try it see what I can do :)
Topic archived. No new replies allowed.