gth==min)
printf ("The %dnd route\n", psnew1->Num);
psnew1=psnew1->next;
}
printf ("The length of longest route is %d longest routes include:\n", max);
psnew1=head1->next;
while (psnew1!=NULL)
{
if (psnew1->length==max)
printf ("The %dnd route\n", psnew1->Num);
psnew1=psnew1->next;
}
}
}
void convert(int *i, int *j, int k)
{
int *p1, *p2;
p1=i;
p2=j;
if (k==1)
{
*p1=*p1-1;
}
else
{
if (k==2)
{
*p1=*p1-1;
*p2=*p2+1;
}
else
{
if (k==3)
{
*p2=*p2+1;
}
else
{
if (k==4)
{
*p1=*p1+1;
*p2=*p2+1;
}
else
{
if (k==5)
{
*p1=*p1+1;
}
else
{
if (k==6)
{
*p1=*p1+1;
*p2=*p2-1;
}
else
{
if (k==7)
{
&nbs