path.h

校园导游图算法--数据结构中有关图的算法 按v求最短路径 按s求信息； 按q退出； 地图在map图像文件里

#include<iostream.h>
#include<malloc.h>
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
#define MAX 20
typedef int status;
typedef char *string;
typedef struct{
	int vx,vy;
}Edge;
typedef struct{
	Edge edges[MAX];
	int len;
}PathType;
typedef struct{
	string vertices[MAX];
	int num;
}PType;
void InitPath(PathType &pa)
{
	pa.len=0;
}
void copyPath(PathType &p1,PathType p2)
{
	for(int i=0;i<p2.len;i++)
	{
		p1.edges[i].vx=p2.edges[i].vx;
		p1.edges[i].vy=p2.edges[i].vy;
	}
	p1.len=p2.len;
}
void InsertPath(PathType &pa,int v,int w)
{
	pa.edges[pa.len].vx=v;
	pa.edges[pa.len].vy=w;
	pa.len++;
}
int PathLength(PathType pa)
{
	return pa.len; 
}
void OutPath(GraphType g,PathType pa,PType &vtxes)
{
	int m=0;
	VertexType vtx;
	for(int i=0;i<pa.len;i++)
	{
		GetVex(g,pa.edges[i].vx,vtx);
		vtxes.vertices[m++]=vtx.name;
	}
	//GetVex(g,pa.edges[pa.len].vy,vtx);
	vtxes.vertices[m]=vtx.name;
	vtxes.num=m;
}