[완료]C code - free만 쓰면. 코드가 터집니다.. 어떤점이 문제인가요?

#include<stdio.h>
#include<stdlib.h>
#define WHITE 0
#define GRAY -1
#define BLACK 1
 
typedef struct element *eleptr;
typedef struct element
{
	int extend;
	int height;
	int weight;
}element;
typedef struct node *nodeptr;
typedef struct node
{
	int to;
	int w;
	nodeptr link;
}node;
int edgeNum;
 
 
nodeptr tp_header = NULL;
element *inArr =NULL;
nodeptr *listhead =NULL;
 
 
/////////////dfs//////////
int * p = NULL;
int * d = NULL;
int * color = NULL;
int p2[50];
int d2[50];
void dfs_visit(int u);
void dfs();
 
//////////////////
 
nodeptr mknode(int to, int w);
void inputdata();
void mkList();
void printfList();
void DSP();
void relax(int u,int v);
 
int main(void)
{
	int i;
	p=(int*)malloc(sizeof(int)*(edgeNum+2));
	color=(int*)malloc(sizeof(int)*(edgeNum+2));
	d=(int*)malloc(sizeof(int)*(edgeNum+2));
 
	inputdata();
	mkList();
	printfList();
	dfs();
 
	DSP();
	for(i=0;i<edgeNum+2;i++)
	{
		printf("  %d",d2[i]);
	}
	printf("\n");
 
	for(i=0;i<edgeNum+2;i++)
	{
		printf("  %d",p2[i]);
	}
	printf("\n");
	for(i=edgeNum+1;i!=0;i=p2[i])
	{
		printf("  %d",p2[i]);
	}
	printf("\n");
	printf("  %d\n",d2[edgeNum+1]);
 
	free(p);
	free(color);
	free(d);
	free(listhead);
	free(inArr);
 
	return 0;
}
nodeptr mknode(int to, int w)
{
	nodeptr tmp;
	tmp = (nodeptr)malloc(sizeof(node));
	tmp->to=to;
	tmp->w=w;
	tmp->link=NULL;
	return tmp;
}
 
void inputdata()
{
	FILE *fp_input;
	char file_name[30];	
	int i,j;
 
	printf("input ifle name?");
	scanf("%s",file_name);
	fp_input = fopen(file_name,"r");
 
	if(fp_input == NULL)
	{
		fprintf(stderr,"FILE <%s> open error.\n",file_name);
		exit(1);
	}
	fscanf(fp_input,"%d",&edgeNum);
	inArr = (eleptr)malloc(sizeof(element)*(edgeNum+3));
	inArr[0].extend=9999;
	inArr[0].height=0;
	inArr[0].weight=9999;
 
	for(i=1;i<=edgeNum;i++)
	{
		fscanf(fp_input,"%d %d %d",&(inArr[i].extend),&(inArr[i].height),&(inArr[i].weight));
	}
	inArr[edgeNum+1].extend=0;
	inArr[edgeNum+1].height=0;
	inArr[edgeNum+1].weight=0;
}
 
void mkList()
{
	int i,j	;
	nodeptr tmp;
 
 
	listhead = (nodeptr*)malloc(sizeof(nodeptr)*(edgeNum+2));
 
	for(i=0;i<edgeNum+2;i++)
		listhead[i]=NULL;
 
	for(i=0;i<=edgeNum+1;i++)
	{
		for(j=i;j<=edgeNum+1;j++)
		{
			if(inArr[i].extend <inArr[j].extend && inArr[i].weight < inArr[j].weight)
			{// i 의 돌이 j 의 돌보다 작고 가벼우면 j->i 로 연결
				tmp=mknode(i,inArr[j].height);
				if(listhead[j]==NULL)
				{
					listhead[j]=tmp;
				}
				else
				{
					tmp->link=listhead[j];
					listhead[j]=tmp;
				}
			}
			else if(inArr[i].extend >inArr[j].extend && inArr[i].weight > inArr[j].weight)
			{
				tmp=mknode(j,inArr[i].height);
				if(listhead[i]==NULL)
				{
					listhead[i]=tmp;
				}
				else
				{
					tmp->link=listhead[i];
					listhead[i]=tmp;
				}
			}
		}
	}
}
 
void printfList()
{
	int i;
	nodeptr temp=NULL;
 
	for(i=0;i<edgeNum+2;i++)
	{		
		temp=listhead[i];
		printf("from%2d =>",i);
		while(temp!=NULL)
		{
			printf("[to=%2d h=%2d] -->",temp->to,temp->w);
			temp=temp->link;
		}
		printf(" X");
		printf("\n");
	}
}
 
void DSP()
{
	int i;
	nodeptr temp;
	nodeptr temp2;
 
	for(i=0;i<edgeNum+2;i++)
	{
		d2[i]=0;
		p2[i]=NULL;
	}
	d2[0]=0;	
 
	temp=tp_header;
	while(temp!=NULL)
	{
		temp2=listhead[temp->to];
		while(temp2!=NULL)
		{
			relax(temp->to,temp2->to);
			temp2=temp2->link;
		}
		temp=temp->link;
	}		
}
 
void relax(int u,int v)
{
	if(d2[v] < d2[u] + inArr[u].height)
	{
		d2[v] = d2[u] +inArr[u].height;
		p2[v] = u;
	}	
}
 
void dfs()
{
	int i,j;	
	nodeptr temp;
 
	for(i=0;i<edgeNum+2;i++)
	{
		p[i]=-1;
		color[i]=WHITE;
	}
	for(i=0;i<edgeNum+2;i++)
	{
		if(color[i]==WHITE)
		{
			dfs_visit(i);		
		}
	}
 
	printf("TP\n");
	temp=tp_header;
	while(temp!=NULL)
	{
		printf("%3d",temp->to);
		temp=temp->link;
	}
	printf("\n");
}
 
void dfs_visit(int u)
{
	nodeptr temp;
	nodeptr cur = listhead[u];
	color[u] =GRAY;
	while(cur)
	{
		if(color[cur->to]==WHITE)
		{
			p[cur->to] = u;
			dfs_visit(cur->to);
		}
		cur = cur->link;
	}
	color[u]=BLACK;
	temp=mknode(u,0);	
	temp->link=tp_header;
	tp_header=temp;	
}
 
<code>
input
5
25 3 4
4 4 6
9 2 3
16 2 5
1 5 2