资源列表
87715470number
- 这个是C语言从文件读入整数 N, 然后读入N*（ N+1）矩阵，得到解并输出到文件中。-This is read from the file into the C language integer N, and then read into the N* (N+1) matrix, the solution and get the output to a file.
huffman
- huffman二叉树的使用，并且可以对文件进行编码及解码的处理-huffman binary tree using
sequential
- 用C++面向对象语言实现合并两个顺序表的操作，其结果有序，并按照顺序排列显示。-In C++ object-oriented languages in order to achieve merging the two operating tables, the results of an orderly and follow the order shown.
maze
- 数据结构课程设计中，关于对迷宫求解的源代码。-Data structure course design, on the source code for solving the maze.
dpzuiduanlujing
- 用vb求解最短路径问题，一篇很好的科技文献，很有参考价值-Solving the shortest path problem with vb, a good scientific literature, a good reference
ArrayManipulation
- This for manipulation array data using LabVIEW
stack_queue_ufs
- 自己C++写的单链表栈、单链表队列、并查集-C++ to write their own list of single-stack, single-linked list queue, and check collection
sorting
- 各种排序的比较，包括正序，随机，逆序的时间复杂度比较-Comparison of various sort, including the positive sequence, random, reverse the time complexity of comparing
KrusklaPrim
- 最小生成树 Kruskal和Prim的比较 可以根据用户输入的点数和边数随机生成图并且保证是连通图-Kruskal and Prim' s minimum spanning tree can compare the number of points based on user input and the edges are randomly generated map and ensuring that connected graph
MaxFlow
- 最大流最小割 可以测试某一个特定的图 也可以随机生成n个顶点的图和k条边 用来分析时间复杂度-Maximum flow minimum cut to test a particular map can also be randomly generated graph of n vertices and k edges used to analyze the time complexity
shuzhifenxi
- 各种解方程组的方法 包括线性和非线性方程组-The method of solution of equations, including linear and nonlinear equations
LinkList
- 单链表的线性操作，程序员在编写程序时可以直接用，省去很多时间-Single list of linear operation, the programmer can write programs directly, eliminating a lot of time