登录

最新会员 最新下载

成为了本站VIP会员

01月05日 00:38

成为了本站VIP会员

2024-12-25 15:38

成为了本站VIP会员

2024-12-25 12:28

成为了本站VIP会员

2024-12-25 12:10

成为了本站VIP会员

2024-12-24 23:54

成为了本站VIP会员

2024-12-24 23:29
已选条件
  1. 编程语言:C++
  2. 代码类别:数据结构
  3. 发布时间:不限
全部撤销
编程语言 更多 收起
代码类别 更多 收起
发布时间
更多选项

1. 1

说明:  数据结构中的顺序表,是其中的一个重要组成部分(The order of the table data structure is an important component of which)

0
下载
115
浏览
2011-05-06发布

2. ASDESGTree-Search

  论文 <A Study of Decision Error in Selective Game Tree Search>(paper <A Study of Decision Error in Selective Game Tree Search>)

2
下载
68
浏览
2011-04-26发布

3. xianxingbiaolianjie

  线性表的链接实现可利用单链表来实现,每个节点存储一个元素。 利用单链表来实现线性表的元素的插入,删除,修改等功能。 (Linear link table can be used to achieve a single linked list to implement, each node stores an element. Using a single linked list to implement elements of the linear table insert, delete, modify, and other functions.)

2
下载
105
浏览
2011-04-26发布

4. eightQueue

  用回溯法,求解八皇后问题。该算法是算法设计与分析的一个常用例题的求解(By backtracking to solve the eight queens problem. The algorithm is algorithm design and analysis to solve a common example)

2
下载
47
浏览
2011-04-25发布

5. 03

说明:  《妙趣横生的算法》第三部分原书附带代码程序,绝对属实(&quot Algorithm for fun,&quot the third part of the original program with the code, the absolute truth)

0
下载
106
浏览
2011-04-24发布

6. skiplist.c.tar

  A skip list is a data structure for storing a sorted list of items, using a hierarchy of linked lists that connect increasingly sparse subsequences of the items. These auxiliary lists allow item lookup with efficiency comparable to balanced binary search trees (that is, with number of probes proportional to log n instead of n).

12
下载
75
浏览
2011-04-20发布

7. josephus

说明:  约瑟夫算法,适合初步学习数据结构的同学了解递归调用的特点(josephus in C language)

0
下载
142
浏览
2011-04-13发布

8. Eight-Digital

说明:  八数码 对任意数字序列重新排序 高级散列函数 MFC基础编程(Eight Digital Reorder the sequence of any number Senior hash function MFC based programming)

0
下载
112
浏览
2011-04-11发布

9. linearlist

说明:  线性链表的定义,遍历,查找,删除,排序。(Linear list definition, traversal, search, delete, sort.)

0
下载
140
浏览
2011-04-07发布

10. fibonaqi

说明:  斐波那契 式子计算,属于算法类的 用于VC6.0++(Fibonacci calculation formulas, algorithms are used to VC6.0++ class)

0
下载
106
浏览
2011-04-07发布

11. c

说明:  c语言链表程序,可用且实用,适合c语言初学者实用(c language program list, available and practical, suitable for beginners)

0
下载
74
浏览
2011-04-06发布

12. InverseList

说明:  链表逆转,实现单链表的逆转程序,数据结构(List Inverse)

0
下载
116
浏览
2011-04-04发布

13. Huffman

说明:  数据结构:Huffman编码。哈夫曼编码是哈夫曼树的一个应用。哈夫曼编码应用广泛,如JPEG中就应用了哈夫曼编码。 哈夫曼树又称最优二叉树,是一种带权路径长度最短的二叉树。(Data structure: Huffman coding. Huffman coding is an application of the Huffman tree. Huffman coding is widely used, such as JPEG in the application of the Huffman coding. Huffman tree, also known as the best binary tree is a weighted shortest path length binary tree.)

0
下载
136
浏览
2011-03-29发布

14. maze

说明:  由数字1和0组成迷宫,0代表可走路径,程序会用坐标的形式给出每一步的走法(Composed by a maze of numbers 1 and 0, 0 to go the path, the program will use the coordinates given in the form of moves at each step)

0
下载
124
浏览
2011-03-27发布

15. ds-labs

说明:  数据结构基本算法实现。包括栈、二叉树基本运算实现,同时包含整数计算器的完整实现。(The basic algorithm data structure. Including implementation of stack, binary tree basic operations, and a complete implementation of an integer calculator.)

0
下载
111
浏览
2011-03-27发布

16. ecs

说明:  二叉树的演示程序。实现了二叉树和哈弗曼树(Binary tree demo program. Implements a binary tree and the tree Hafu Man)

0
下载
123
浏览
2011-03-26发布

17. dataLINKES

说明:  此程序实现了数据结构中链对的建立,插入,删除,排序等操作。(data reverse establish)

0
下载
63
浏览
2011-03-23发布

18. 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. )

0
下载
118
浏览
2011-03-22发布

19. xiao-yuan-dao-you

说明:  设计济南大学校园平面图,所含的景点不少于10个。以图中顶点表示校内各景点,存放景点名称、代号、简介等信息;以边表示路径,存放路径长度等相关信息。 为来访客人提供图中任意景点相关信息的查询。 为来访客人提供图中任意景点的问路查询,即查询任意两个景点之间的一条最短的简单路径。 选作内容: 求校园的关节点。 提供图中任意景点查询,即求任意两点间的所有路径。 校园导游图的景点和道路的修改扩充功能。 扩充道路信息,如道路类别,沿途景色等级,一直可按客人所需分别查询人行路径或车行路径或观景路径。(Design jinan university campus plan, contains at least 10 spots in each vertex said in scenic spots, deposit attractions at the information such as the code name introduction On the path, deposit path length said related information )

1
下载
178
浏览
2011-03-21发布

20. Mult

说明:  数据结构课上作业实现了一个多项式乘法的功能有注解(Job class data structure implements a polynomial function of multiplication comments)

0
下载
110
浏览
2011-03-20发布