最小生成树MFC实现 - 百度文库

ʱ : һ 最小生成树MFC实现 - 百度文库ϿʼĶ

for(int j=0;j

G.arcs[i][j].adj=*(*(q+i)+j)-48; //úȨڽӾG.arcs[i][j] /*if(Check_Arcs(G)!=1||Check_Num(G,m_Input)!=1) {

::MessageBox(NULL,_T(\ʽ\ʾ\ } else { */ MiniSpanTree_PRIM(G, 0); i=0; int j=0,m=0; CString str; m_tree.ModifyStyle(0,TVS_LINESATROOT|TVS_HASBUTTONS|TVS_HASLINES);

m_tree.DeleteAllItems();//߼Ӽŵʾ HTREEITEM hTREEITEM[10];

hTREEITEM[m]=m_tree.InsertItem(_T(\Ľṹ\m++;

str=closed[0].top;

hTREEITEM[m]=m_tree.InsertItem(str,hTREEITEM[m-1]); m++;

str=closed[0].base;

hTREEITEM[m]=m_tree.InsertItem(str,hTREEITEM[m-1]); m++;

for(i=1;i<(G.vexnum-1);i++) { for(j=0;j

else { str=closed[i].base; hTREEITEM[m]=m_tree.InsertItem(str,hTREEITEM[j+2]); m++; break; } } } } m_tree.Expand( hTREEITEM[0],TVE_EXPAND ); UpdateData(false); } /* 0 a b c a 0 2 3 b 2 0 6 c 3 6 0 */

ϵͬͷxxxxx#qq.com(#滻Ϊ@)