weixin_43437546的博客

数据结构—图图的定义与基本术语图：G=(V, E)V: 顶点(数据元素)的有穷非空集合E: 边的有穷集合有向图和无向图：前者边有方向，后者边无方向​ 完全图：任意两个点都有一条边相连无向完全图：一张图中每条边都是无方向的；在无向完全图中；在无向完全图中：n个顶点，有n(n-1)/2条边有向完全图：图中各边都有方向，且每两个顶点之间都有两条方向相反的边连接的图；在有向完全图中：n个顶点，有**n(n-1)**条边稀疏图：有很少的边或弧的图 （e &l

#include<stdio.h>#include<stdlib.h>#include<malloc.h>typedef struct Elment{ int id; char* name;}Data;typedef struct Node{ Data data; struct Node* prior; //指向前驱 stru...

#include<stdio.h>#include<stdlib.h>#include<malloc.h>#define MAX_SIZE 100typedef struct childNode{ int child_id; struct childNode* next;}cNode;typedef struct headNode{ i...

#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<malloc.h>#define MAX_SIZE 100//将子结点设计为链表typedef struct chileNode{ int id; struct chileNode* next...

#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#define MAX_SIZE 100//结点的数据域typedef struct Element{ int id; char* name;}node_ele;//结点的结构typedef struct PNode...

#include<stdio.h>#include<stdlib.h>#include<string.h>int* KMP(char* P);//next数组的推导int* KMP(char* P){ int len = strlen(P); int* next = (int*)malloc(sizeof(int) * len); ...

#include<stdio.h>#include<stdlib.h>typedef struct Elment{ int id; char* name;}Data;typedef struct Node{ Data data; struct Node* prior; //指向前驱 struct Node* next; //指向后...

#include<stdio.h>#include<stdlib.h>#define MAX_SIZE 40typedef struct Data{ int id; char* name;}Data;typedef struct staticList{ Data data; int next; //游标，如果等于0，表示链表结束}s...

#include<stdio.h>#include<stdlib.h>#include<string.h>typedef struct data{ int id; char* name;}data;typedef struct node{ data da; struct node* pNext;}node;node* g_phea...

最近在学数据结构，记录下我写的顺序表#include<stdio.h>#include<stdlib.h>#define MAX_SIZE 255 //顺序表最大容量/* InitList: seqlist : 要初始化的顺序表 Array : 初始化时添加的元素组成的数组 length : 初始化的顺序表的长度*/void InitList(...