-
select
采用Dijkstra算法和Floyd算法实现的简单医院选址系统(data structure)
- 2009-03-11 20:23:09下载
- 积分:1
-
CEIA
POJ141的源代码,以空间换时间,速度很快很好用。(POJ141 the source code for time in space, fast easy to use.)
- 2011-10-25 18:13:24下载
- 积分:1
-
maze
一个苹果走迷宫,支持最短路径寻路。可以使用方向键操作,也可以用户自己添加迷宫格式文件,生成迷宫图。(Apple Maze, shortest path routing. Can use the arrow keys to operate, the user can add their own maze format generated maze.)
- 2012-09-11 21:33:01下载
- 积分:1
-
Figure-topological-sort
说明: 拓扑排序
对一个 有向无环图 G进行拓扑排序,是将G中所有顶点排成一个线性序列,使得图中任
意一对顶点u和v,若u,v ∈E,则u在线性序列中出现在v之前。
通常,这样的线性序列称为满足拓扑次序的序列,简称 拓扑序列 。
注意:
①若将图中顶点按拓扑次序排成一行,则图中所有的有向边均是从左指向右的。
②若图中存在有向环,则不可能使顶点满足拓扑次序。
③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort
In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post
Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before.
Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence.
Note:
(1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing.
(2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence.
(3) a DAG topological sequence usually expressed some scheme is feasible.
)
- 2011-03-22 17:19:14下载
- 积分:1
-
baiji
百鸡算法是一种简单的逻辑算法,通过不同的鸡不同的价钱,得出大鸡小鸡的个数(Typical code for white chicken algorithm)
- 2012-06-02 16:31:30下载
- 积分:1
-
josephus
通过c语言数组算法解决josephus问题,m个人围成一圈,从第一个小孩开始顺时针方向每数到第n个小孩时这个小孩离开,最后剩下的小孩是胜利者。求第几个小孩为胜利者(C language array algorithm to solve the Josephus problem, m individual circle, from the first child began to count clockwise every n children, the child left, and finally the remaining child is the winner. A few kids for victory)
- 2017-11-12 10:30:06下载
- 积分:1
-
BinarySortTree
二叉排序树,可以实现插入,删除,查找,创建功能(Binary sort tree,you can achieve the insert,delete,search,create functional)
- 2009-12-03 10:53:04下载
- 积分:1
-
zuiyouerfenjiansuozhu
最优二叉搜索树问题具有最优子结构性质,即其任意一棵子树都是一棵独立的最优二叉搜索树,所以可以采用动态规划方法,并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)
- 2013-10-10 18:48:17下载
- 积分:1
-
ahuangCD
这个是数据结构课程设计中阿黄的CD的程序代码的工程文件包(This is a data structure curriculum design A yellow CD program code works package)
- 2013-12-21 18:53:00下载
- 积分:1
-
Monkeys-and-peach
Monkeys and peach,Monkeys and peach(Monkeys and peach)
- 2013-09-01 22:06:42下载
- 积分:1