-
SourceCode13_ADDA
初学DSP2812 的AD和DA得演示程序,简单易用,稍微一改即可作为自己得程序使用(DSP2812 beginner)
- 2008-06-08 21:24:48下载
- 积分:1
-
距离最短路由
用于多跳路由,寻找最小距离路径的一种算法。(An algorithm for multi-hop routing looking for the path with the smallest distance.)
- 2020-07-08 17:48:55下载
- 积分:1
-
基于STM32设计的电子秤PCB,原理图加程序
基于STM32的电子秤设计,包含了原理图,PCB,和程序(The design of electronic scale based on STM32 includes schematic diagram, PCB and program.)
- 2018-04-17 21:36:48下载
- 积分:1
-
Project4_BallmanFord
(图论)实现负权重转换(Bellman-Ford)
对于输入的任何一个拓扑(部分边的权重为负),要求变换网络中边的权重,任意两节点间的最短路不变,输出变换后各边权重。如果网络中存在负环,程序要有报警功能。算法主体写在CGraph类中((Graph theory) to achieve negative weight conversion (Bellman-Ford) to the input of any topology (some edge weight is negative), requiring transform the network edge weights between any two nodes of the shortest path unchanged, the output transform each edge weights. If the negative loop exists in the network, the program should alarm function. Algorithms written in CGraph class body)
- 2020-08-03 17:48:35下载
- 积分:1
-
GuiStaticLib
Guilib的静态库源码,修改了一些编译错误,以及在不同windows上面存在的一些问题(The static library source code of Guilib. Modified some compilation error, and some bugs that exist in different windows version.)
- 2014-02-20 09:41:06下载
- 积分:1
-
lpciap
lpc213x系列,ads1.2,Flash存储代码(lpc213x series, ads1.2, Flash memory codes)
- 2015-05-25 21:15:27下载
- 积分:1
-
MSP430F55xx_gaodianping_02.c
可以测量低频的高电平时间,如果需要测高频,可以更改定时器的频率,本程序使用的ACLK(32768hz)(It can measure the high level time of low frequency. If it needs to measure high frequency, it can change the frequency of the timer. ACLK (32768 hz) is used in this program.)
- 2019-03-26 17:08:09下载
- 积分:1
-
PCF8591
AD模数转换,基础lcd1602显示屏。。。。。。(AD analog-to-digital conversion, basic LCD 1602 display screen...)
- 2020-06-19 22:20:02下载
- 积分:1
-
Teechart时间曲线实时移动图实例
Teechart时间曲线实时移动图实例
- 2018-07-15下载
- 积分:1
-
exp6-4
4. 实现函数max(),来输出树中的最大值。
template <typename T>
tnode<T> *max(tnode<T> *t)
请参考第三题中计算树的深度算法,编写程序,调用max()显示整数树中的最大值。(4. To achieve function max (), to maximum output in the tree. template <typename T> tnode <T>* Max (tnode <T>* T) refer to the third question in the calculation of the depth of the tree algorithm, programming, call max () shows the maximum integer tree.)
- 2010-06-19 19:30:40下载
- 积分:1