资源列表
Binary-sort-tree
- 1、编写建立二叉排序树的程序。 2、编写基于二叉排序树的查找程序。 -1, the preparation of the establishment of binary sort tree program. 2, written based on binary sort tree Finder.
list
- 主要是linux内核中list的实现与一些小的测试例子，-Mainly is the Linux kernel in the realization of the list with a small test cases,
code
- 用C语言实现，基于迭代器的一元多项式计算，使得算法与具体的容器无关-Using the C language, regardless of the algorithm with specific container iterator-based polynomial, so
Integer
- 功能相对完整的大整数类,Integer 数据类型提供了针对 32 位处理器的优化性能-Relatively complete integer class, Integer data type provides optimized performance for 32-bit processors
cyuyan3
- 采用C语言编程计算稳态温度场各节点的温度-The use of C language programming calculation of steady temperature field in each node temperature
02
- 头插法或尾插法建单链表，并进行单链表的简单操作-Or tail head interpolation interpolation built single linked list and singly-linked list of simple operation
lingjiejuzheng
- 这是数据结构中，邻接矩阵的代码，希望对您有所帮助-This is the data structure, the adjacency matrix code, you want to help
zuiduanlujingbaogao
- 求城市之间最短路径的问题。通过运用最小生成树的算法，求出最短路径，课程设计的报告！-Ask the city between the shortest path problem. Through the use of the minimum spanning tree algorithm, the shortest path, curriculum design report!
kechengsheji
- 合肥学院课程设计 数据结构 实验十二非常适合合肥学院学生-Hefei University curriculum design data structure Experiment 12 is ideal for Hefei University students
Depth-first-traversal
- 1、编写图的邻接表表示法的数据结构。 2、编写用邻接表创建图的函数 3、用深度优先遍历的方法输出顶点序列-1, write the adjacency table shows the data structure of the Act. 2, written with the adjacent table to create a graph function output sequence of vertices with a depth-first traversal methods
01
- 顺序表的基本操作，包括定义，创建，插入，删除-The basic operation of the sequence table, including definitions, create, insert, delete, etc.
240ok
- 240*128显示程序，51单片机用，t6369控制芯片-240* 128 display program, 51 the microcontroller, t6369 control chip