-
lujing
图的邻接表生成，深度遍历及任意两点间的路径(The adjacency table to generate deep traversal path between any two points)
- 2012-05-22 18:18:29下载
- 积分：1
-
a
说明： 100米比赛排名 C++实现100米比赛排名 C++实现(100m rankings C++, the 100 meters ranks C++,)
- 2010-11-19 23:24:18下载
- 积分：1
-
sgu-499
题意:给你n个数,求出两两组合的最大公约数
类似打素数表的做法
(Meaning of the questions: to give you the number n, find greatest common divisor of a similar combination twenty-two hit the practice table of prime numbers)
- 2011-08-30 21:56:59下载
- 积分：1
-
jgctgu
流水线车间的零件加工排序问题，以达到最优的加工顺序，使加工时间最短或零件后期维护费用最少(Plant parts processing pipeline scheduling problem, in order to achieve optimal machining sequence, so that the processing time of the shortest or least parts later maintenance costs)
- 2014-05-08 01:12:54下载
- 积分：1
-
PrintTheSchedule_DataStructure_Lab4
数据结构试验-打印输出计算机本科专业4年每学期的课表；C++实现；图的邻接表存储结构以及拓扑排序的基本思想(Data structure test- printout computer 4 years of undergraduate per semester timetables C++ achieve basic idea of the adjacency table storage structure and topological sorting)
- 2012-11-24 23:30:41下载
- 积分：1
-
calculation
数据结构计算算术表达式算法，可以计算小数点及较复杂的运算表达式(Data structure algorithms calculate arithmetic expression, we can calculate the decimal point and more complex operations expression)
- 2010-12-24 13:11:25下载
- 积分：1
-
migong
以一个m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有
通路的结论
(To an m* n the long square maze, 0 and 1, respectively maze of paths and obstacles. Design a program, for any set of the maze, find a path from the inlet to the outlet, or the conclusions drawn without passage)
- 2013-06-14 10:24:48下载
- 积分：1
-
ECSBL
说明： 该程序实现二叉树的遍历功能，能够打印出二叉树的节点(The program realization of the binary tree traversal function, is capable of printing out the binary tree node)
- 2008-11-13 15:50:49下载
- 积分：1
-
哈夫曼树解码和编码
哈夫曼树，基本的数据结构，用来编码和解码、用数组作为存储结构实现，
- 2023-04-13 11:00:11下载
- 积分：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
