搜索资源列表
ostang
- 这是我上个学期操作系统的课程设计，做了一个多级文件系统，用文件模拟磁盘，基于i节点结构，功能超强，希望对大家有用。-This is my last semester of courses operating system design and a multi-level file system, disk using simulated document, based on i node structure, function superpower, we hope that the right
tubianli
- 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-To adjacent multi-table storage structure for connectivity undirected graph depth-first and breadth-first traversal. User-specified node as a starting point, respectively, under t
linklist.tar
- 多叉树实现，抽象树节点内容，用回调函数实现内容创建 比较 销毁 -Multi-tree realization of the abstract tree node content, using a callback function to achieve content creation compared the destruction of
xrun
- 数据结构之任意多叉树的建立和操作，包括先序，中序，层序，和插入节点，统计树信息。 融入了树，双向队列等经典数据结构的使用模式。-Data structure of any multi-branch tree establishment and operation, including the first order, in sequence, sequence, and insert the node, the tree statistics information. Into the tr
4
- 无向图功能实现，用邻接多重表存储该无向图，并使用动态存储结构。用一个单链表把所有顶点存储起来，在存储边的节点中给出该边的两个顶点的各自的下一条边的节点地址。-Undirected graph implementation of function, with the adjacent multi-table to store the graph, and using dynamic storage structures. With a single list of all vertices sto
class_presentation_Btree
- 是一种多路搜索树（并不是二叉的）： 1.定义任意非叶子结点最多只有M个儿子；且M>2； 2.根结点的儿子数为[2, M]； 3.除根结点以外的非叶子结点的儿子数为[M/2, M]； -Is a multi-way search tree (not binary in): 1. The definition of any non-leaf node at most M son and M> 2 2. The son of the root n