资源列表
di-gui-qiujie-8-Queen
- 递归求解八皇后问题。C语言程序，数据结构课程作业，注释完全，简单易懂，亲测可用。-Recursively solving the eight queens problem. C language programs, data structures course work, notes completely, easy to understand, pro-test is available.
san-yuan-zu-biaoshi-xishujuzhen
- 三元组表示稀疏矩阵。数据结构课程作业，注释完全，简单易懂，调试通过。-Triples represent sparse matrix. Data structure course assignments, notes completely, easy to understand, debug through.
Prim
- 输入任意的一个网，用普里姆(Prim)算法构造最小生成树。-Enter any of a network, with Prim (Prim) minimum spanning tree algorithm.
zuixiaoercheng
- 多步最小二乘法是一种参数辨识的基本方法-Multi-step method of least squares is a basic parameter identification. . . . . . . .
webCrawer
- web crawler 网络爬虫 抓取网站信息 进行分析-web crawler web crawler to crawl the site information for analysis
untitled-folder
- Newton s Method in the univariant and multivariant cases for Mathematica
shortPathModel
- 以严蔚敏《数据结构（C语言版）》教科书7.33交通图为例，求解最短路径。求解从一个城市出发到其它所有城市的最短路径。求解从一个城市到另一个城市的最短路径。-In YanWeiMin " data structure (C language version)" textbook 7.33 traffic map, for example, solving the shortest path. From one city to solve the shortest path to
Biaodashi
- 实现从键盘终端输入语法正确的算术表达式，计算出表达式的值。为了避免算符的二义性，可以假设表达式中只包含实型正常数运算符包括加、减、乘、除四种基本运算，可以包含圆括号。-Realized syntactically correct input from the keyboard terminal arithmetic expressions to calculate the value of the expression. To avoid ambiguity operator, it can b
SORTmodel
- 常用内部排序算法：直接插入排序,希尔派序,冒泡排序,快速排序,简单选择排序,堆排序. 对每种排序方法，记录其数据比较次数和数据移动次数。要求待排序数据不少于100，数据分布在一个较大的范围内，若1000。-Common internal sorting algorithms: direct insertion sort, Hill sent order, bubble sort, quick sort, simple selection sort, heap sort order for e
polynModel
- 实现一元稀疏多项式的如下运算：(1)两个一元稀疏多项式相加运算(2)两个一元稀疏多项式相减运算(3)两个一元稀疏多项式相乘运算-Realize one yuan sparse polynomial arithmetic as follows: (1) two one yuan sparse polynomial arithmetic (2) two one yuan sparse polynomial subtraction of (3) two one yuan sparse polynomi
HFMModel
- 由文本字符及字符在文本文件中出现的频率，构造带权路径最短的最优二叉树（哈夫曼树），并依此为基础构造字符的前缀编码（哈夫曼编码）。-Frequency of text characters and characters that appear in the text file, with the right to construct the shortest path to the optimal tree (Huffman tree), and so the basic structure fo
scatterbar
- 实现对于散点数据的三维柱状图出图，在散点的基础上，给定相应的尺寸大小，采用plot3生成三维柱状图-Achieve a three-dimensional bar graph showing the scatter of data, on the basis of scatter, given the appropriate size, three-dimensional histogram is generated using plot3