搜索资源列表
graph_
- //有向图:有向图,无向图基本操作 //运行环境：VC //有向图,无向图基本操作,包括: //1、邻接矩阵 //2、邻接表 //3、深度优先遍历 //4、广度优先遍历 //5、最小生成树 //6、拓扑排序 //7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-//Directed graph: directed graph, undirected graph basic operation// Operating Environme
kd-trees
- 数据结构的选择与算法效率——从IOI98试题PICTURE谈起 高级数据结构：线段树-The choice of data structure and algorithm efficiency- from IOI98 questions about high-level data structure PICTURE: segment tree
tree
- 一个好的tree实现（from sourcecode）-A good tree to achieve (from sourcecode)
B-
- 三阶B-树的节点插入与删除 三阶B-树的节点插入与删除-Third-order B-tree node insertion and deletion of third-order B-tree node insert and delete
TreeListView
- .net开发中的支持树型的GridView控件【转自www.bitsCN.com】-. net Development in support of the GridView control tree carried www.bitsCN.com []
TREE
- 树的基本操作实现。内容包括先序、中序、后序、层次遍历，树的深度等。-Tree to achieve the basic operation. Including first order, in sequence, after the order, the level of ergodicity, the depth of the tree.
suffixtree
- suffix tree and related documents
TREE
- 二叉树的实现，包括前序、中序、后序和层次遍历，输出，计算叶子节点等函数。-Binary tree realization, including the former sequence, in order, after the traversal sequence and levels of output, computing functions, such as leaf nodes.
Tree
- 数据结构中经典的树结构的C++语言描述算法，对于面试中数据结构的理解很有帮助-Data structure in the classic tree structure C++ Language to describe algorithms, data structure for the interview helpful understanding
jstreemenu.doc
- use eclipse+js platform impement tree menu-use eclipse+ js platform impement tree menu
javaalgorithm
- 包括冒泡排序，归并排序，N皇后，最小生成树等经典算法的java实现代码-Including bubble sort, merge sort, N Queen, such as the classic minimum spanning tree algorithm java code
Tree
- 一个C#控件操作实例，入门和深入学习都适用的一个例子--树状视图控件的使用-A C# Controls operation of examples of entry and in-depth study are applicable to a case in point- the use of tree view control
Minium_Spanning_Tree(Kruskal)
- 最小生成树问题 问题描述：若要在ｎ个城市之间架设通讯网络，只需要架设ｎ－１条线路即可。如何以最低的经济代价建设这个通讯网，是一个网的最小生成树问题。 设计要求：利用克鲁斯卡尔算法求网的最小生成树；以文本形式输出生成树中各条边以及它们的权值。 -The issue of minimum spanning tree problem Descr iption: n To set up a communication network between cities, only need to
minimal_spanning_tree(Prims)
- 最小生成树问题 问题描述：若要在ｎ个城市之间架设通讯网络，只需要架设ｎ－１条线路即可。如何以最低的经济代价建设这个通讯网，是一个网的最小生成树问题。 设计要求：利用Prims算法求网的最小生成树；以文本形式输出生成树中各条边以及它们的权值。 -The issue of minimum spanning tree problem Descr iption: n To set up a communication network between cities, only need to
hafuman2
- 此霍夫曼编码可根据自己输入的字符集及频度构建霍夫曼树，利用建好的哈夫曼树生成哈夫曼编码．-This Huffman code can be entered in accordance with their own character set and the frequency of Huffman tree constructed using built Huffman tree generated Huffman.
tree
- 梅花雪树的经典制作，希望大家能够喜欢，同时希望批评指正-Plum Tree Snow classic production, hope that we can like it, I also hope that criticism
RedBlackTree
- 数据结构的红黑树算法，用c语言实现。数据结构课程设计时做的。-Data structure of the red and black tree algorithm, with c language. Data structure courses designed to do.
DT
- 决策树算法的详细介绍和例子，希望有用-A detailed descr iption of decision tree algorithm and examples, I hope useful
heapsort
- A heap is a binary tree satisfying the following conditions: This tree is completely balanced. If the height of this binary tree is h, then leaves can be at level h or level h-1. All leaves at level h are as fa
b_tree16
- 综合2叉树及B+树优点的能根据增删改而分裂或合并的完整程序(现在以8bit(BYTE key)为关键字,可扩充到64bit的double为key,用户数据包现在以float ton表示,可扩充到任意结构struct)-Integrated 2-tree and B tree based on the merits of additions and deletions instead of splitting or merging of the integrity of the procedu