-
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
-
Mult
说明： 数据结构课上作业实现了一个多项式乘法的功能有注解(Job class data structure implements a polynomial function of multiplication comments)
- 2011-03-20 20:28:31下载
- 积分：1
-
Bigint
利用双向链表实现对两大整数的相加运算。
可以修改数组长度实现更大整数的相加(Realize the use of two-way linked list of integers the sum of the two operations. Can modify the array length to achieve a greater sum of integers)
- 2007-10-18 21:34:06下载
- 积分：1
-
yuesefu
数据结构经典算法 约瑟夫问题 c++ 已经测试通过(josephus c++)
- 2012-12-02 16:23:02下载
- 积分：1
-
chechang
数据结构作业－停车场管理(operating data structure-the car park management)
- 2020-06-26 11:00:02下载
- 积分：1
-
StringClass
这个代码是STRING类的声明及实现,因为我认为C++类库中的string类比较庞大,找一个函数需要很长时间,所以用一个简单明了的代替之.(STRING kind of statement and realized, because I think the C library string of relatively large, a function for a very long time. Therefore, the use of a simple and straightforward replaced it.)
- 2006-05-17 17:46:58下载
- 积分：1
-
jiajianfa
长整数四则运算,利用双向循环链表实现长整数的存储，每个结点含一个整形变量。
(Long integer arithmetic, the use of two-way circular linked list to achieve long integer storage, each node contains an integer variable.)
- 2014-05-29 14:41:51下载
- 积分：1
-
yeschengxu
这是数据结构很重要的程序，主要是课后题的答案，和代码，功能很强大(the data struct of the book)
- 2013-12-22 23:25:14下载
- 积分：1
-
deep-copy
该代码实现了深拷贝的问题，对于深拷贝进行了一系列的介绍，并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)
- 2014-01-03 10:46:48下载
- 积分：1
-
FreeTree
无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)
- 2013-10-29 16:31:47下载
- 积分：1
