-
Haffman
将一组数组转换为哈夫曼编码,使用数据结构中的二叉树功能实现(Convert an array to Haffman code)
- 2016-01-30 14:56:20下载
- 积分:1
-
suanfa
插入排序与合并排序的算法比较,比较两种算法的优劣(Comparison of insertion sort and merge)
- 2011-12-13 22:28:33下载
- 积分:1
-
Graph
采用邻接矩阵实现有向网的存储,建立有向网,并实现单源最短路径算法。(The realization of the use of adjacency matrix to the network storage, the establishment of the network, and to achieve single-source shortest path algorithm.)
- 2007-12-25 16:55:03下载
- 积分:1
-
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
)
- 2011-03-21 19:54:06下载
- 积分:1
-
PrintTheSchedule_DataStructure_Lab4
数据结构试验-打印输出计算机本科专业4年每学期的课表;C++实现;图的邻接表存储结构以及拓扑排序的基本思想(Data structure test- printout computer 4 years of undergraduate per semester timetables C++ achieve basic idea of the adjacency table storage structure and topological sorting)
- 2012-11-24 23:30:41下载
- 积分:1
-
heapSort.cpp.tar
这是一个堆排序的算法源程序,算法被单独写成一个函数,希望对大家有用(This is a heap sort algorithm source code, algorithms are written as a separate function, we hope to be useful)
- 2013-12-12 14:52:48下载
- 积分:1
-
vbsort
vb实现的排序算法演示vb实现的排序算法演示.冒泡、选择、折半等多种排序算法(vb sort demodemodemodemodemovb sort demodemodemodemodemo)
- 2011-10-09 10:21:28下载
- 积分:1
-
BeiDa_ACM1702
北大ACM1702题 转换为3进制
很经典(NULL)
- 2009-12-08 11:31:40下载
- 积分:1
-
chessboard-distance
一道poj上的问题的解答,棋盘上的距离问题。即实现棋盘上从一个点移动到王,后,兵之间最短步数的解答。(A poj answers to your questions on the chessboard distance problem. That is, move from one point to the king on the board, after the shortest number of steps between the soldiers answer.)
- 2012-06-20 10:10:45下载
- 积分:1
-
backtrackng
给定n种物品和一背包。物品i的重量是wi>0,价值为vi>0,背包的容量为c。选择装入背包的物品,使得装入背包中物品的总价值最大。(Given n kinds of goods and a backpack. Weight of the item i is wi> 0, the value of vi> 0, knapsack capacity c. Select the items into the backpack, so into the backpack of items in the total value of the maximum.)
- 2017-01-01 17:51:23下载
- 积分:1