Miss Z的博客

顺序表基本运算算法(seqlist.cpp)#include <stdio.h>#define MAXL 100 //最大长度typedef int KeyType; //定义关键字类型为inttypedef char InfoType;typedef struct{ KeyType key; //关键字项 InfoType data; //其他数据项，类型为InfoType} RecType; //查找元素的类型void swap(RecType x,RecT

顺序表基本运算算法(seqlist.cpp)#include <stdio.h>#define MAXL 100 //最大长度typedef int KeyType; //定义关键字类型为inttypedef char InfoType;typedef struct{ KeyType key; //关键字项 InfoType data; //其他数据项，类型为InfoType} RecType; //查找元素的类型void CreateList(RecType

Kruskal(克鲁斯卡尔)算法#include "graph.cpp"#define MaxSize 100typedef struct { int u; //边的起始顶点 int v; //边的终止顶点 int w; //边的权值} Edge;void InsertSort(Edge E[],int n) //对E[0..n-1]按递增有序进行直接插入排序{ int i,j; Edge temp; for (i=1;i<n;i++) {

图的基本运算算法(graph.cpp)#include <stdio.h>#include <malloc.h>//图的两种存储结构#define INF 32767 //定义∞#define MAXV 100 //最大顶点个数typedef char InfoType;//以下定义邻接矩阵类型typedef struct{ int no; //顶点编号 InfoType info; //顶点其他信息} VertexType;

二叉树的基本运算算法#include <stdio.h>#include <malloc.h>#define MaxSize 100typedef char ElemType;typedef struct node { ElemType data; //数据元素 struct node *lchild; //指向左孩子节点 struct node *rchild; //指向右孩子节点} BTNode;void CreateBTree(BTNode * &

稀疏矩阵的三元组表示算法#include <stdio.h>#define M 6#define N 7#define MaxSize 100 //矩阵中非零元素最多个数typedef int ElemType;typedef struct{ int r; //行号 int c; //列号 ElemType d; //元素值} TupNode; //三元组定义typedef struct { int rows;

顺序串基本运算的算法#include <stdio.h>#define MaxSize 100typedef struct{ char data[MaxSize]; int length; //串长} SqString;void StrAssign(SqString &s,char cstr[]) //字符串常量赋给串s{ int i; for (i=0;cstr[i]!='\0';i++) s.data[i]=cstr[i]; s.length=i;

顺序栈基本运算算法#include <stdio.h>#include <malloc.h>#define MaxSize 100typedef char ElemType;typedef struct { ElemType data[MaxSize]; int top; //栈指针} SqStack; //顺序栈类型void InitStack(SqStack *&s){ s=(SqStack *)malloc(sizeof(SqS

线性表的应用：两个表的简单自然连接的算法#include <stdio.h>#include <malloc.h>#define MaxCol 10 //最大列数typedef int ElemType;typedef struct Node1 //数据结点类型{ ElemType data[MaxCol]; struct Node1 *next; //指向后继数据结点} DList;typedef struct Node2 //头结点类型{