好好学习天天向上之数据结构 关于dijkstra和floyd算法

代码水平比较渣···

仅供自己存档看啦

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

//直接用邻接矩阵存储

int** graph(){
int n,i,j;
int**m;
scanf("%d",&n);
m=(int**)malloc((n+1)*sizeof(int*));
for(i=0;i<=n;i++)m[i]=(int*)malloc((n+1)*sizeof(int));
for(i=0;i<=n;i++)
	for(j=0;j<=n;j++)
		m[i][j]=1000;
m[0][0]=n;
scanf("%d",&n);
while(n){
	n--;
	scanf("%d%d",&i,&j);
	scanf("%d",&m[i][j]);
}
	return m;
}
void floyd(int **m,int** pathweight){
	int i,j,k;
	//int *visited;
	//visited=(int*)malloc((m[0][0]+1)*sizeof(int));
	for(i=1;i<=m[0][0];i++){
			for(j=1;j<=m[0][0];j++)
			pathweight[i][j]=m[i][j];}
	pathweight[0][0]=m[0][0];
	//visited[a]=1;pathweight[a]=0;
	//min[a]=m[a][1];
	for(j=1;j<m[0][0];j++){
	for(i=1;i<=m[0][0];i++){
	for(k=1;k<=m[0][0];k++){
			if(pathweight[i][k]>pathweight[i][j]+pathweight[j][k])
			pathweight[i][k]=pathweight[i][j]+pathweight[j][k];
	                }

				}
		//visited[j]=1;}
	}
}
void dajkistra(int **m,int* pathweight,int a){
	int i,min,v,j;
	int *visited;
	visited=(int*)malloc((m[0][0]+1)*sizeof(int));
	for(i=0;i<=m[0][0];i++){visited[i]=0;pathweight[i]=m[a][i];}
	pathweight[0]=m[0][0];
	visited[a]=1;pathweight[a]=0;
	//min[a]=m[a][1];
	for(j=1;j<m[0][0];j++){min=1000;
	for(i=1;i<=m[0][0];i++){
		{if(visited[i]==0)
			if(pathweight[i]<min){v=i;min=pathweight[i];}}}
		visited[v]=1;
	for(i=1;i<=m[0][0];i++){
		if(visited[i]==0){
			if(pathweight[i]>min+m[v][i])
			pathweight[i]=min+m[v][i];}
				}
		//visited[j]=1;}
	}
}
void printshortest(int**pathweight){
int i=1,m;
printf("请输入起始点\n");
scanf("%d",&m);
while(i<=pathweight[0][0]){
	if(pathweight[m][i]<1000)printf("该点到%d点的最短路径长 %d\n",i,pathweight[m][i]);
	i++;
    }
}
//没有写dijkstra的输出函数，道理差不多了
int main(){
int**m,i;
m=graph();
int**pathweight;
pathweight=(int**)malloc((m[0][0]+1)*sizeof(int*));
for(i=0;i<=m[0][0];i++)pathweight[i]=(int*)malloc((m[0][0]+1)*sizeof(int));
floyd(m,pathweight);
printshortest(pathweight);
return 0;
}