testsearch.c

来自「《数据结构-使用C语言》第三版」· C语言 代码 · 共 47 行

#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>

typedef int DataType;
#define MaxSize 100
#define MaxVertices 10
#define MaxEdges 100
#define MaxWeight 10000
#define MaxQueueSize 100
#define MaxStackSize 100

#include"AdjMGraph.h"
#include"AdjGraphSearch.h"

DataType a[]={'A','B', 'C', 'D', 'E','F'};
void Visit(DataType item)
{
	printf("%c   ",a[item]);
}

int main()
{
	AdjMGraph g1; 
	int aa[]={0,1,2,3,4,5};
	RowColWeight row[]={{0,1,10},{0,4,20},{1,3,30},{2,1,40},{3,2,50},{0,5,30}};
	int n=6, e=6;
	
	CreatGraph(&g1, aa, n, row, e);
	//printf("%d\n",g1.Vertices.size);
	
	printf("DepthFirstSearch ");
	DepthFirstSearch(g1,Visit);
	
	printf("\nBroadFirstSearch ");
	BroadFirstSearch(g1,Visit);
	
	printf("\nBDepthFirstSearch ");
	BDepthFirstSearch(g1,Visit);
	
	printf("\nNo_DepthFirstSearch ");
    No_DepthFirstSearch(g1,Visit);
	
	getchar();
	return 0;
}