jt.h

交通系统。实现在各个城市之间的交通路线

#ifndef JT_H
#define JT_H

#define False		0
#define True		1
#define INFINITY	10000

typedef struct
{
	int number;
	float expenditure;
	int begintime[2];
	int arrivetime[2];
} Vehide;

typedef struct
{
	Vehide stata[MAX_ROUTE_NUM];
	int last;
} infolist;

typedef struct ArcNode {
	int adjvex;
	struct ArcNode *nextarc;
	infolist info;
} ArcNode;

typedef struct VNode {
	char cityname[10];
	ArcNode  *planefirstarc, *trainfirstarc;
} VNode, AdjList[MAX_VERTEX_NUM];

typedef struct {
	AdjList vertices;
	int  vexnum, planearcnum, trainarcnum;
} ALGraph;

typedef struct Node
{
	int adjvex;
	int route;
	struct Node *next;
} Node;

typedef struct QNode
{
	int adjvex;
	struct QNode *next;
} QNode;

typedef struct
{
	QNode *front;
	QNode *rear;
} LinkQueue;

typedef struct TimeNode
{
	int  adjvex;
	int  route;
	int  begintime[2];
	int  arrivetime[2];
	struct TimeNode *child[MAX_ROUTE_NUM];
} TimeNode, *TimeTree;

struct arc
{
	int   co;
	char  vt[10];
	char  vh[10];
	int   bt[2];
	int   at[2];
	float mo;
} a[MAX_ARC_SIZE];

void InitQueue(LinkQueue *Q);
void EnterQueue(LinkQueue *Q,int x);
void DeleteQueue(LinkQueue *Q,int *x);
int  IsEmpty(LinkQueue *Q);


void createcityfile();
void createplanefile();
void createtrainfile();

void CreateTimeTree(TimeTree p,int i,int j,LinkQueue *Q,infolist (*arcs)[MAX_VERTEX_NUM]);
void CopyTimeTree(TimeTree p,TimeTree q);
void VisitTimeTree(TimeTree p);
void DestoryTimeTree(TimeTree p);

void MinExpenditure(infolist arcs,float *expenditure,int *route);
void MinTime(infolist arcs,int *time,int *route);
void TimeTreeDispose(Node *head, infolist (*arcs)[MAX_VERTEX_NUM]);

void Administer(ALGraph *G);
void initgraph(ALGraph *G);
int  LocateVertex(ALGraph *G,char *v);
void CreateGraph(ALGraph *G);
void save(ALGraph *G);
void cityedit(ALGraph *G);
void EnterVertex(ALGraph *G);
void DeleteVertex(ALGraph *G);
void flightedit(ALGraph *G);
void trainedit(ALGraph *G);
void EnterplaneArc(ALGraph *G);
void EntertrainArc(ALGraph *G);
void DeleteplaneArc(ALGraph *G);
void DeletetrainArc(ALGraph *G);
void UserDemand(ALGraph G);
void DemandDispose(int n,ALGraph G);
void TransferDispose(int k,infolist (*arcs)[MAX_VERTEX_NUM],ALGraph G,int v0,int v1);
void ExpenditureDispose(int k,infolist (*arcs)[MAX_VERTEX_NUM],ALGraph G,int v0,int v1,float *M,int *final);
void TimeDispose(int k,infolist (*arcs)[MAX_VERTEX_NUM],ALGraph G,int v0,int v1,int (*T)[2],int *final);
void PrintGraph(ALGraph *G);

#endif