자료구조 floyd 알고리즘

본문내용

#include
#include
#define MAX 50
int head[MAX][MAX];
void Floyd_alg();
void path(int from,int to);
void pri_mat(int l);
void pri_Pmat(int l);
int P[MAX][MAX];
int gnode,link,x,y,c;
main()
{
FILE *fp;
int start,ende;
if((fp=fopen("graph4.txt","r"))==NULL)
{
printf("!!! FILE open ERRER\n");
return(1);
}
fscanf(fp,"%d %d",&gnode,&link);
for(int t=0;t {
for(int h=0;h {
P[t][h]=-1;
if(t==h)
head[t][h]=0;
else
head[t][h]=10000;
}
}
printf("Input : node[%d] & link [%d]\n",gnode,link);
while(fscanf(fp,"%d %d %d",&x,&y,&c) != EOF)
{
printf("Input link--> (%d,%d,%d)\n",x,y,c);
head[x][y]=c;
}
printf("----------------- mat list ----------------\n");
printf("\t");
for(int j=0;j printf("[%2d]\t",j);
printf("\n");

키워드

floyd,   플로이드,   알고리즘,   자료구조