-
heapsort
说明： 从最后一个非叶子结点开始从后往前进行调整，保证了根下的所有子树都是最大堆，最后对根进行调整，使整棵二叉树为最大堆，保证了根结点为整棵数的最大值点，完成了建堆的过程，再将根结点跟最后一个结点进行交换，如此反复操作，则堆排序就完成了，其中堆排序的过程采用了满二叉树的概念。(From the final of a non-leaf node after the move began to be adjusted to ensure that the root of all sub-tree are the biggest pile, and finally adjusted to the root, so that the largest heap binary tree整棵to ensure that the root node for整棵the maximum number of points, completed the process of building reactors, and then the last root node with a node to be exchanged, and so repeated the operation, then HEAPSORT completed, of which the process of HEAPSORT a full binary tree concept.)
- 2008-11-11 22:53:42下载
- 积分：1
-
Prim
编程实现Prim算法，基于最小堆数据结构，生成最小代价生成树。
（其中随机生成点和边，形成连通图）
根据输入的顶点数的不同，分析时间复杂度。(Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree.
Generate weighted undirected complete graph for given size n according to the following approach:
1) Randomly generate n points ( ) on a plane
2) Randomly generate k pairs of points as edges of the graph.
3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge.
)
- 2011-06-11 16:28:53下载
- 积分：1
-
48qqqq
主要用栈和树求解骑士问题，用C++语言编写的(The main stack and tree Cavalier Problem Solving with C++ languages)
- 2009-03-21 22:34:39下载
- 积分：1
-
tree
使用非递归的方法遍历二叉树，可以直接运行。(
Non-recursive binary tree traversal.)
- 2013-12-04 16:08:43下载
- 积分：1
-
heap
实现栈的基本操作，建栈，进栈，出栈，数据结构实现(To achieve the basic operation of the stack, built stack into the stack, the stack data structure)
- 2013-04-03 11:08:37下载
- 积分：1
-
hellow4
序列二次规划算法，能求解包含约束和无约束的问题，非常方便。(Sequential quadratic programming algorithm to solve constrained and unconstrained contain the problem, very convenient.)
- 2021-01-08 18:18:51下载
- 积分：1
-
xianxinglianbiao
c语言编写链式线性表的初始化，创建，插入删除等操作。(c language chained linear table is initialized, create, insert and delete operations.)
- 2013-11-09 14:30:30下载
- 积分：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
-
a-linked-list-and-related-processing
链表的建立及相关处理，包括排序，删除，初始化，增加，删除等等，且程序已运行通过。(The establishment of a linked list and related processing, including sorting, delete, initialization, increase, delete, etc., and the program has been run through
)
- 2014-01-13 23:56:27下载
- 积分：1
-
1_19
顺序查找和时间 清华大学出版社 《数据结构 c++》 (search in order)
- 2011-02-05 21:56:14下载
- 积分：1
