tests.c

《数据结构-使用C语言》第三版

#include<stdio.h>
#include<string.h>

#define MaxVertex 100
#define MaxValue 10000
#define Max 1000

#include"Search.h"

int main()
{
	int i, j, v, n, x, y, w;
	int visited[100], weight[MaxVertex][MaxVertex];
	while(scanf("%d%d",&n, &v)!=EOF)
	{
		memset(visited, 0, sizeof(visited));
		for(i=0;i<n;i++)
		for(j=0;j<n;j++)
		weight[i][j]=MaxValue;
		
		while(scanf("%d%d%d",&x,&y,&w))
		{
			if(x==0 && y==0)break;
			weight[x][y]=w;
		}
		
		for(i=0;i<n;i++)
		{
			for(j=0;j<n;j++)
			printf("%d ",weight[i][j]);
			printf("\n");
		}
		
		DFS(weight, visited, v, n);
		printf("\n");
		
		memset(visited, 0, sizeof(visited));
		BFS(weight, visited, v, n);
		printf("\n");
	}
	return 0;
}