priority_queue & 結構體

    template< class T ,

                     class Sequence=vector<T> ,

                     class Compare=less<typename Sequence::value_type> >

    兩種方法對結構體優先隊列指定自己的優先順序

方法一：

#include<iostream><br />#include<vector><br />#include<queue><br />using namespace std;</p><p>struct node<br />{<br />int x;<br />int y;<br />int w;<br />friend bool operator> (const node& a,const node& b)<br />{<br />return (a.w > b.w);<br />}<br />friend bool operator< (const node& a,const node& b)<br />{<br />return (a.w < b.w);<br />}<br />};</p><p>int main()<br />{<br />int i;<br />priority_queue < node, vector<node>, greater<node> > que1;<br />//priority_queue < node, vector<node>, greater<node>>(兩個連在一起不行) que;<br /> priority_queue < node, vector<node>, less<node> > que2;<br />node da[5];<br />for(i = 0;i < 5;i++)<br />{<br />da[i].x = i;<br />da[i].y = i;<br />da[i].w = i;<br /> que1.push(da[i]);<br />que2.push(da[i]);<br />}</p><p>while(!que1.empty())<br />{<br />cout<<que1.top().x<<" "<<que1.top().y<<" "<<que1.top().w<<endl;<br />que1.pop();<br />}<br />cout<<endl;</p><p>while(!que2.empty())<br />{<br />cout<<que2.top().x<<" "<<que2.top().y<<" "<<que2.top().w<<endl;<br />que2.pop();<br />}<br />cout<<endl;<br />return 0;<br />}

方法二：

#include<iostream><br />#include<vector><br />#include<queue><br />using namespace std;</p><p>struct node<br />{<br />int x;<br />int y;<br />int w;<br />};</p><p>struct node_greater_cmp<br />{<br />bool operator()(const node& a,const node& b)<br />{<br />return a.w > b.w;<br />}<br />};</p><p>struct node_less_cmp<br />{<br />bool operator()(const node& a,const node& b)<br />{<br />return a.w < b.w;<br />}<br />};</p><p>int main()<br />{<br />int i;<br />priority_queue < node, vector<node>, node_greater_cmp > que1;<br />priority_queue < node, vector<node>, node_less_cmp > que2;</p><p> node da[5];<br />for(i = 0;i < 5;i++)<br />{<br />da[i].x = i;<br />da[i].y = i;<br />da[i].w = i;<br /> que1.push(da[i]);<br />que2.push(da[i]);<br />}</p><p>while(!que1.empty())<br />{<br />cout<<que1.top().x<<" "<<que1.top().y<<" "<<que1.top().w<<endl;<br />que1.pop();<br />}<br />cout<<endl;</p><p>while(!que2.empty())<br />{<br />cout<<que2.top().x<<" "<<que2.top().y<<" "<<que2.top().w<<endl;<br />que2.pop();<br />}<br />cout<<endl;<br />return 0;<br />}