ZhangYiy

摘要： /*邻接表和队列实现广度优先遍历*/#include<stdio.h>#include<stdlib.h>#include<string.h>#define MAX_VERTEX_NUM 20/*无向邻接表的结构*/typedef struct ArcNode{ /*表节点*/int adjvex; /*邻接点*/struct ArcNode *nextarc;... 阅读全文

摘要： /*邻接矩阵*/#include<stdio.h>#include<stdlib.h>#define INFINITY INT_MAX#define MAX_VERTER_NUM 20typedef enum{DG,DN,UDG,UDM}GraphKind;typedef struct ArcCell{char adj;char info[20];}ArcCell,AdjM... 阅读全文

摘要： /*无向图邻接表的深度优先遍历*/#include<stdio.h>#include<stdlib.h>#define MAX_VERTER_NUM 20typedef struct ArcNode{ /*表节点*/int adjvex; /*邻接点*/struct ArcNode *nextarc; /*指向下一条弧的指针*/}ArcNode;typedef struct... 阅读全文

摘要： /*十字链表实现有向图*/#include<stdio.h>#include<stdlib.h>#define MAX_VERTEX_NUM 20typedef struct ArcNode{int ArcTail,ArcHead; /*分别表示弧尾，弧头*/struct ArcNode * HeadLink, * TailLink; /*分别表示链头，链尾*/}ArcNo... 阅读全文

摘要： /*无向网的邻接表*/#include<stdio.h>#include<stdlib.h>#define MAX_VERTER_NUM 20typedef struct ArcNode{ /*表节点*/int adjvex; /*邻接点*/struct ArcNode *nextarc; /*指向下一条弧的指针*/int Weight;/*该弧相关的信息，如权值*/}Ar... 阅读全文

摘要： /*无向图邻接表*/#include<stdio.h>#include<stdlib.h>#define MAX_VERTER_NUM 20typedef struct ArcNode{ /*表节点*/int adjvex; /*邻接点*/struct ArcNode *nextarc; /*指向下一条弧的指针*/}ArcNode;typedef struct VNode{... 阅读全文

摘要： /*循环队列的初始化，入列，出列，显示*/#include<stdio.h>#include<stdlib.h>#include<string.h>#define QUEUE_INIT_SIZE 100typedef struct queue{int * base;int first;int tail;}Queue;int n;/*记录元素个数*/void In... 阅读全文

摘要： /*实现堆栈的初始化，入栈，出栈*/#include<stdio.h>#include<stdlib.h>#include<string.h>#define STACK_INIT_SIZE 100#define INCREMENT 10typedef struct stack{int * top;int * base;int stacksize;}Stack;i... 阅读全文

摘要： /*双向链表的初始化，添加，删除，显示*/#include<stdio.h>#include<stdlib.h>#include<string.h>typedef struct two_linklist{int num;char name[20];struct two_linklist *next;struct two_linklist *prior;}Two_... 阅读全文

摘要： /*线性链表的初始化，添加，删除，显示*/#include<stdio.h>#include<string.h>#include<stdlib.h>typedef struct listtable{int num;char name[10];struct listtable *next;}ListTable;int n;/*记录成员个数*/struct list... 阅读全文