资源列表
xiaoyuan
- 校园导游系统、把学校的各景点进行编号、、输入相关编号可以查询最短路径-Campus guide system, the school' s various attractions are numbered, and enter the relevant number to query the shortest path
BiTree
- 1.定义二叉链表类型，建立二叉树。 2.先序遍历二叉树，并输出遍历结果。 3.中序遍历二叉树，并输出遍历结果。 4.后序遍历二叉树，并输出遍历结果。 5.层次遍历二叉树，并输出遍历结果。 6.求二叉树的深度、总结点数、叶子结点数、二叉树的复制。-(1) define a binary linked list type, the establishment of a binary tree. 2 preorder traversal of binary tree, a
carparar
- car parking in c/c-car parking in c/c++
Number_system_conversion
- 数制转换 十进制传任意进制，任意进制转十进制-Decimal number system conversion pass any band, any band switch to decimal
DLBDSC
- 该程序为用c语言编写的实现单链表的生成、插入、查找、删除、修改等基本功能的小程序-NO English
tree
- 求二叉树的深度: 给定一个有根二叉树，规定连接两个节点的每条边长度是1，定义树的深度为根到叶子节点距离的最大值。 -Descr iption 给定一个有根二叉树，规定连接两个节点的每条边长度是1，定义树的深度为根到叶子节点距离的最大值。
FIFO-LFU
- 用C语言实现操作系统请求页面调度算法FIFO LFU的实现 提前装入0，5,6页最后能够计算出缺页中断率-Operating system using C language the page is requested the implementation of scheduling algorithms FIFO LFU advance into 0,5,6 page last page fault rate to calculate the vacancy
bothwaylist
- 利用结构体定义结点，每个结点有前驱指针与后继指针，结点数据也是用指针动态开辟内存，每个前驱指针指向前一个结点，每个后继指针指向后一个结点实现双向循环列表，新数据插入可选择首部插入与尾部插入-Use structure is defined nodes, each node has predecessor and successor pointers pointer, node data also opened with a pointer dynamic memory, each precurs
huafenn
- 整数划分问题的新解,按划分子式的个数,进行排列.-Integer division of the new solution, according to the number of designated molecular formula, to be ranked.
test
- 数据结构 图的广度优先搜索遍历路径源代码-Data structure of the breadth-first search through the source code path
Depth
- 实现图的邻接表存储结构及一些基本操作函数。在此基础上实现图的深度遍历算法-The realization of graph adjacency list storage structure and some basic operation function. On the basis of the realization of graph depth-first traversal algorithm
exp5
- 数据结构算法，稀疏矩阵的存储，两矩阵相乘，两矩阵相加的实现-data structure algorithms, sparse matrix storage, two matrix multiplication, the sum of two matrix to achieve