-
qiongju
八皇后算法,用的是最简单的穷举法,在VC++6.0上编写的。(Eight Queens algorithm, using the simplest method of exhaustion, in VC++6.0 written on.)
- 2013-08-14 22:21:28下载
- 积分:1
-
48qqqq
主要用栈和树求解骑士问题,用C++语言编写的(The main stack and tree Cavalier Problem Solving with C++ languages)
- 2009-03-21 22:34:39下载
- 积分:1
-
the-shortest-path-of-chart
求有向图的最短路劲,根据所给图的边长和顶点,建立有向图,以邻接表的方式存储,并编写程序求从有向图任一点出发的最短路径(according to the graph with sides and vertex, establish a directed graph, and write a program find the shortest path from one of the point of the chart
)
- 2020-07-16 11:28:50下载
- 积分:1
-
Cpp1
校园导游,可以选择景点序号来了解景点,通过选择两点可计算最短距离和最近路线。(Campus tour guide, you can choose the attractions serial number to understand the attractions of by selecting the shortest distance can be calculated and the recently routes.)
- 2012-06-20 21:57:32下载
- 积分:1
-
SelectSort
选择排序的实现,是一种基本的排序方法,但是时间复杂度相对较大。(Select Sort realization, is sort of a basic, but relatively large time complexity.)
- 2012-09-27 22:38:22下载
- 积分:1
-
xianduan
输入俩条线段的首尾坐标,用于判断俩条线段是否相交的(Used to determine whether the intersection of two line segments)
- 2011-05-22 22:47:16下载
- 积分: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
-
Joseph
说明: 约瑟夫问题,四种解法,分别是静态链表,顺序表两种和循环链表(Joseph problems, the four solution, namely a static list, order form and the cycle of two lists)
- 2010-04-23 08:20:53下载
- 积分:1
-
Online_RandMarkingAlgorithm
本程序解决的是:模拟类似计算机主、缓存的存储结构,当用户请求某个页面时,若某个页面已在缓存中,则直接从缓存中去取,不会产生失误(即未在缓存中命中),否则,就到主存中去取,代价变大。
本程序采用随机标记算法,即在在线标记算法的基础上,对于替换页面时,采用随机从未标记的缓存项中选出一项进行替换。
代码、文档详尽(Addressed in this program are: analog computer-like main, cache storage structure, when the user requests a page, a page in the cache directly from the cache to fetch, does not produce errors (that is, not in the cache in the hit), otherwise, to the main memory to fetch a consideration of larger. This program uses a random marking algorithm, online marking algorithm based on random never mark the cache entry selected a replacement for the replacement page. Code, documentation detailed)
- 2012-09-19 13:01:47下载
- 积分:1
-
lab07
本例主要设计查找的有关算法,例如有序表的查找和顺序标的查找,顺序查找、折半查找及二叉排序树上查找的基本思想和算法实现等。(In this case mainly designed to find the relevant algorithm, such as an ordered list of the find and order the subject to find, sequential search, binary search and binary sort tree to find the basic idea and algorithm.)
- 2013-05-12 22:01:58下载
- 积分:1