资源列表
按位就座
- 依次将待转置矩阵A的三元组行列互换后,直接放到转置矩阵B的三元组表中的正确位置。需考虑两方面因素:一是矩阵A每列中非零元素的个数(即转置矩阵B每一行中非零元素的个数);二是矩阵A各列中第一个非零元素三元组在B中的正确位置(即矩阵B各行中第一个非零元素三元组在B中的正确位置)。(In turn, the row of three tuples of the transposed matrix A is exchanged and placed into the correct position o
8.7-8.9 MattoList Prim Dijkstra
- 采用prim算法和kruskal算法求最小生成树 采用dijkstra算法求从顶点到其他顶点的最短路径和最短路径长度。(Using prim algorithm and Kruskal algorithm to find minimum spanning tree Dijkstra algorithm is used to find the shortest path and the shortest path length from vertex to other ver
手把手教你学51单片机-C语言版
- 51资料，感兴趣的可以看看。感觉写的很具体(Some artiles about 51,if you are interested in it ,you can download)
自然连接
- 计算任意两个表的简单自然连接过程。假设有两个表A、B，分别为m1行、n1列和m2行、n2列，求它们简单自然连接的结果C=A B(i=j)。(A simple natural join procedure for computing two arbitrary tables. Suppose there are two tables A and B, which are M1 rows, N1 columns and M2 rows, N2 columns, and the result of t
airadirective
- 这是一个用来拦截windows消息的开发包,可以设置全局鼠标和键盘钩子,内含显示密码窗内容的sample()
有序表归并（单链表存放）
- （有序表（顺序储存）合并）假设有两个有序表LA和LB，设计一个算法，将他们合并成一个有序表LC（假设每个有序表中和两个有序表间均不存在重复元素）。要求不破坏原有表LA和LB。((ordered table (sequential storage) merger) assuming a two ordered list of LA and LB, to design an algorithm to merge them into an orderly table LC (assuming each
92082240
- 这是一个漂亮的界面程序希望大家能从中有所收获()
DFS BFS 图
- 深度优先遍历和广度优先遍历算法实现从定点开始的遍历序列。(Depth first traversal and breadth first traversal algorithm to achieve the starting point from the traversal sequence)
课设 - 副本
- 实现食品的录入删除插入查找等操作，有界面颜色选择(Food input, delete, insert and other operations)
注册用
- 注册(reg)
MSP430_UART_interrupt_demo_20171031
- UART&中断。MSP430F149串口通信示例程序。(UART& interrupt. MSP430F149 serial communication sample program.)
5130829035-刘航
- 多个汇编程序 微机原理实验作业 适合初学者(assembler programs Experimental work of Microcomputer Principle Suitable for beginners)