-
dijkstra
dijkstra算法,用于寻找已建立图的最短路径,是非常有用的一个算法(Dijkstra algorithm, has been established for finding the shortest path map is a very useful algorithm)
- 2007-07-15 14:14:48下载
- 积分:1
-
migong
简单的迷宫问题,有点土,还望大家多指点指点,在此感激不尽。(????? mad spasm, ? Tang Gao, ? oligonucleotide ??? Ning Ning ? ?, Hitomi ?????.)
- 2008-07-05 00:11:37下载
- 积分:1
-
build_max_heap
最大堆排序算法,C++语言编写,原程序,算法导论(The maximum heap sort algorithm, C++ language)
- 2015-01-26 16:15:21下载
- 积分:1
-
jiaotong
用于课程设计 利用Dijkstra算法进行简单的最短路径查询 (For curriculum design simple shortest path query)
- 2013-03-23 13:06:49下载
- 积分:1
-
hash
使用全排列实现hash,看看吧相信对大家会有些帮助的(Full array hash)
- 2011-08-19 21:25:34下载
- 积分:1
-
FIFO-c
说明: 操作系统先来先服务调度算法模拟(C描述)(Operating a first-come first-served scheduling simulation (C description))
- 2010-04-13 00:02:35下载
- 积分:1
-
LinkedStack
链栈 对于堆栈stack的链式实现 应用指针(linked stack)
- 2012-10-03 17:29:55下载
- 积分:1
-
Dijkstra
迪杰斯特拉算法,数据结构,C语言写的,上大学计算机系会用到的。。。(Dijkstra algorithm, data structures, C language written on the Department of Computer Science will be used. . .)
- 2013-03-06 21:50:34下载
- 积分:1
-
Prim
编程实现Prim算法,基于最小堆数据结构,生成最小代价生成树。
(其中随机生成点和边,形成连通图)
根据输入的顶点数的不同,分析时间复杂度。(Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree.
Generate weighted undirected complete graph for given size n according to the following approach:
1) Randomly generate n points ( ) on a plane
2) Randomly generate k pairs of points as edges of the graph.
3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge.
)
- 2011-06-11 16:28:53下载
- 积分:1
-
jose
约瑟夫环(约瑟夫问题)是一个数学的应用问题:已知n个人(以编号1,2,3...n分别表示)围坐在一张圆桌周围。从编号为k的人开始报数,数到m的那个人出列;他的下一个人又从1开始报数,数到m的那个人又出列;依此规律重复下去,直到圆桌周围的人全部出列。通常解决这类问题时我们把编号从0~n-1,最后结果+1即为原问题的解。
(Josephus (Josephus problem) is the application of a mathematical problem: Given n individuals (with numbers 1,2,3 ... n respectively) sitting around a round table. From the number of people gettin k, number of the m man out of the line he s the next person and a number of gettin number to m the man was out of the line and so the law is repeated until the round table were all out of the column. We numbered 0 ~ n-1, the final result is the original problem solution+1 usually solve these problems.)
- 2015-01-09 17:28:41下载
- 积分:1