수다닷컴

질문 제목 : 프로그램을 실행 시키면 오류가 뜨는데 원인을 모르겠습니다.프로그램을 실행 시키면 저쪽이 오류가 뜨는데 뜨는 이유를 모르겠습니다.질문 내용 :
#include stdio.h
#include conio.h
#define false 0
#define true 1
#define start 0
#define size 8
#define null 0
struct node {
int vertex;
struct node *link;
};
struct node *graph[size];
int visited[size];
{
int i;
for (i = 0; i =7; i++)
visited[i] = false;
clrscr();
init_list();
dfs(start);
}int list()
{
struct node *new_node;
int i;
for(i = 0; i size; i++)
graph[i] = null;
new_node = (struct node*)malloc(sizeof(new_node));
new_node-link = graph[0];
graph[0] = new_node;
new_node-vertex = 2;
new_node = (struct node*)malloc(sizeof(new_node));
new_node-link = graph[0];
graph[0] = new node;
new_node-vertex = 1;
new_node = (struct node*)malloc(sizeof(new_node));
new_node-link = graph[1];
graph[1] = new_node;
new_node-vertex = 4;
new_node = (struct node*)malloc(sizeof(new_node));
new_node-link = graph[1];
graph[1] = new node;
new_node-vertex = 3;
new_node = (struct node*)malloc(sizeof(new_node));
new_node-link = graph[1];
graph[1] = new node;
new_node-vertex = 0;
new_node = (struct node*)malloc(sizeof(new_node));
new_node-link = graph[2];
graph[2] = new node;
new_node-vertex = 6;
new_node = (struct node*)malloc(sizeof(new_node));
new_node-link = graph[2];
graph[2] = new node;
new_node-vertex = 5;
new_node = (struct node*)malloc(sizeof(new_node));
new_node-link = graph[2];
graph[2] = new node;
new_node-vertex = 0;
new_node = (struct node*)malloc(sizeof(new_node));
new_node-link = graph[3];
graph[3] = new node;
new_node-vertex = 7;
new_node = (struct node*)malloc(sizeof(new_node));
new_node-link = graph[3];
graph[3] = new node;
new_node-vertex = 1;
new_node = (struct node*)malloc(sizeof(new_node));
new_node-link = graph[4];
graph[4] = new node;
new_node-vertex = 7;
new_node = (struct node*)malloc(sizeof(new_node));
new_node-link = graph[4];
graph[4] = new node;
new_node-vertex = 1;
new_node = (struct node*)malloc(sizeof(new_node));
new_node-link = graph[5];
graph[5] = new node;
new_node-vertex = 7;
new_node = (struct node*)malloc(sizeof(new_node));
new_node-link = graph[5];
graph[5] = new node;
new_node-vertex = 2;
new_node = (struct node*)malloc(sizeof(new_node));
new_node-link = graph[6];
graph[6] = new node;
new_node-vertex = 7;
new_node = (struct node*)malloc(sizeof(new_node));
new_node-link = graph[6];
graph[6] = new node;
new_node-vertex = 2;
new_node = (struct node*)malloc(sizeof(new_node));
new_node-link = graph[7];
graph[7] = new node;
new_node-vertex = 5;
new_node = (struct node*)malloc(sizeof(new_node));
new_node-link = graph[7];
graph[7] = new node;
new_node-vertex = 4;
new_node = (struct node*)malloc(sizeof(new_node));
new_node-link = graph[7];
graph[7] = new node;
new_node-vertex = 3;
}
int dfs(int v)
{
int w;
visited[v] = true;
printf(visited vertex -- %5d\n, v);
do {
w = graph[v] - vertex;
graph[v] = graph[v] - link;
if(!visited[w]) dfs(w);
} while(graph[v] != null);
}

신청하기