-
picture
图结构有着广泛的应用,本实训主要涉及两个方面的内容:一个是有关图的最短路径问题,用一个交通查询系统例子来验证迪杰斯特拉算法和费洛伊德算法;而另一个则工程项目实施过程中的关键路径问题。(Graph structure has a wide application, the Training involves two main aspects: one is related to map the shortest path problem, using examples of a traffic inquiry system to verify Dijkstra algorithm and fees Lloyd algorithm and the other and one project implementation process of the critical path problem.)
- 2008-05-15 20:40:30下载
- 积分:1
-
LinkNode
这个是C++编译的单链表,其中包括多种链表操作,是很好的学习资料。(This is a C++ compiler single linked list, which includes a variety of linked list operations, is a good learning materials.)
- 2012-09-24 17:22:21下载
- 积分:1
-
permutations
组合数学全排列,包含有六种全排列的方法,字典序法(math of permutations)
- 2011-12-12 10:51:16下载
- 积分:1
-
oracle
oracle数据库的学习资料,分为4天的内容,非常详细、实用(learning materials oracle database is divided into four days of content, very detailed, practical)
- 2013-12-25 23:06:35下载
- 积分:1
-
MFC-ODBC-API-Programming
本例是一个通讯实例,说明如何使用MFC ODBC 创建数据库应用程序。(This example is a communication example, explain how to use ODBC MFC to create a application.)
- 2015-08-05 11:15:07下载
- 积分:1
-
winform分页控件源码,有图有下载
winform分页实例,支持千万级数据量分页
- 2013-09-01下载
- 积分:1
-
condition
一份详细讲述聚类的文章,内容是关系聚类和混合聚类(A detailed article on clustering, on relational clustering and hybrid clustering)
- 2018-11-15 19:45:25下载
- 积分:1
-
数据结构习题解答与考试指导
说明: This book explains data structure exercises
- 2020-06-18 14:00:02下载
- 积分:1
-
Anorldi
关于Arnoldi算法的今年来的中文资料,希望能够给有兴趣编写这方面算法的人提供帮助(Arnoldi algorithm on the Chinese data this year, hoping to write this algorithm are interested in helping people)
- 2011-10-22 10:26:34下载
- 积分:1
-
lovesmerging
游戏初始状态,假设有一段字母序列,其中任意三个相邻的字母不完全相同。游戏开始后,可以添加字母到所述序列的任意位置。一旦出现三个或更多相同的字母相邻,该连续子列就会消 除;如果一次消除发生后,新产生的序列再次满足消除条件,那么消除连锁发生,直到产生的序 列不再满足消除条件。一次输入后,连续消除的过程中,新字母不会产生;新的字母序列稳定 后,可以进行下一次操作。(The initial state of the game, assuming that there is a sequence of letters, where any three adjacent letters are not exactly the same. After the game starts, you can add letters to any position of the sequence. Once the three or more identical letters are adjacent, the consecutive sub-columns are eliminated; if the newly generated sequence satisfies the elimination condition again after a cancellation, the elimination of the chain occurs until the resulting sequence no longer satisfies the elimination condition The After a single input, the new letters are not generated during the continuous elimination process; after the new letter sequence is stable, the next operation can be performed.)
- 2017-10-27 21:37:04下载
- 积分:1