资源列表
gaosi
- 用高斯公式求方程组的解,上下消元法是矩阵对角线上的数字全是1-gaosi
fangshesuanfa
- 仿射机密算法,对数据安全的人员很有用,用C实现了仿射机密算法,很实用-Affine secret algorithm, useful for data security staff, with the C implementation of the affine secret algorithm, it is useful
Lab-uC
- Contador bcd para el lab de digitales
changgui3
- 1.基类，虚基类 2.构造函数，析构函数 3.派生类，继承 4.派生类调用基类 5.私有成员与公有成员及保护类 -1. Base class, virtual base class 2. Constructor, destructor 3. Derived classes, inheritance 4. Derived class to call the base class 5. Private members and public and protected class
suanfa
- 这是通过VC++实现的一个求最短路径算法以及其他算法的小程序。-This is done by a VC++ to achieve the shortest path algorithm and other algorithms of small programs.
pailiezhuhe
- 排列组合的计算，可用于概率论问题的求解和计算-Permutation and combination of the computation can be used to solve the problem of probability theory and calculations
Disk-scheduling
- 磁盘调度算法，包含FCFS，SSTF，SCAN和CSCAN-Disk scheduling algorithms, including FCFS, SSTF, SCAN and CSCAN
yinhangjiasuanfa
- 银行家算法：程序模拟预防进程死锁的银行家算法的工作过程-Banker' s algorithm: program to simulate the process of deadlock prevention algorithms work process banker
yhjsf
- 一个银行家算法 感觉还不错 需要可以下来看看哦 可能对你有用-it is about yhj
Warshalls-Transitive-Closure
- In computer science, the Floyd–Warshall algorithm (also known as Floyd s algorithm, Roy–Warshall algorithm, Roy–Floyd algorithm, or the WFI algorithm[clarification needed]) is a graph analysis algorithm for finding shortest paths in a weighted graph
Bellman-Fords-Shortest-Paths
- The Bellman–Ford algorithm computes single-source shortest paths in a weighted digraph. For graphs with only non-negative edge weights, the faster Dijkstra s algorithm also solves the problem.
horses
- Algorithm resolution.