-
FreeTree
无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)
- 2013-10-29 16:31:47下载
- 积分：1
-
sort
归并排序,复习排序算法，在不同环境下，寻找时间复杂度最少的排序算法(
Merge sort, review sorting algorithm, in different contexts, looking for the least time complexity of sorting algorithm)
- 2013-11-05 22:15:57下载
- 积分：1
-
tu
说明： 、实验目的
1 熟练掌握各种内排序方法，深刻理解排序算法及其执行过程；
2 学会分析各种内排序算法的性能；
3 了解各种排序方法的优缺点，对于实际问题能够选择一种较好的排序方案；
4 熟练掌握图的存储结构；
5 掌握图的邻接矩阵和邻接表表示分别进行深度和广度优先搜索遍历的算法。
6 了解图的最小生成树算法。
(Proficiency in the order of search, binary search and index search basic search algorithm, these algorithms are familiar with what kind of storage structure suitable for implementation two master binary sort tree characteristics, building methods, and dynamic search algorithm 3 master hash table of characteristics and construction methods.)
- 2009-12-30 21:15:29下载
- 积分：1
-
EightQueens
数据结构与程序设计中的重点例子程序：八皇后问题(Data structure and procedures of the focus of the design example of the procedure: eight queen problem)
- 2009-06-29 14:52:11下载
- 积分：1
-
nuaa1507_DancingLink_trackback.cpp
高德纳发明的高效数据结构dancing link，这里是解重复覆盖问题的一个演示(Donald Knuth invented efficient data structure dancing link, here is the solution to repeat coverage of a demonstration)
- 2010-03-07 10:54:32下载
- 积分：1
-
Josephus
实现约瑟夫问题的4种算法，并有计时功能进行效率测试(4 algorithms to resolve Josephus Problem with timing counter for testing efficiency)
- 2012-12-20 12:36:46下载
- 积分：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
-
duilie
队列的一般数据结构 队列的创建 删除 修改 取数据等等(The general data structure queue queue to take the data and so create delete modify)
- 2010-09-08 14:36:38下载
- 积分：1
-
11组表达式求值
设计一个表达式求值的程序。该程序必须可以接受包含（，），+，-，*，/的中缀表达式，并求出结果。如果表达式正确，则输出表达式的结果；如果表达式非法，则不输出或输出其他字符。(Design an expression evaluation procedures. The program must accept (,), including +, -, *, / the infix expression, and the results obtained. If the expression is correct, the output of the expression is output; if the expression is illegal, no other characters are output or exported.)
- 2017-06-14 15:06:29下载
- 积分：1
-
binarytree
二叉树的操作，涉及到三种顺序的遍历，树的凹入表示法，转化为一维数组储存，节点的计数，以及中序线索化。(Binary operation, involving three kinds of the order of traversal, tree concave representation into a one-dimensional array of storage, the node count, as well as in the threaded sequence.)
- 2011-05-24 20:31:13下载
- 积分：1
