Tree algorithm, senior data structure must learn a special binary search tree, a...

b tree how to operate on b tr-b tree how to operate on b tr

Interactive SQL Tool

运行环境必须在win9x环境下-operating environment must win9x environment

mapreduce的工具软件。来源为ibm 的技术论坛。-mapreduce software tools. Source for ibm technical forum.

八种排序的方法,利用VC++实现,值得借鉴-eight ranking, using VC, which is worth learning from

数据结构 详细描述了如何创建图的方法以及操作-Data structure described in detail how to create a map of methods and operations

输入以字符串，依顺序表存储，查找一个元素，删除一个元素-Input to a string, depending on the order of tables to store, find an element, delete an element

初学实例:学生选修课及成绩管理系统,部分功能有待改善,菜单部分未完成-Examples of learning: students elective courses and performance management systems, some functions need to be improved, the menu part of the unfinished

一个学生管理系统的常见功能是支持个人的维护和研究信息与有关的一名学生。下面的源代码和例子用于在 Java 中的学生管理系统。 在项目文件部分中列出的源代码和包含在此项目中的文件，请确保列出的源代码，该代码是否满足您的需要那里

用prim算法实验最小生成树 本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树 定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。 定义二维数组g[ ][ ]来建立无向图的邻接矩阵。 -Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.