-
test
使用vc编写的一个动态链接库，测试动态链接库的例程(Vc prepared using a dynamic link library, dynamic link library routine testing)
- 2010-05-28 23:27:09下载
- 积分：1
-
code1
键盘任意输入一组字母或数字生成无序数组，对数组按ASCII顺序进行排序（排序要求至少用两种排序算法），再从键盘输入一个值进行二分查找，返回查找成功或者失败的信息(Keyboard input and a group of letters, or any number of arrays, and generate disordered array sort order according to the ASCII at least two requirements (sort of), sorting algorithms from the keyboard input a value dichotomy, returns to find success or failure of the information)
- 2010-07-14 11:42:56下载
- 积分：1
-
X_bit0mintest
X位赋0mintest是实现芯片功耗测试不确定位填充算法(X-bit chip is to achieve the power conferred 0mintest test uncertain bit stuffing algorithm)
- 2011-07-02 21:37:01下载
- 积分：1
-
03
说明： 《妙趣横生的算法》第三部分原书附带代码程序，绝对属实(" Algorithm for fun," the third part of the original program with the code, the absolute truth)
- 2011-04-24 01:36:18下载
- 积分：1
-
最短路径c++语言
说明： 用从c＋＋写的floyd最短路径算法，可以求邻接矩阵任意两点的最短路径。(from using c++ to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.)
- 2020-09-20 14:07:55下载
- 积分：1
-
Lecture6
数据结构中链式队列和堆栈的循环用法，非常有用(Queue data structure in the chain and the cycle stack usage, very useful)
- 2011-07-27 15:30:29下载
- 积分：1
-
shujujiegoukechengshiji
数据结构课程设计时，所需的封面及任务书版面，希望对大家有点用！(Curriculum design data structure, the necessary task of the book cover and layout, in the hope that we are a bit used!)
- 2008-06-16 18:38:51下载
- 积分：1
-
2007327
带权有向以及无向图的各种操作，适合数据结构初学者使用，是图那一章的重点(belt and the right to have no plans to the various operations, data structure suitable for beginners, is the chief focus of the chapter)
- 2007-04-22 23:49:54下载
- 积分：1
-
paixu
实现冒泡，快速，希尔排序法。并计算，比较他的次数。(Achieve bubbling fast shell sort. And calculate, compare the number of times.)
- 2012-05-21 22:13:12下载
- 积分：1
-
Campus-navigation-problem
校园导航问题，设计你的学校的平面图，至少包括10个以上的景点（场所），每两个景点间可以有不同的路，且路长也可能不同，找出从任意景点到达另一景点的最佳路径（最短路径）。
要求：
（1）以图中顶点表示校园内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等有关信息。
（2）为来访客人提供图中任意景点相关信息的查询。
（3）为来访客人提供任意景点的问路查询，即查询任意两个景点之间的一条最短路径。
（4）修改景点信息。
(Campus navigation problem, the design of your school s plan, at least more than 10 attractions (places), between every two spots can have a different way, and the long road may be different, to find spots to reach from any other attractions best path (shortest path).
Requirements:
(1) graph vertices represent various campus sites, storage sites name, code, profile and other information the side that path, the path length of storage of information.
(2) the figure for visiting any sites offering information about the query.
(3) any attractions for visiting guests ask queries of that query any two of the shortest path between sites.
(4) modify the attractions information.)
- 2011-08-12 10:34:14下载
- 积分：1
