数据结构课程设计-拯救007

1.ch0301：拯救007，在VC++6.0环境下测试通过
●文件main.c、graph.c、deque.c、error.c、graph.h、deque.h、error.h：案例源程
序。

编译时需通过应用工程文件（console project）。

●文件input.txt：案例测试输入数据文件；
●文件output.txt：案例测试输出结果文件；
2源代码
#include "Graph.h"
#include "Deque.h"
#include "error.h"
#include <stdlib.h>
#include <stdio.h>
/******读入一个case返回一个Graph，*Bank 记录最短到达河岸的路径******/
Graph read_case(FILE *InFile, int num, Vertex* Bank, Deque D)
{
Graph G = NULL;
Distance JamesJump;
Vertex V;
int x, y;
int i, Times;
*Bank = 0;
fscanf(InFile, "%lf", &JamesJump);
if(CheckForEnd(0, 0, JamesJump + ISLAND_DIAMETER/2.0))
{
for(i = 0; i < (num << 1); i++) /*一步便跳出的情况*/
fscanf(InFile, "%d", &x);
*Bank = 1;
}
else if(num > 0) /* 007必须经过鳄鱼头上的情况*/
{
num += 2;
G = GraphNew(num);
for(i = 2; i < num; i++) /* 第三个node开始是鳄鱼*/
{
fscanf(InFile, "%d", &x);
fscanf(InFile, "%d", &y);
G[i].X = x;
G[i].Y = y;
if(CheckForStart(x, y, JamesJump)) /*判断是否能跳上该点*/
{
G[i].Path = 1; /*007可以跳到*/
G[i].Step = 1; /* 一步*/
if(CheckForEnd(x, y, JamesJump)) /* 判断该点是否能跳出*/
{
*Bank = i; /* 007可以跳出*/
Times = (num - i - 1) << 1;
for(i = 0; i < Times; i++) /* 不必检验其他鳄鱼*/
fscanf(InFile, "%d", &y);
DequeClear(D);
break;
}
else
Inject(i, D); /* 插入该点，并开始下一个检测*/ }
}
while(!IsEmpty(D)) /*只经过一个鳄鱼无法跳出，必须还要跳到其它鳄鱼的情况*/
{
V = Pop(D);
for(i = 2; i < num; i++) /* 从这只鳄鱼跳到其他各个鳄鱼*/
{
if((G[i].Step > G[V].Step + 1)
&& CheckForConnect(G, V, i, JamesJump))
{
G[i].Path = V;
G[i].Step = G[V].Step + 1;
if((G[i].Step < G[*Bank].Step)
&& CheckForEnd(G[i].X, G[i].Y, JamesJump))
*Bank = i;
else
Inject(i, D);
}
}
}
}
return G;
}
/******写出结果，即最短路径******/
void write_result(FILE *OutFile, Vertex Bank, Graph G, Deque D)
{
unsigned int Times, i;
Vertex V;
switch(Bank){
case 0: /* 007无法跳出*/
fprintf(OutFile, "%d\n", -1);
break;
case 1: /* 007可以直接跳出*/
fprintf(OutFile, "%d\n", 1);
break;
default:
Times = G[Bank].Step + 1; /* 跳的步数*/
while(Bank != 1) /* 跟踪路径*/
{
Push(Bank, D);
Bank = G[Bank].Path;
}
fprintf(OutFile, "%d\n", Times); /* 输出*/
for(i = 1; i < Times; i++)
{
V = Pop(D);
fprintf(OutFile, "%d ", G[V].X);
fprintf(OutFile, "%d\n", G[V].Y);
}
}
}
int main(int argc, char *argv[])
{
FILE *in, *out;
Deque D;
int VertexNum;
Graph G = NULL;
Vertex Bank = 0;
in = fopen("input.txt", "r");
if(NULL == in)
{
fprintf(stderr, "Can not open input.txt");
exit(-1);
}
out = fopen("output.txt", "w");
if(NULL == out)
{
fprintf(stderr, "Can not open output.txt");
fclose(in);
exit(-1);
}
D = DequeNew();
while((EOF != fscanf(in, "%d", &VertexNum)) && (0 <= VertexNum))
{
G = read_case(in, VertexNum, &Bank, D); /* 读文件直到结尾*/
write_result(out, Bank, G, D);
if(G)
GraphDelete(G);
}
fclose(in);
fclose(out);
DequeDelete(D);
return 0;
}。