Floyd（弗洛伊德算法）---每对顶点的最短路径---《数据结构》严蔚敏

// exam1.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include 
#include 
using namespace std;

#define MAXVEX 20
#define INT_MAX 10000

typedef struct ArcNode
{
	int adj;
	void* info;
}ArcNode;

typedef ArcNode AdjMat[MAXVEX][MAXVEX];

typedef struct
{
	int vexnum;
	int arcnum;
	AdjMat am;
}Graph;

void InitGraph(Graph& G)
{
	cout<<"Please enter the number of vertex:"<>G.vexnum;
	cout<<"Please enter the Arc of the graph:"<>vex1>>vex2>>w)
	{
		G.am[vex1][vex2].adj=w;
	}
}


void ShortestPath_FLOYD(Graph G,bool*** &path,int** &D)
{
	path=(bool***)malloc(G.vexnum*sizeof(bool**));
	for(int i=0;i