2008-08-26 22:26
//operator.h
SqList_F Flylist;
SqList_U Userlist;
SqList_T Ticketlist;
/* ********全局变量******* */
HString admin;
int select;
int loc_user;
char ch[10];
int no=1000;
/* ********函数声明******* */
void Loading(); //载入
Status Load_Userlist(); //载入用户信息
Status Load_Flylist(); //载入航班信息
Status Load_Ticketlist(); //载入票信息
Status Login(); //登陆 |
2008-08-26 22:25
//head.h
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
#define UNDERFLOW -3
typedef int Status;
typedef enum {BN, SH, GZ, CD} City;
ty |
2008-08-26 22:18
2008-06-15 18:57
//HuffmanTree.h
typedef struct{
unsigned int weight;
unsigned int parent,lchild,rchild;
}HTNode,*HuffmanTree; //动态分配数组存储赫夫曼树
typedef char** HuffmanCode; |
2008-06-13 12:57
//BiThrTree.h
typedef char TElemType; //基本类型为字符型
typedef enum PointerTag{Link,Thread}; //线索
typedef struct BiThrNode{
TElemType data;
struct BiThrNode *lchild,*rchild; //左右孩子指针
PointerTag LTag,RTag; |
2008-06-12 10:40
//SArray.h
typedef int ElemType; //基本类型为整型
#define MAX_ARRAY_RANG 50 //最大阶数为50
typedef struct{
ElemType *base; //数组元素基址
int n; //数组维数
}SArray; //对称压缩矩阵
Status InitArray(SArray &A,int n); //构造阶数为 |
2008-06-10 18:53
//Array.h
typedef int ElemType; //基本类型为整型
#define MAX_ARRAY_DIM 8 //最大维数为8
typedef struct{
ElemType *base; //数组元素基址
int dim; //维数
int *bounds; //维界基址
int *constants; |
2008-06-10 18:51
//HString.h
typedef struct{
char *ch; //按串长分配存储区
int length; //串长
}HString; //串的堆分配
Status StrAssign(HString &T,char *chars); //生成等于chars的串T
int StrLength(HString S); //串的长度
int StrCompare(HString S,HString T |
2008-06-10 18:48
//SqQueue.h
typedef int QElemType; //基本类型为整型
#define MAXQSIZE 20 //最大队列长度 (可用MAXQSIZE-1)
typedef struct{
QElemType *base; //动态分配存储空间
int front; |
2008-06-05 00:29
//LinkQueue.h
typedef int QElemType; //基本类型为整型
typedef struct QNode{
QElemType data;
struct QNode *next;
}QNode,*QueuePtr;
typedef struct{
QueuePtr front; //队头指针
QueuePtr rear; |
|
|
Flyalay
男, 21岁
江西 赣州
上次登录: 1天前
加为好友
|