资源列表
define_the_latter_table.txt
- 根据贪心算法，来求解最小生成树； 这种情况，可能求不不全局最优解，但是，可以求出当前情况下的最优解；-According to greedy algorithm to solve the minimum spanning tree this situation, it may not seek the global optimal solution is not, however, you can find the optimal solution under the current si
45666033BiTree
- 实现二叉树的一部分功能，有需要的可以下载来-Part of the realization of binary functions, can be downloaded in need to look at
datastruct
- 一份数据结构的试卷,可惜没有答案,看看也不错,检验一下会不会做!-A data structure of the papers, unfortunately there is no answer, take a look also good to test what it will do!
BinTree
- 数据结构与算法-二叉树的用法。 二叉树的主要算法，声明等。-Data structures and algorithms- the usage of a binary tree. The main binary tree algorithm, statements.
zuidaliu
- 用VC++6.0求算法分析设计中的最大流问题。-Using VC++6.0 analysis of algorithms designed to seek the maximum flow problem.
zuiduanlujing
- 用VC++6.0求算法分析设计中的最短路径问题。-Using VC++6.0 seeking algorithm analysis and design of the shortest path problem.
20070704070229
- 完成数据结构的最小生成树，程序很实用，不需要修改！-The completion of the minimum spanning tree data structure, the program is very useful, do not need to change!
Introduction_to_Algorithms_2nd_Edition
- 是对加快程序运行时间，合理程序类型最有效，最有说服力的一本书-Introduction to Algorithm
Floyd
- Floyd 算法，创建有向图，无向图，有向网，无向网的算法-Floyd algorithm, create a directed graph, undirected graph, directed networks, undirected networks algorithm
kruskal
- 利用克鲁斯卡尔算法求边集数组GE所示图的最小生成树-Order to Kruskal algorithm using an array of GE edge set of minimum spanning tree as shown in Figure
Prime
- Prime 算法，创建有向图，无向图，有向网，无向网的算法-Prime algorithms, to create a directed graph, undirected graph, directed networks, undirected networks algorithm