图的邻接矩阵存储结构 图的优先深度遍历

伙伴系统:avail[0..m]为可利用空间表, n为申请分配量, 若有不小于n的空闲块, 则分配相应的存储块, 并返回其首地址,否则返回NULL -Partner system: avail [0 .. m] can be used for table space, n for the distribution of the volume of applications, if n is not less than the free block, then the distribution of the corresponding storage block, and return to its first address, otherwise return NULL

倒置一个单链表，链表是带有头结点的单链表，通过不断在表头插入结点，使链表有序-Inversion of a single linked list, linked list is the first node with a single list, through constant head inserted in the table node, so that an orderly list

vb数据库编程资料，对于想要学习数据库编程的朋友有一定帮助-vb database programming information, want to learn database programming will certainly be helpful to have friends

这是一个用链表实现的简单的学生管理程序,有链表的插入删除等各种操作-This is a linked list with the simple realization of student management procedures, delete, insert Chain various operations

将内存中的一段数据拷贝到另外一段内存中，要考虑其中的内存覆盖问题。-A section of the memory to copy data to another section of memory, it is necessary to take into account the memory coverage problems.

医药及销促系统，自带数据库-medicine and promote sales systems, onboard database

先输入矩阵的维数，再输入该矩阵，然后通过该算法从大到小输出该矩阵的各行各列和主辅对角线的和-First dimension of input matrix, and then enter the matrix, and then through the smallest of the algorithm output lines of the matrix columns and the main diagonal and Des

二叉树的先序，中序，后序，按层遍历算法。以中序输入，用‘#’代替叶子节点的子节点输入。-binary tree first sequence, sequence after sequence, layer by traversal algorithm. The order to import, use "#" instead of the leaf nodes for input nodes.

数据结构课程的电子教案，很好，很精彩，为初学者的好帮手。-Electronic data structure course lesson plans, very good, very exciting, a good helper for beginners.

检查堆栈值的 C 语言源码-inspection stack value of C language source code