-
Hash
基于Hash表的程序同源性分析,可以利用本程序进行两个程序源码比较相似度(Homology analysis Hash Table-based program, you can use the program two program source code similarity)
- 2012-11-04 16:45:04下载
- 积分:1
-
point_to_line
计算点到直线的距离.输入两点坐标确定一个直线,再输入一个点的坐标,计算该点到直线的距离.(Calculated point to the straight line distance. Enter the coordinates of two points determine a straight line, and then input the coordinates of a point, to calculate the straight-line distance between points.)
- 2020-11-30 15:09:27下载
- 积分:1
-
SelectSort
选择排序的实现,是一种基本的排序方法,但是时间复杂度相对较大。(Select Sort realization, is sort of a basic, but relatively large time complexity.)
- 2012-09-27 22:38:22下载
- 积分:1
-
Polynomial
Polynomial基于数据结构的思想,文件比较小,可以直接运行(Polynomial based on the idea of data structures, file is relatively small and can be run directly)
- 2013-12-11 11:05:18下载
- 积分:1
-
Well-tested-algorithm
效验算法单循环链表,这些都是实用经典的算法和数据结构(Well-tested algorithm round robin list, these are practical classic algorithms and data structures)
- 2011-08-02 12:20:21下载
- 积分: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
-
AVLTree
好用的平衡二叉树类库,C++类库编写,
好用的平衡二叉树类库,C++类库编写(AVL tree implementation for C++)
- 2009-03-12 12:02:05下载
- 积分:1
-
a-linked-list-and-related-processing
链表的建立及相关处理,包括排序,删除,初始化,增加,删除等等,且程序已运行通过。(The establishment of a linked list and related processing, including sorting, delete, initialization, increase, delete, etc., and the program has been run through
)
- 2014-01-13 23:56:27下载
- 积分:1
-
optional-project-blackjact
经典数据结构作业,黑杰克游戏。要求程序可以连续打10次,每场比赛的赢家,赢得一个点(两点一倍)。在结束的10场比赛为你和电脑打印出的总奖金。(Write a program that simulates a simplified version of the game "BlackJack". A deck of cards numbered 2 to 10, jacks, queens, kings, and aces is used, where jacks, queens and kings are counted as 10s, and aces are either 1 or 11 at your choice. )
- 2012-12-08 11:46:33下载
- 积分:1
-
Nqueen
n皇后问题构造法实现,比起启发式修补运行时间较长。(n Queen realize the issue of construction method, compared to a longer run-time heuristic repair.)
- 2008-05-16 12:45:32下载
- 积分:1