#include<STDIO.H>
#include<STDLIB.H>

#define MAX 100
#define MAX_VERTEX_NUM 20

#define CHAR 0
#if CHAR
   typedef char VertexType;
   #define form "%c"
#else
   typedef int VertexType;
   #define form "%d"
#endif

typedef struct ArcNode{
 int    adjvex;
 struct ArcNode *nextarc;
 /*InfoType  *info;*/
}ArcNode;

typedef struct VNode{
 VertexType  data;
 ArcNode   *firstarc;
}VNode, AdjList[MAX_VERTEX_NUM];

typedef struct{
 AdjList   vertices;
 int    vexnum, arcnum;
 int    kind;
}ALGraph;

typedef enum {FALSE, TURE} Boolean;

void CreatALGraph(ALGraph *G)
{
 int i, j, k;
 ArcNode *s;

 printf("请输入顶点数和边数:\n");
 printf("vexnum = ");
 scanf("%d",&(G->vexnum));
 printf("arcnum = ");
 scanf("%d",&(G->arcnum));
 printf("请输入顶点信息:(输入格式:顶点号<CR>)\n");
 for (i = 1; i <= G->vexnum; i++)
 {
  scanf(form,&(G->vertices[i].data));
  G->vertices[i].firstarc = NULL;
 }
 printf("请输入边的信息:(输入格式:i,j)\n");
 for (k = 1; k <= G->arcnum; k++)
 {
  scanf("%d,%d",&i,&j);
  s = (ArcNode*)malloc(sizeof(ArcNode));
  s->adjvex = j;
  s->nextarc = G->vertices[i].firstarc;
  G->vertices[i].firstarc = s;
 }
}

void DFS(ALGraph *G, int v, int visited[])
{
 ArcNode *w;
 int  i;

 printf("%d  ",v);
 visited[v] = TURE;
 w = G->vertices[v].firstarc;
 while(w != NULL)
 {
  i = w->adjvex;
  if(visited[i] == FALSE)
   DFS(G, i, visited);
  w = w->nextarc;
 }
}

void DFSTraverse(ALGraph *G, int n)
{
 int i;
 static Boolean visited[MAX];
 
 for(i = 1; i <= n; i++)
  visited[i] = FALSE;
 for(i = 1; i <= n; i++)
  if(visited[i] == FALSE)
   DFS(G, i, visited);
}

void BFS(ALGraph *G, int v, int visited[])
{
 int queue[MAX], f=0, r=0;
 ArcNode *p;

 printf("%d  ",v);
 visited[v] = TURE;
 queue[0] = v;
 while(f <= r)
 {
  v = queue[f++];
  p = G->vertices[v].firstarc;
  while(p != NULL)
  {
   v = p->adjvex;
   if(visited[v] == FALSE)
   {
    visited[v] = TURE;
    printf("%d  ",v);
    queue[++r]=v;
   }
   p = p->nextarc;
  }
 }
}

void BFSTraverse(ALGraph *G, int n)
{
 int i;
 static int visited[MAX];

 for(i = 1; i <= n; i++)
  visited[i] = FALSE;
 for(i = 1; i <= n; i++)
  if(visited[i] == FALSE)
   BFS(G, i, visited);  
}

void main(void)
{
 ALGraph G;

 CreatALGraph(&G);
 printf("DFS:  ");
 DFSTraverse(&G, G.vexnum);
 printf("\nBFS:  ");
 BFSTraverse(&G, G.vexnum);
}

#include<STDIO.H>
#include<STDLIB.H>

#define OK 1
#define ERROR 0
#define MAX  50
#define MAS  20

/*预编译,若二叉树数据为字符,CHAR为1;若二叉树数据为整数,CHAR为0*/
#define CHAR 1
#if CHAR
   typedef char TElemType;
   TElemType Nil=' ';
   #define form "%c"
#else
   typedef int TElemType;
   TElemType Nil=0;
   #define form "%d"
#endif

typedef struct BiTNode{
 TElemType data;
 struct BiTNode *lchild, *rchild, *parent;
}BiTNode, *BiTree;

int InitBiTree(BiTree T)
{
 if ((T=(BiTNode*)malloc(sizeof(BiTNode))) == NULL)
  return ERROR;
 T->lchild = NULL;
 T->rchild = NULL;
 return OK;
}

