kruskal 그래프 구조 및 실행결과

소개글

kruskal 그래프 구조 및 실행결과에 대한 보고서 자료입니다.

본문내용

* e,struct Edge* pre)
{
if(Rck == 1);
else{
int z=p->vernum == e->LeftVer->vernum;
if(z==1){Rck=1; return;}
if(p->path1 != pre && p->path1 != NULL && p->path1->LeftVer == p && p->path1->passcheck == 1)
Rightcyclecheck(p->path1->RightVer,e,p->path1);
else if(p->path1 != pre && p->path1 != NULL && p->path1->RightVer == p && p->path1->passcheck == 1)
Rightcyclecheck(p->path1->LeftVer,e,p->path1);
if(p->path3 != pre && p->path3 != NULL && p->path3->LeftVer == p && p->path3->passcheck == 1)
Rightcyclecheck(p->path3->RightVer,e,p->path3);
else if(p->path3 != pre && p->path3 != NULL && p->path3->RightVer == p && p->path3->passcheck == 1)
Rightcyclecheck(p->path3->LeftVer,e,p->path3);
if(p->path5 != pre && p->path5 != NULL && p->path5->LeftVer == p && p->path5->passcheck == 1)
Rightcyclecheck(p->path5->RightVer,e,p->path5);
else if(p->path5 != pre && p->path5 != NULL && p->path5->RightVer == p && p->path5->passcheck == 1)
Rightcyclecheck(p->path5->LeftVer,e,p->path5);
if(p->path6 != pre && p->path6 != NULL && p->path6->LeftVer == p && p->path6->passcheck == 1)
Rightcyclecheck(p->path6->RightVer,e,p->path6);
else if(p->path6 != pre && p->path6 != NULL && p->path6->RightVer == p && p->path6->passcheck == 1)
Rightcyclecheck(p->path6->LeftVer,e,p->path6);
if(p->path7 != pre && p->path7 != NULL && p->path7->LeftVer == p && p->path7->passcheck == 1)
Rightcyclecheck(p->path7->RightVer,e,p->path7);
else if(p->path7 != pre && p->path7 != NULL && p->path7->RightVer == p && p->path7->passcheck == 1)
Rightcyclecheck(p->path7->LeftVer,e,p->path7);
if(p->path9 != pre && p->path9 != NULL && p->path9->LeftVer == p && p->path9->passcheck == 1)
Rightcyclecheck(p->path9->RightVer,e,p->path9);
else if(p->path9 != pre && p->path9 != NULL && p->path9->RightVer == p && p->path9->passcheck == 1)
Rightcyclecheck(p->path9->LeftVer,e,p->path9);
if(p->path10 != pre && p->path10 != NULL && p->path10->LeftVer == p && p->path10->passcheck == 1)
Rightcyclecheck(p->path10->RightVer,e,p->path10);
else if(p->path10 != pre && p->path10 != NULL && p->path10->RightVer == p && p->path10->passcheck == 1)
Rightcyclecheck(p->path10->LeftVer,e,p->path10);
if(p->path12 != pre && p->path12 != NULL && p->path12->LeftVer == p && p->path12->passcheck == 1)
Rightcyclecheck(p->path12->RightVer,e,p->path12);
else if(p->path12 != pre && p->path12 != NULL && p->path12->RightVer == p && p->path12->passcheck == 1)
Rightcyclecheck(p->path12->LeftVer,e,p->path12);
}
}
void kruskal(void)
{
int j = 1;
cout <<"Graph----------------------"< cout <<" T cycle "< cout <<"---------------------------"< for(int i = 1 ; i< VN-1 ;)
{
Rightcyclecheck(e[j]->RightVer,e[j],NULL);
Leftcyclecheck(e[j]->LeftVer,e[j],NULL);
if(Lck && Rck){
cout <<" |\t\t"<< "(" << e[j]->LeftVer->vernum <<","<RightVer->vernum<<")"< }
else{
cout <<" "<< "(" << e[j]->LeftVer->vernum <<","<RightVer->vernum<<")"< e[j]->passcheck = 1;
i++;
}
j++;
Lck=0,Rck=0;
}
cout <<"---------------------------"< }

키워드

kruskal,   알고리즘,   크루시컬,   사이클