-
floy
floyd算法
数据结构
求最短路径(floyd algorithm for data structure for shortest path)
- 2007-11-13 23:39:25下载
- 积分:1
-
migong
这个小程序,使用栈这种数据结构完成迷宫小程序。通过使用0,1手动创建迷宫,然后由程序找到迷宫的出路。主要是对栈的使用。(This little program, use this stack data structure to complete the maze applet. Through the use of 0,1 manually create the maze, and then find a way out of the maze by the program. Mainly use the stack.)
- 2012-10-15 17:23:37下载
- 积分:1
-
StackandQueue
该ppt包含了栈和队列的数据结构及基本操作,同时还有栈的举例(This ppt contains the stack and queue data structure and basic operation, as well as examples of the stack)
- 2013-12-06 21:02:24下载
- 积分:1
-
prim
普利姆算法用来求解最小生成树问题很容易,使得树的最小权值最小。(Prim algorithm used to solve the minimum spanning tree problem is easy, the minimum weight is the lowest of the tree)
- 2012-05-17 09:11:15下载
- 积分:1
-
length
利用佛洛伊德算法计算节点之间的最短路径,用于复杂网络中计算平均路径长度(average path lengh)
- 2011-09-01 11:13:51下载
- 积分:1
-
equation
使用C语言编写解二元一次方程组的源代码用于求解二元一次方程(solve equation set)
- 2014-09-21 23:58:31下载
- 积分:1
-
数据结构基本问题C实现
说明: 一些基本的数据结构问题,用C语言实现,我们学校的上机作业,大家可以参考一下
包括1、Josephu问题 2、一元多项式加法 3、三元组表示的稀疏矩阵的一些操作
4、n阶“魔方”的解法 5、Hanoi塔 6、中缀转后缀 7、二叉排序树 8、快速排序 9、谢尔排序(Some basic data structure problems, implemented in C language, our school homework on the computer, you can refer to it.
Including 1, Josephu Problem 2, Polynomial Addition 3, Some Operations of Sparse Matrix Represented by Triple
4. Solution of Magic Cube of order n 5, Hanoi Tower 6, suffix-to-suffix 7, binary sorting tree 8, fast sorting 9, Shell sorting)
- 2020-06-22 05:40:01下载
- 积分:1
-
Map-four-staining
用不多于四种颜色为地图染色,使相邻的行政区不重色,是计算机科学中著名的“四染色”的典型应用,应用这个思想,是以回溯的算法对一幅给定的地图染色。是对数据结构中栈的应用。(With no more than four colors map staining the adjacent borough is not heavy color, typical applications of computer science "stain" the application of this idea, a backtracking algorithm on a given mapstaining. The application of the stack data structure.)
- 2012-12-05 13:20:37下载
- 积分:1
-
build-empty-linear-form
数据结构空线性表的建立,并附上基本功能:初始化、插入、删除(严格)(Build data structures empty linear form, attach basic functions: initialization, insert, delete (strict))
- 2013-11-29 17:58:44下载
- 积分:1
-
maze1
本程序上层算法采用深度搜索和广度搜索相结合的折中方法,能适合大部分迷宫的最优路径搜索。(This program algorithm using the upper search and breadth first search depth of the combination of this way, for most of the maze can the optimal path search.)
- 2012-05-30 23:50:07下载
- 积分:1