BiTNode *CreateBiTree(BiTNode *T)
{
 TElemType ch;

 scanf(form,&ch);
 if (ch == Nil)
  T = NULL;
 else
 {
  T = (BiTNode *)malloc(sizeof(BiTNode));
  if(T == NULL)
   exit(0);
  T->data = ch;
  T->parent = NULL;
  T->lchild = CreateBiTree(T->lchild);
  if(T->lchild)
   T->lchild->parent = T;
  T->rchild = CreateBiTree(T->rchild);
  if(T->rchild)
   T->rchild->parent = T;
 }
 return T;
}

void DestroyBiTreeRecursion(BiTree T)
{
 if (T == NULL)
  return;
 DestroyBiTreeRecursion(T->lchild);
 DestroyBiTreeRecursion(T->rchild);
 free(T);
}

int DestroyBiTreeNoRecursion(BiTree T)
{
 BiTNode *p = T, *temp = T, *stack[MAS];
 int top = 0;
 
 if (T == NULL)
 {
  return ERROR;
  exit(0);
 }
 while (top!=0 || temp!=NULL)
 {
  p = temp;
  while (p != NULL)
  {
   stack[top] = p;
   top++;
   p = p->lchild;
  }
  if (top != 0)
  {
   p = stack[top-1];
   top--;
   temp = p->rchild;
   free(p);
  }
 }
 T = NULL;
 return OK;
}

void PrintTree(BiTNode *T, int i)
{
 if (T!=NULL)
 {
  PrintTree(T->rchild,i+5);
  #if CHAR
   if (T->data!=Nil)
   printf("%*c\n",i,T->data);
  #else
   if (T->data!=Nil)
   printf("%*d\n",i,T->data);
  #endif
  PrintTree(T->lchild,i+5);
  i = i-5;
 }
}

void visit(TElemType e)
{
 printf(form" ",e);
}

void InOrderTraverseRecursion(BiTree T)
{
 if (T == NULL)
  return;
 InOrderTraverseRecursion(T->lchild);
 visit(T->data);
 InOrderTraverseRecursion(T->rchild);
}

void InOrderTraverseStack(BiTree T, void(*visit)(TElemType))
{
 BiTNode *p = T, *stack[MAS];
 int top = 0;

 while (top!=0 || p!=NULL)
 {
  while (p != NULL)
  {
   stack[top] = p;
   top++;
   p = p->lchild;
  }
  if (top != 0)
  {
   p = stack[top-1];
   top--;
   visit(p->data);
   p = p->rchild;
  }
 }
}

int BiTreeDepth(BiTree T)
{
 int  u, v;
 
 if (T == NULL)
  return 0;
 u = BiTreeDepth(T->lchild);
 v = BiTreeDepth(T->rchild);
 if (u > v)
  return (u+1);
 return (v+1);
}

void main(void)
{
 int i;
 BiTree T = NULL;

CREATE: InitBiTree(T);
 #if CHAR
  printf("按先序输入二叉树(如:AB   表示A为根结点,B为左子树的二叉树)\n");
 #else
  printf("按先序输入二叉树(如:12000表示1为根结点,2为左子树的二叉树)\n");
 #endif
 T = CreateBiTree(T);
 printf("建立的二叉树为:\n");
 PrintTree(T,5);
 do{
  printf("------------------------------------------");
  printf("\n     命令菜单");
  printf("\n  1  重新建立二叉树");
  printf("\n  2  二叉树的释放(递归)");
  printf("\n  3  二叉树的释放(非递归)");
  printf("\n  4  二叉树的深度(递归)");
  printf("\n  5  二叉树中序遍历(递归)");
  printf("\n  6  二叉树中序遍历(非递归)");
  printf("\n  0    退出");
  printf("\n------------------------------------------");
  printf("\n");
  printf("输入命令:");
  scanf("%d",&i);
  switch(i)
  {
  case 1:
   if (T != NULL)
   {
    DestroyBiTreeNoRecursion(T);
    goto CREATE;
   }
   else
    goto CREATE;
   break;
  case 2:
   if (T != NULL)
   {
    DestroyBiTreeRecursion(T);
    T = NULL;
   }
   else
    printf("二叉树不存在,无法释放!\n");
   break;
  case 3:
   if (T != NULL)
   {
    DestroyBiTreeNoRecursion(T);
    T = NULL;
   }
   else
    printf("二叉树不存在,无法释放!\n");
   break;
  case 4:
   if (T != NULL)
   {
    printf("二叉树的深度为:");
    printf("%d\n",BiTreeDepth(T));
   }
   else
    printf("二叉树不存在,无法侧深度!\n");
   break;
  case 5:
   if (T != NULL)
   {
    printf("中序遍历(递归)结果为:\n");
    InOrderTraverseRecursion(T);
   }
   else
    printf("二叉树不存在,无法遍历!\n");
   break;
  case 6:
   if (T != NULL)
   {
    printf("中序遍历(非递归)结果为:\n");
    InOrderTraverseStack(T, visit);
   }
   else
    printf("二叉树不存在,无法遍历!\n");
   break;
  case 0:
   exit(0);
  default:
   printf("命令参数有误!\n");
  }
  printf("\n");
 }while(i>0&&i<7);
}

