2018年8月5日
邻接表
摘要： 1 #include 2 #include 3 #include 4 5 #define MaxVertexNodeNumSize 1000 6 #define MaxVertexNodeNameSize 100 7 8 struct VertexBodyNode 9 { 10 char VertexName[MaxVertexNodeNa... 阅读全文
posted @ 2018-08-05 22:00 Asurudo 阅读(231) 评论(0) 推荐(0)
邻接表DFS&&BFS
摘要： 1 #include 2 #include 3 #include 4 5 #define MaxVertexNodeNumSize 1000 6 #define MaxVertexNodeNameSize 100 7 8 struct VertexBodyNode 9 { 10 char VertexName[MaxVertexNodeNa... 阅读全文
posted @ 2018-08-05 22:00 Asurudo 阅读(296) 评论(0) 推荐(0)
最短路径(Floyd-Warshall实现)
摘要： 1 #include 2 #include 3 #include 4 #include 5 6 #define MaxVertexNodeNumSize 1000 7 #define MaxVertexNodeNameSize 100 8 #define INFINITY 10000 9 10 struct VertexBodyNode 11 ... 阅读全文
posted @ 2018-08-05 21:59 Asurudo 阅读(241) 评论(0) 推荐(1)
邻接矩阵
摘要： 1 #include 2 #include 3 #include 4 5 #define MaxVertexNodeNumSize 1000 6 #define MaxVertexNodeNameSize 100 7 8 struct VertexNode 9 { 10 char VertexName[MaxVertexNodeNameSi... 阅读全文
posted @ 2018-08-05 21:59 Asurudo 阅读(253) 评论(0) 推荐(0)
最短路径(Dijkstra实现)
摘要： 1 #include 2 #include 3 #include 4 #include 5 6 #define MaxVertexNodeNumSize 1000 7 #define MaxVertexNodeNameSize 100 8 9 struct VertexBodyNode 10 { 11 char VertexName[M... 阅读全文
posted @ 2018-08-05 21:58 Asurudo 阅读(278) 评论(0) 推荐(0)
最小生成树(Kruskal实现)
摘要： 1 #include 2 #include 3 #include 4 #include 5 6 #define MaxVertexNodeNumSize 1000 7 #define MaxVertexNodeNameSize 100 8 9 struct VertexBodyNode 10 { 11 char VertexName[M... 阅读全文
posted @ 2018-08-05 21:57 Asurudo 阅读(309) 评论(0) 推荐(0)
最小生成树(Prim实现)
摘要： 1 #include 2 #include 3 #include 4 #include 5 6 #define INFINITY 0x3f3f3f3f 7 #define MaxVertexNodeNumSize 1000 8 #define MaxVertexNodeNameSize 100 9 10 struct VertexBodyNode... 阅读全文
posted @ 2018-08-05 21:57 Asurudo 阅读(281) 评论(0) 推荐(0)
拓扑排序(Kahn实现)
摘要： 1 #include 2 #include 3 #include 4 #include 5 6 #define MaxVertexNodeNumSize 1000 7 #define MaxVertexNodeNameSize 100 8 9 struct VertexBodyNode 10 { 11 char VertexName[M... 阅读全文
posted @ 2018-08-05 21:56 Asurudo 阅读(272) 评论(0) 推荐(0)
拓扑排序(DFS实现)
摘要： 1 #include 2 #include 3 #include 4 #include 5 6 #define MaxVertexNodeNumSize 1000 7 #define MaxVertexNodeNameSize 100 8 9 struct VertexBodyNode 10 { 11 char VertexName[M... 阅读全文
posted @ 2018-08-05 21:55 Asurudo 阅读(562) 评论(0) 推荐(0)
二叉树查询节点所在层数
摘要： 1 #include 2 3 typedef int ElementType; 4 5 struct BinarySearchTreeNode 6 { 7 ElementType Element; 8 struct BinarySearchTreeNode *Left; 9 struct BinarySearchTreeNode *Right; 1... 阅读全文
posted @ 2018-08-05 21:54 Asurudo 阅读(1304) 评论(0) 推荐(0)
二叉树的最近公共祖先
摘要： 1 #include 2 3 typedef int ElementType; 4 5 struct BinarySearchTreeNode 6 { 7 ElementType Element; 8 struct BinarySearchTreeNode *Left; 9 struct BinarySearchTreeNode *Right; 1... 阅读全文
posted @ 2018-08-05 21:54 Asurudo 阅读(212) 评论(0) 推荐(0)
二叉树两节点距离
摘要： 1 #include 2 3 typedef int ElementType; 4 5 struct BinarySearchTreeNode 6 { 7 ElementType Element; 8 struct BinarySearchTreeNode *Left; 9 struct BinarySearchTreeNode *Right; 1... 阅读全文
posted @ 2018-08-05 21:53 Asurudo 阅读(436) 评论(0) 推荐(0)
二叉查找树
摘要： 1 #include 2 #include 3 4 #define MaxSize 1000 5 6 typedef int ElementType; 7 8 struct BinarySearchTreeNode 9 { 10 ElementType Element; 11 struct BinarySearchTreeNode... 阅读全文
posted @ 2018-08-05 21:52 Asurudo 阅读(224) 评论(0) 推荐(0)
三种递归遍历二叉树
摘要： 1 #include 2 #include 3 4 typedef int ElementType; 5 6 struct BinarySearchTreeNode 7 { 8 ElementType Element; 9 struct BinarySearchTreeNode *Left; 10 struct BinarySearchTreeN... 阅读全文
posted @ 2018-08-05 21:51 Asurudo 阅读(186) 评论(0) 推荐(0)
AVL树
摘要： 1 #include 2 #include 3 4 #define MaxSize 1000 5 #define MAX(a,b) ( (a) > (b) ? (a) : (b) ) 6 7 //set empty Treenode's height is 0,according to WIKIPEDIA 8 typedef int ElementT... 阅读全文
posted @ 2018-08-05 21:50 Asurudo 阅读(229) 评论(0) 推荐(0)
桶排序
摘要： 1 #include 2 #include 3 4 #define MAXINPUTNUM 5000 5 6 typedef int ElementType; 7 8 void BucketSort(ElementType *Array,int ArrayLen) 9 { 10 int i; 11 int ArrayEnd; 12 int Bu... 阅读全文
posted @ 2018-08-05 21:49 Asurudo 阅读(148) 评论(0) 推荐(0)
栈
摘要： 1 #include 2 #include 3 4 typedef int ElementType; 5 6 struct StackNode 7 { 8 ElementType Element; 9 struct StackNode *Next; 10 }; 11 12 int StackIsEmpty(struct Stac... 阅读全文
posted @ 2018-08-05 21:49 Asurudo 阅读(218) 评论(0) 推荐(0)
快速排序
摘要： 1 #include 2 3 #define CUTOFF 3 4 5 typedef int ElementType; 6 7 void SwapTwoNum(ElementType *Num_1,ElementType *Num_2) 8 { 9 int NumTemp = *Num_1; 10 *Num_1 = *Num_2; ... 阅读全文
posted @ 2018-08-05 21:48 Asurudo 阅读(159) 评论(0) 推荐(0)
插入排序
摘要： 1 #include 2 3 typedef int ElementType; 4 5 void InsertionSort(ElementType *Array,int ArrayLen) 6 { 7 int i,j; 8 ElementType ExtractElem; 9 for(i = 1;i = 0 && ExtractElem < Ar... 阅读全文
posted @ 2018-08-05 21:48 Asurudo 阅读(123) 评论(0) 推荐(0)
归并排序
摘要： 1 #include 2 #include 3 4 typedef int ElementType; 5 6 void _Merge(ElementType *Array,ElementType *TmpArray,int LeftStart,int RightStart,int RightEnd) 7 { 8 int i; 9 int ArrayLen... 阅读全文
posted @ 2018-08-05 21:47 Asurudo 阅读(133) 评论(0) 推荐(0)