最短路径算法#include #include #define MAX 32767 #define ElemType char typedef char VertexData; const int Vn=4; const int En=8; class Graph{ public: VertexData vexs[Vn]; int AdjMatrix[Vn][Vn]; int a[Vn][Vn]; int path[Vn][Vn]; int LocationV(ElemType v); void Floyd(Graph &G,const int Vn
