-
Kruskal
采用Kruskal算法求最小生成树主要数据结构
edgeset GE 存放图中的所有边
int n,int e 存放图中的顶点数与边数
edgeset C 存放生成树中的边
vexlist gv 图中结点的顶点值
adjmatrix s 用来处理图中结点的查找与合并
int m1,m2 一条边上两顶点所属集合的序号
int k 最小生成树中的边数
int d //图中待扫描边元素的下标(For the Minimum Spanning Tree by Kruskal main data structures edgeset GE store all edges in the figure int n, int e store graph vertices and edges edgeset C storage spanning tree edges in the vexlist gv graph node vertex values adjmatrix s used to process graph node to find and merge int m1, m2 an edge belongs to the set number two vertices int k minimum spanning tree edges int d // figure to be Scan edge element subscript)
- 2011-05-17 10:22:56下载
- 积分:1
-
binary-search
此代码为折半查找算法,适用于有序表,欢迎各位下载(This code is the binary search algorithm for ordered lists
)
- 2011-07-06 15:50:17下载
- 积分:1
-
123
校园导航系统
1) 校园景点介:绍介相关景点的有关详细信息。
2) 最佳路线查询:查询校园中任意两点之间所有路线,并提供两点间最短的简单路径。
3) 关节点查询:提供校园图的关节点查询。
4) 多景点最佳路线查询:提供多个景点的最佳线路查询,即求途径这个景点的最佳路径。
(Campus Navigation System 1) campus attractions Introduction: Shao Jie-related attractions for more information. 2) The best route query: Query on campus all the routes between any two points, and provides a simple shortest path between two points. 3) joint points: the key points to provide the campus map queries. 4) The best route queries more attractions: multiple sites to provide the best route queries, that is seeking ways to this spot the best path.)
- 2011-08-25 08:56:05下载
- 积分:1
-
c-language-book
C常用算法程序集,一些C语言的基本算法在里面都可以找到。(this is a very good book about c language,you will find it is very useful in your work.)
- 2011-12-14 23:01:04下载
- 积分:1
-
InverseList
说明: 链表逆转,实现单链表的逆转程序,数据结构(List Inverse)
- 2011-04-04 11:15:58下载
- 积分:1
-
fast_sort
/*快速排序:以待排序元素中的第一个元素作为基准将带排序的元素分为三组
*大于基准元素为一组置于基准值的右边,小于基准值的元素为一组置于基准值的左边,
*基准值为一组,这样就找到了基准元素的位置就确定了
*如此递归调用。直到每一组的low==high,即实现了排序的要求。
*/
(/* Rapid Sort: the first element to be sorted in the element as a basis with with sorting the elements are divided into three groups* is greater than the reference element of a group is placed on the right side of the reference value, smaller than the reference value elements for a group of placed on the left side of the reference value,* reference value, a group, so that the location of the reference element is found it is determined* so recursive call. Until each group of low == high to achieve the requirements of the sort.* /)
- 2012-10-26 21:42:43下载
- 积分:1
-
xiaobaishu
参加数学建模的同学很可能会遇到这套题。本程序采用链表进行编写,很方便地解决了小白鼠问题。(Mathematical modeling of the students participating are likely to encounter this question, the program uses the list to solve the problem of mice, very convenient.)
- 2013-08-29 16:09:43下载
- 积分:1
-
joseph
用链表解决约瑟夫问题。
约瑟夫环是一个数学的应用问题:已知n个人(以编号1,2,3...n分别表示)围坐在一张圆桌周围。从编号为k的人开始报数,数到m的那个人出列;他的下一个人又从1开始报数,数到m的那个人又出列;依此规律重复下去,直到圆桌周围的人全部出列。
其中包括一个实验报告,介绍了编程思路和输出结果截图。(List to resolve Joseph. Josephus is the application of a mathematical problem: Given n individuals (numbered 1, 2, 3, ... n, respectively) sitting around a round table around. From number k people began to count off the number to m the man out of the line his next person and from a number off, the man was out of the line number to m so regularly repeated down until roundtable around of the people all of the columns. Including a lab report describes the programming ideas and output screenshots.)
- 2012-08-27 22:37:52下载
- 积分:1
-
DouglasPeucker
道格拉斯—普克法(Douglas—Peucker)的C++程序(Douglas- Puck method (Douglas-Peucker) of the C++ program)
- 2011-08-28 19:04:29下载
- 积分:1
-
Tetris
使用很好的数据结构,程序运行效率高,界面简洁美观。(Good data structure, high efficiency, simple and beautiful interface.)
- 2013-03-27 10:51:16下载
- 积分:1