#include<STDLIB.H>
#include<STDIO.H>
#include<STRING.H>
#define OK 1
#define ERROR 0

typedef struct QNode{
 int case_num;
 struct QNode *next;
}QNode, *QueuePtr;

typedef struct{
 QueuePtr front;
 QueuePtr rear;
}LinkQueue;

QNode *InitQueue(LinkQueue *Q)
{
 Q->front = Q->rear = (QueuePtr)malloc(sizeof(QNode));
 if (!Q->front)
  return NULL;
 else
 {
  Q->front->next = NULL;
  return Q->front;
 }
}

int DestroyQueue(LinkQueue *Q)
{
 while (Q->front)
 {
  Q->rear = Q->front->next;
  free(Q->front);
  Q->front = Q->rear;
 }
 return OK;
}

int EnQueue(LinkQueue *Q, int num)
{
 QNode *p;

 p = (QueuePtr)malloc(sizeof(QNode));
 if (!p)
  return ERROR;
 else
 {
  p->case_num = num;
  p->next = NULL;
  Q->rear->next = p;
  Q->rear = p;
  return OK;
 }
}

int DeQueue(LinkQueue *Q, int *num)
{
 QNode *p;
 
 if (Q->front == Q->rear)
  return ERROR;
 p = Q->front->next;
 *num = p->case_num;
 Q->front->next = p->next;
 if (Q->rear == p)
  Q->rear = Q->front;
 free(p);
 return OK;
}

int PrintQueue(LinkQueue *Q)
{
 QNode *p;

 p = Q->front->next;
 while (p != Q->rear)
 {
  printf("%d\t",p->case_num);
  p = p->next;
 }
 printf("%d",Q->rear->case_num);
 printf("\n");
 return OK;
}

void main(void)
{
 QNode *p = NULL;
 LinkQueue Q;
 char cmd[10] = {0};
 int num = 0;
 
 while (1)
 {
  printf("输入对病人队列的操作命令:\n\t如:创建creat,增加queue,就诊start,停止stop,下班quit\n");
  scanf("%s",&cmd);
  if (strcmp(cmd, "creat") == 0)
  {
   p = InitQueue(&Q);
   if (p != NULL)
   {
    printf("依次输入已排队病人的病历号:以'0'作为结尾\n");
    scanf("%d",&num);
    while (num != 0)
    {
     EnQueue(&Q, num);
     scanf("%d",&num);
    }
    PrintQueue(&Q);
   }
   else
    printf("队列初始化失败!\n");
  }
  else if (strcmp(cmd, "queue") == 0)
  {
   if (p != NULL)
   {
    printf("输入队列中新增病人的病历号:");
    scanf("%d",&num);
    EnQueue(&Q, num);
    PrintQueue(&Q);
   }
   else
    printf("队列未初始化!\n");
  }
  else if (strcmp(cmd, "start") == 0)
  {
   if (p != NULL)
   {
    DeQueue(&Q, &num);
    printf("病历号为%d的病人就诊后的队列:\n",num);
    PrintQueue(&Q);
   }
   else
    printf("队列未初始化!\n");
  }
  else if (strcmp(cmd, "stop") == 0)
  {
   if (p != NULL)
   {
    printf("停止增加排队后的队列:\n");
    PrintQueue(&Q);
   }
   else
    printf("队列未初始化!\n");
  }
  else if (strcmp(cmd, "quit") == 0)
  {
   if (p != NULL)
    DestroyQueue(&Q);
   return;
  }
  else
   printf("输入的命令有误!\n");
 }
}

