资源列表
jihe
- 判点在凸多边形内,顶点按顺时针或逆时针给出,在多边形边上返回0-Judgment point in the convex polygon, the vertex clockwise or counterclockwise given, the edge of the polygon back to 0
VB-UART
- 利用串口进行设备参数的读取和设置，并能读取IC的ID并加密后上传，用于IC的代码保护。-Using a serial port to read and equipment parameters, Settings, and can read the IC ID and encrypted upload, used for the IC code protection.
dfs
- 无向图的关键边,dfs邻接阵形式,O(n^2)-The critical edge of the undirected graph, dfs adjacency matrix form, O (n ^ 2)
hungary
- 二分图最大匹配,hungary算法,邻接阵形式,复杂度O(m*m*n)-Bipartite graph maximum matching, hungary algorithm, adjacency matrix form, complexity O (m* m* n)
Minimum-path-coverage
- 求解最小的路径覆盖图中所有点,有向图无向图均适用-Solving all the points in the least path coverage map, the directed graph is applicable
kruskal
- 无向图最小生成树,kruskal算法,邻接表形式,复杂度O(mlogm)-Undirected graph minimum spanning tree, kruskal algorithm, adjacency table form, complexity O (mlogm)
Mymagnify
- 实现鼠标点击事件的响应：左键点击当前窗口鼠标右键释放后放大窗口的曲线和曲线数据-Response implementation mouse click events: Left-click on the current curve and the curve data window Right after the release of the magnification window
mzgh
- 门诊挂号, 包含当日挂号，预约挂号，查询等功能（d7）-Outpatient registration (d7)
rk
- 一阶，三阶，四阶龙格库塔法的fortran code-First-order, third-order, fourth-order Runge-Kutta method of fortran code
explicit
- 库埃特流的显示欧拉方法求解，fortarn code-Couette flow display method for solving Euler, fortarn code
inplicit
- 库埃特流的隐示欧拉方法求解，fortarn code-Implicit Euler method for solving the Couette flow, fortarn code
crank1
- 克兰克－尼科尔森方法求解库埃特流的fortran code-Crank- Nicolson Method for Solving Couette flow fortran code