|
* 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->
|
|
메뉴펼치기
