资源列表
sy1
- 使用如下所谓的简单变量“数据平移”方法来求出Fibonacci数列的第n项（的具体项值）并显示在屏幕上（正整数n通过键盘输入）：说明变量old1=1，old2=1，newItem；新的Fibonacci项newItem总是“距它最近”的前两项（old1与old2）的累加和。而后通过“old1=old2 old2=newItem ”进行所谓的“数据平移”。接着计算另一个新的Fibonacci项newItem，依次循环，直到求出数列的第n项时为止。-Use the following so-call
Calculate
- 数据结构 输入表达式，实现表达式求值-Enter the expression of data structure to achieve the expression evaluator
Sort
- 实现多种排序算法比较 数据结构：用链表实现-Sorting algorithm to achieve a variety of comparative data structure: use of linked lists to achieve
guide
- 校园导游参考 运用DIJKSTRA等算法实现-Campus tour guides, such as reference to the use of Dijkstra Algorithm
sjjgks
- 这是一个数据结构的课程设计的源码和相关文档说明。-This is a data structure of the curriculum design of the source code and related documentation.
TraversingGraph
- 图的遍历算法是求解图的连通性问题、拓扑排序和求关键路径等算法的基础-Graph traversal algorithm is to solve the graph connectivity problem, topological sorting and demand, such as critical path algorithm
BinaryTree
- 二叉树是另一种树形结构，它的特点是每个结点至多只有两棵子树，并且，二叉树的子树有左右之分，其次序不能任意颠倒。这个代码实现了二叉树的存储和遍历-err
tu_bianli
- 利用C语言实现数据结构中的图的建立,根据边的数目建立图,并用深度遍历法遍历图等-The use of C language data structure diagram of the establishment, in accordance with the number of edge-building plans, and the depth of traversal method traverse map
maze
- 迷宫算法，写的非常清晰。适合初学数据结构课程的同学们使用。-Maze algorithm, written in very clear. Data structure suitable for beginner courses in the use of students.
qianzhuizhuanerchashu
- 前缀表达式转换成二叉树的代码，通过转换成二叉树可以轻松实现转换成后缀，前缀，中缀形式。-Prefix expression into a binary tree code, through the binary tree can be converted easily into a suffix, prefix, infix form.
zhongzhuizhuanhouzhui
- 中缀表达式转换成后缀表达式，很经典的算法，通过编译实现！-Infix expressions into expressions suffix, it is the classic algorithm, through the compiler to achieve!
xishujuzhen
- 稀疏矩阵的转置相加与相乘,已经通过编译与实现，数据结构的课程设计，加乘转置功能很全！-Sparse matrix transpose sum and multiplication, has been adopted and implementation of compilers, data structure of curriculum design, transpose function increases by a very wide!