弗洛伊德使用邻接矩阵建立有向图求最短路

#include
using namespace std;
typedef struct Graph{
	char a[100];
	int juzhen[100][100];
	int vex,edge;
}Graph;
int Locate(Graph &p,char a);
void CreatGraph(Graph &p);
void dayin(Graph &p);
int Locate(Graph &p,char a){
	int b=p.vex;
	int c;
	for(c=0;cdine[i][k]+dine[k][j]){
					dine[i][j]=dine[i][k]+dine[k][j];
					path[i][j]=path[k][j];
				}
			}
		}
	}
	for(b=0;b0;k--){
						printf("%c->",p.a[b1[k]]);
					}
					printf("%c 长度为:%d\n",p.a[b1[0]],dine[b][c]);
				}
			}
		}
	}
}
int main(){
	Graph p;
	CreatGraph(p);
	Floy(p);
	//dayin(p);
	return 0;
}