priority_queue, vector >, greater< pair
> >
here pair. First is used for comparing If you replace greater
with lower , you get max heap If you use some structure... You
have to define a bool function in tat case..
On 8/15/11, sandeep pandey wrote:
> would u pls elaborate this..?
>
> --
would u pls elaborate this..?
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more opt
priority_queue >
On 8/15/11, Zack wrote:
> how i use STL,s prority_queue as a min heap..?
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this gro
how i use STL,s prority_queue as a min heap..?
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.
