数据结构中的求强连通分量的源程序，用vc6.0来编写

一个很好的通讯录管理系统-a very good correspondence management system

银行家算法分析报告（ c语言）-bankers algorithm analysis report (c language)

ORACLE数据库得建表语句-ORACLE database built in Table statement

遍历是二叉树经常要遇到的一种操作.可以运用到二叉树结点计数,线索化二叉树,求二叉树的深度,表达式求值等算法中.在遍历的过程中,对结点的访问具有普遍的含义,可以是输出各结点的数据域信息,也可以是对结点作其他处理.另外,通过一次完整的遍历,可使二叉树中结点信息由非线性排列变为某种意义上的线性排列.也就是说,遍历操作使非线性结构线性化. -traverse binary tree is frequently encountered in a operation. Binary Tree can be applied to node count, clues of a binary tree, the binary tree for depth, in the expression evaluates such algorithm. the ergodic process, right node of the visit is universal meaning, it can be output in each node of data domain information, also be on the node for other treatment. Besides, a complete traversal, Binary enables information from the node into a nonlinear with a sense of linear order. In other words, Traversing operation nonlinear structure so linear.

PB仓库管理系统-PB Warehouse Management System

数据结构的运算方法-data structure computing methods

看见有些拿螺旋数字矩阵做考题的，虽然本来也不难，可是你要一着急也许就想不出来了呢:)-see some figures with spiral matrix so many questions, although otherwise it is not difficult, but you may be an anxious not want to come out? :)

约瑟夫环 已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。（有详细注解）数据结构学习的好例子-Joseph ring known n individuals (identified by serial number 1,2,3 ... n, respectively) were sitting around on a round-table. K from the number of people reported a few, a few of the m out of that person him from one of the next person to start off, a few m to another person out and so the law of repetition until around round-table All of the people out. (Detailed notes) data structure to learn a good example of

自己开发的b+树代码,经过本人测试,已经初步通过,有问题请联系我-b own development code tree, after I test, it already passed, please contact the problems I

这是一个数据无向图的简单模拟程序,可以用于数据结构的学习-This is an undirected graph data a simple simulation program that can be used for data structure learning