-
BiTree
二叉树的设计。包含二叉树结点类的设计以及二叉树的遍历。(Binary tree design. Contains the binary tree node class design, and Binary Tree Traversal.)
- 2008-01-11 10:19:38下载
- 积分：1
-
huffman
使用C语言完成党的霍夫曼编码，主要使用树的数据结构，作为巩固数据结构的练习(Using the C language to complete the party' s Huffman coding, the main use of the tree data structure, data structure as a consolidation exercise)
- 2013-07-15 23:59:47下载
- 积分：1
-
zz
说明： 图的相关操作：建立图，图的遍历，查找元素，删除元素等(Map-related steps: the establishment of map, graph traversal, find elements, delete elements, etc.)
- 2008-07-25 15:20:23下载
- 积分：1
-
Kruskal
克鲁斯卡尔算法思想.cpp
int seekedge(EDGE * (&a), int n)
void bubble(EDGE * (&a), int size)
void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针，a2是最小生成树边集的头指针，k为所要删的边
void storepicture(EDGE * (&a), int n, VERTEX *b, int m) (Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) )
- 2009-06-27 01:43:39下载
- 积分：1
-
jhgrerfgjz
一个简单的求矩阵求逆的c语言算法
一个简单的求矩阵求逆的c语言算法
一个简单的求矩阵求逆的c语言算法(a simple matrix inversion for the C language algorithms for a simple matrix inversion of the c language a simple algorithm The matrix inversion for the C language algorithms for a simple matrix inversion algorithm in C Language)
- 2021-03-29 11:39:11下载
- 积分：1
-
KMP
说明： KMP算法的具体实现，能够在O(n+m)时间内找出字串在父串中的位置，n为父串长度，m为字串长度(KMP in the proposed algorithm, can be O (n+ m) time to find the string in the parent string position, n the parent string length, m for the string length)
- 2010-04-28 16:18:00下载
- 积分：1
-
Maze
实现迷宫搜索程序。迷宫数据从文件输入。输出迷宫路径。
a) 实现从入口到出口的输出顺序；
b) 能否打印行走方向（向左、向右、向前）， 如： 1 先前 2 向右 6 向左 7；
(Maze searching)
- 2011-12-20 20:59:04下载
- 积分：1
-
arrangement
假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。（这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。）
对于给定的k 个待安排的活动，编程计算使用最少会场的时间表。
(Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.)
K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)
- 2014-10-22 11:00:45下载
- 积分：1
-
tt0202
1.建立两个有序得链表（带表头，用头插法）；
//2.写一算法在单链表上实现线性表的ListLength(L)运算。
写一算法将单链表中值重复的结点删除，使所得的结果表中各结点值均不相同。
(1. The establishment of two ordered lists too (with header, with the first interpolation) // 2. To write a method to achieve a single linked linear form of ListLength (L) operations. Write an algorithm to list the value of a single node to delete the duplicate, so the results in the table are not the same as the value of each node.)
- 2010-09-10 10:26:46下载
- 积分：1
-
paixu
实现冒泡，快速，希尔排序法。并计算，比较他的次数。(Achieve bubbling fast shell sort. And calculate, compare the number of times.)
- 2012-05-21 22:13:12下载
- 积分：1
