tu.c

来自「数据结构基础学习程序」· C语言 代码 · 共 68 行

#include <stdio.h>
#include <malloc.h>
# define n 8
# define e 9
# define TRUE 1
typedef struct
{char vexs[n];
 int arcs[n][n];//dingdian
}graph;

int visited[n];
graph ga;
void DFS(i)
int i;
{int j;
printf("node:%c\n",ga.vexs[i]);
visited[i]=TRUE;
for(j=0;j<n;j++)
    if((ga.arcs[i][j]==1)&&(!visited[j]))
        DFS(j);
}

void print_graph(graph ga)
{
 int i,j;
 printf("linjie ju zhen:\n");
 printf("vertex\t ");
 for(i=0;i<n;i++)
   printf("%c",ga.vexs[i]);//shuchudingdian
 printf("\n");
 for(i=0;i<n;i++)//shuchu qunazhi juzhen
 {
   printf("\t%c",ga.vexs[i]);
   for(j=0;j<n;j++)
     printf("%d",ga.arcs[i][j]);
	printf("\n");
 }
}

void main()
{
int i,j,k;
//int visited[n];
 int w;
 //clrscr();
printf("please input %d dingdian xulie:\n",n);
 for(i=0;i<n;i++)
	 ga.vexs[i]=getchar();
 for(i=0;i<n;i++)
	 for(j=0;j<n;j++)
		 ga.arcs[i][j]=0;//tu chu shi hua wei 0
printf("please input hang lie quanzhi:\n");
for(k=0;k<e;k++)
 {scanf("%d %d %d",&i,&j,&w);//i wei hang ,j wei lie ,w wei quanzhi
  ga.arcs[i][j]=w;
  ga.arcs[j][i]=w;
  }
printf("linjie juzhen wei:\n");
 print_graph(ga);
printf("shendu bianli jieguo wei:\n");
 printf("please input the number of the point to cover:\n");
 scanf("%d",&i);
DFS(i);
}