资源列表
LSR
- 这是大学计算机网络课程的实验 解决的是最短路径优先问题
LinearRegression
- 用C#编写的线性回归预测算法，一个类，可以封装-Written in C# using the linear regression algorithm, a class, you can package! !
duiliecaozuo
- 在队列中设置变量rear和num分别作为队尾指针和队中元素记录。程序中包含队列的判队满、判队空、入队和出队四个基本操作。-Set the variable in the queue and the num rear tail pointer respectively, and the team as the team recorded elements. Program sub-team include queue is full, empty sub-teams, into the team
printf2
- 一种简洁的printf 输出函数，具备int, long, double类型数据标准输出能力，代码紧凑，占用内存小-The output function printf a concise, with int, long, double data type to standard output capacity, compact code, small memory
binary-tree
- 建立了一个二叉树，写出二叉树的结点，然后用前序历遍、中序历遍、后序历遍来访问了整棵二叉树。-A binary tree, write a binary tree node, and then use the pre-order the calendar over the calendar times in sequence, after the sequence to access the calendar over the whole grain binary tree.
juzhenhanglieshi
- 可以从txt中读入矩阵，按行按列展开矩阵，以此求出矩阵的行列式-Can be read from txt into the matrix, expand the matrix row by row, in order to find the matrix determinant
case32
- 2. 对于一个给定的n*m的矩阵，矩阵中的每个元素aij均为非负整数。游戏规则如下： 1）每次取数时须从每行各取走一个元素，共n个。m次后取完矩阵所有元素； 2）每次取走的各个元素只能是该元素所在行的行首或行尾； 3）每次取数都有一个得分值，为每行取数的得分之和，每行取数的得分 被取走的元素值*2i，其中i表示第i次取数（从1开始编号）； 4）游戏结束总得分为m次取数得分之和。 对于任意矩阵，可以求出取数后的最大得分 -2 for a given n*m matrix,
hudie.c
- 用BEZIER曲线编的蝴蝶-using Bezier curves series of the Butterfly
Form1
- class testing in c# using uml tool
bitfunction-
- 对几个非头文件内定义的位操作函数的定义和调用，满足程序中对位操作的函数功能，可直接调用-Defined in the non-header file operations function definition and call, to meet the program-bit operating function function can be called directly
PC
- 单片机与PC机之间的通讯，首先需要建立连接-conect with pc
serial-send--things
- rs232 串口发送程序 先发送至数据库中-rs232 serial transmission program first sent to the database