rrent->y+1);
printf ("long %d", current->sign);
p1=(Long1 *) malloc(sizeof(Long1));
p1->Num=Num;
p1->length=current->sign;
p1->next=NULL;
psnew1->next=p1;
psnew1=p1;
if (Num==1)
{
min=current->sign;
max=current->sign;
}
else
{
if (current->sign<min)
min=current->sign;
if (current->sign>max)
max=current->sign;
}
}
current=current->next;
}
printf ("\n");
current=psnewaf->next;
free (current); //尾节点弹出栈
psnewaf->next=NULL;
i=psnewaf->x;
j=psnewaf->y; //回溯
k=psnewaf->mark;
}
goto loop;
}
exit: ;
if (flag==0)
{
printf ("There is no possible route\n");
}
else
{
printf ("There are %d routes in total\n", Num);
printf ("The length of shortest route is %d shortest routes include:\n", min);
psnew1=head1->next;
while (psnew1!=NULL)
{
if (psnew1->len