资源列表
floyd
- 计算赋权图中各对顶点之间最短路径有两种方法，其一是调用 Dijkstra 算法，另一方法就是被称为Floyd 的算法，利用LINGO9.0编写了通用的FLOYD算法如下，希望对大家有所帮助,带有例题哦！-Calculated on the weighted graph in the shortest path between vertices in two ways, one is called Dijkstra algorithm, the other method is known as F
lingozuiduan
- Lingo求解最短路问题的很好的例子，带有例题详细说明，是最短路问题求解的通用程序！-Solving the shortest path problem Lingo good example, with detailed examples, is the most common procedures for solving shortest path problem!
zuiduanlu
- MATLAB求解最短路问题的通用程序，根据不同问题直接套用，没有使用自带工具箱，程序通用性很强，还可供想练习编程的同志参考。-MATLAB to solve the shortest path problem common procedures, depending on the issue directly apply, to use own toolbox procedure is very strong, but also for the comrades want to practice
NumericalPRecipesPinPFortranP901
- 数学算法程序包含了几乎所有的一般算法，很有用的。-Numerical Recipes in Fortran 77 and 90
matlab-gauss-and-LU
- 解线性方程组的两种算法，高斯迭代和LU算法-about linear simultaneous equations ， gauss and LU algorithm
CN
- this files descripe the cranck-niclosn method for solving pdes numerically.
multiplication
- type of division of binary numbers
Cdata-structure
- C语言初学者适用程序，适用于大学低年的学生学编程。-C language references
test
- 常微分方程数值解法；用于算法的最优化问题；-Numerical Solution of Ordinary Differential Equations for algorithm optimization problem
Image
- 分三次hermite差值，数值分析的实验。需要#include <graphics.h>的头文件运行。-Hermite three times the difference, numerical analysis of the experiment. Need to# include <graphics.h> Header file to run.
Apriori
- apriori implementation
determinant
- It take the determinant of matrix and then take its transpose and check their determinants are same or not.