火车查询系统提供对城市信息进行编辑（如：添加或删除）的功能。

#include"iostream.h"
#include"stdio.h"
#include"stdlib.h"
#define INFINITY 50000
#define MAX_VERTEX_NUM 25
#define OVERFLOW -1
#define OK 1
#define ERROR 0
#define  STACK_INIT_SIZE 100
#define  STACKINCREMENT 10
typedef struct 
{
char *time[2];            //起始终点时刻
int  banci; //车次
int  money; //车费
}Arc;
typedef struct ArcCell
{
int distance;
Arc Ar[5];
int  banum;             //车次的数量
}AerCell,AdjMatrix[MAX_VERTEX_NUM][MAX_VERTEX_NUM];
typedef struct
{
char *vexs[MAX_VERTEX_NUM];         //顶点向量
AdjMatrix arcs;                        //邻接矩阵
int    vexnum,arcnum;
}MGraph;
typedef struct
{

int *top;
int *base;
int stacksize;
}Stack;

void InitStack(Stack &S)
{
S.base=(int *)malloc(STACK_INIT_SIZE*sizeof(int));
if(!S.base)  exit(OVERFLOW);
S.top=S.base;
S.stacksize=STACK_INIT_SIZE;
}
void Push(Stack &S,int e)
{
if(S.top-S.base>=S.stacksize) 
{
S.base=(int *)realloc(S.base,(S.stacksize+STACKINCREMENT)*sizeof(int));
if(!S.base) exit(OVERFLOW);
S.top=S.base+S.stacksize;
S.stacksize+=STACKINCREMENT;
}
*S.top++=e;
}
int Pop(Stack &S)
{ 
int e;
if(S.top==S.base)  return ERROR;
e=*--S.top;
return e;
}