#include<STDIO.H>
#include<STRING.H>
#include<STDLIB.H>

typedef struct list{
 int data;
 struct list *next;
}LD;

LD *creat(int *size)
{
 LD *head;
 LD *p1,*p2;

 *size = 0;
 printf("输入数据并以'-1'作为结束标志:\n");
 p1=p2=(LD*)malloc(sizeof(LD));
 head = NULL;
 while (p1->data != -1)
 {
  (*size)++;
  if (*size == 1)
   head = p1;
  else
   p2->next = p1;
  p2 = p1;
  p1 = (LD*)malloc(sizeof(LD));
  scanf("%d",&p1->data);
 }
 p2->next = NULL;
 (*size)--;
 return head;
}

LD *find(LD *head, int num)
{
 int find_num;
 LD *p;

 p = head;
 for (find_num = 0; p->next != NULL; find_num++)
 {
  if (find_num != num)
   p = p->next;
  else
   return p;
 }
 if ((p->next == NULL) && ((find_num--) == num))
  return p;
 else
 {
  printf("超出链表范围!");
  p = NULL;
  return p;
 }
}

void insert(LD *p, int insert_data, int *size)
{
 LD *new_data;

 new_data = (LD*)malloc(sizeof(LD));
 new_data->data = insert_data;
 new_data->next = p->next;
 p->next = new_data;
 (*size)++;
}

void del(LD *head, LD *p, int num, int *size)
{
 LD *p0;
 
 p0 = find(head,num-1);
 p0->next = p->next;
 free(p);
 (*size)--;
}

void print(LD *head)
{
 LD *p;

 printf("链表数据:");
 p = head->next;
 if (head != NULL)
  do{
   printf("%d\t",p->data);
   p = p->next;
  }while (p != NULL);
 printf("\n");
}

void main(void)
{
 char s[10] = {0};
 int size = 0;
 int num = 0;
 int insert_data = 0;
 LD *head = NULL, *p, *temp;

 while(1)
 {
  
  printf("输入对单链表操作的命令:(如:creat, free, find, insert or delete)\n");
  scanf("%s",&s);
  if (strcmp(s,"creat") == 0)
  {
   head = creat(&size);
   if (head != NULL)
    print(head);
   else
    printf("初始化链表失败!\n");
  }
  else if (strcmp(s,"free") == 0)
  {
   if (head != NULL)
   {
    temp = (LD*)malloc(sizeof(LD));
    for (p = head; p->next != NULL; p = temp->next)
    {
     temp->next = p->next;
     free(p);
     size--;
    }
    free(p);
    size--;
    free(temp);
    print(head);
   }
   else
    printf("链表不存在,无法进行查找操作!\n");
  }
  else if (strcmp(s,"find") == 0)
  {
   if (head != NULL)
   {
    printf("输入查找节点的序号:");
    scanf("%d",&num);
    p = find(head,num);
    printf("查找的节点数据为:%d\n",p->data);
   }
   else
    printf("链表不存在,无法进行查找操作!\n");
  }
  else if (strcmp(s,"insert") == 0)
  {
   if (head != NULL)
   {
    printf("输入插入的数据:");
    scanf("%d",&insert_data);
    printf("输入插入节点的前驱节点序号:");
    scanf("%d",&num);
    p = find(head,num);
    if (p != NULL)
    {
     insert(p,insert_data,&size);
     print(head);
    }
    else
     ;
   }
   else
    printf("链表不存在,无法进行插入操作!\n");
  }
  else if (strcmp(s,"delete") == 0)
  {
   if (head != NULL)
   {
    printf("删除节点的序号:");
    scanf("%d",&num);
    p = find(head,num);
    if (p != NULL)
    {
     del(head,p,num,&size);
     print(head);
    }
    else
     ;
   }
   else
    printf("链表不存在,无法进行删除操作!\n");
  }
  else
   printf("输入的命令参数有误!\n");
  printf("链表节点总数:%d\n",size);
 }
}