算法分析题6-4和n皇后优先队列式分支限界法
算法分析题6-4和n皇后优先队列式分支限界法
SK6
byzhz
ù´ <3ÆS5O Å { O ©Û£13 ¤6£ ¡À?
ͤù€‘§‰ ’K§ 7g"
{©ÛK6-4
Á?U)C1¯KÚ)0-1 ¯K `kè ª©| .{§¦Ù=¦^ æ5 ;¹(:§ Ø7 ;¤ ) ) mä")µ£1¤©Û
· ò¦^ C++ STL ¥¥ priorityqueue£5¿ )Þ© #include<queue>¤§priority%@ æ"· 3(:¥O\ ¤ Cþtrack5 (: T¹(: ´»"
C1¯K?U (: µ
12
3
4
5
6
7#definenum3structHeapNode{intpriority;//¹(:`k?£þ.¤intlevel;//¹(:3f8䥤? SÒinttrack[num+1];// (: T¹(: ´»};
A priorityqueue ëêcmp¼ê µ
1
2
3
4
5structcmp{booloperator()(HeapNodea,HeapNodeb){returna.priority<b.priority;}};
returna.priority<b.priority; £ ´true §`²a.priority<b.priority§I N aÚb £ùdpriorityqueuegÄ ¤"¤"
æ½ÂXeµ
1priorityqueue<HeapNode,vector<HeapNode>,cmp>
maximumheap;
0-1 ¯K?U (: µ
1
