搜索资源列表
Ckanuotu
- 该程序可以化简卡诺图。首先输入真值，然后该程序会将化简以后的最简形式输出-Simplification of the procedure can be Karnaugh map. First of all input true value, then the program will simplify the simplest form of the future output
simknap_rec
- 简化背包算法，实用于大学生学习模拟使用，实现简单的背包问题-Simplify the knapsack algorithm, useful in the simulation students learn to use, simple knapsack problem
Code1
- 表结构，用分支语句计算过于繁琐，巧妙利用数组可以简化过程，下面以税收为例。-Table structure, calculated with the branch statement is too complicated, clever use of arrays can simplify the process, following a tax, for example.
sss_fix
- 秘密共享算法程序，带有素数判断头文件，主程序中为了简化没有使用。-Secret sharing algorithm program with the prime number judgment header files, and does not use in order to simplify the main program
jianhuachengxu
- 简化数据模型、减少数据处理时间、提高成型效率。算法无需建立三角面片之间的拓扑关系，可直接进行切片分层，切平面与网格面片所得的交线段也无需排序，节省了生成轮廓线时对交线段重新排序所需的时间，提高了分层处理的效率。-Simplify the data model, and to reduce the data processing time and improve the molding efficiency. Algorithm without establishing the topologic
fcm1
- fcm算法结构，不用大家自己写了，直接套用就可以了，简化工作量。-fcm algorithm structure, do not we all write directly apply can simplify workload.
Fibonacci-generator
- 用于生成斐波那契数列，可以简化生成斐波那契数列的过程-Used to generate the Fibonacci sequence, simplify manual operation
LeetCode
- LeetCode题解（java版） 包含toi，strstr，add two num，括号匹配，字符串乘法，通配符匹配，文件路径简化，Text Justification，反转单词-LeetCode solution to a problem (java version) contains toi, strstr, add two num, bracket matching, string multiplication, wildcard matching, simplify file pa
SimpleManifold
- 在windows操作系统的环境下安装VS以及可视化工具OpenGL，编写代码并进行流行的简化、计算、可视化、应用等一系列的操作。构造一个类似于三维空间图形，然后将其从三维空间映射到二维空间。-Installed in the windows operating system environments VS and visualization tools OpenGL, write code and simplify the popular series of operating computin
partition-package
- 采用贪心算法来解决部分背包问题，简化了动态规划思想，提高了算法效率-Use the greedy algorithm to solve some of the knapsack problem, simplify the dynamic programming, improving the efficiency of the algorithm
DFA--TO--NFA--simpleDFA
- 程序实现的是编译原理中的NFA到DFA的转换（使用子集构造法）。以及使用等价划分算法实现的DFA的简化-Realize the principle is to compile the NFA to DFA conversion (using the subset construction). As well as simplify the use of equivalence partitioning algorithm to achieve the DFA