资源列表
image-change
- 用c++编写图像处理小程序，可以实现ps中一些基本功能-Image processing using c++ to write small programs, you can achieve some basic functions ps
HSMS-SECS.1.0.0.1
- sec jam app and source code
you-xiang-dai-quan-tu
- 有向带全图，主要来实现权值计算构造二叉树，构造最小二叉树。-Is to bring the map, mainly to achieve weight calculation to construct two tree structure minimum two fork tree.
ToolPAC_Software_Rev1
- stepper app. for testing
i7k-0.8.4.tar
- c souce code for driver communication
Cpp-1
- 可以进行快速排序，对给出的一列数字进行快速的排序-Can be a quick sort, a column of the given number of quick sort
dll_source_code_519
- ddl souce code for driver
gui-bing-pai-xu
- 归并排序是建立在归并操作上的一种有效的排序算法,该算法是采用分治法（Divide and Conquer）的一个非常典型的应用。将已有序的子序列合并，得到完全有序的序列；即先使每个子序列有序，再使子序列段间有序。若将两个有序表合并成一个有序表，称为二路归并。-Merge sort is established in the merge operation a effective sorting algorithm. The algorithm is using the divide and co
guang-du-you-xian
- 广度优先遍历是连通图的一种遍历策略。因为它的思想是从一个顶点V0开始，辐射状地优先遍历其周围较广的区域，故得名。-Breadth first traversal is a kind of traversal strategy of connected graph. Because it s thought is the beginning of a vertex V0, radiation like to give priority to traverse the wider region,
ha-fu-man-shu
- 给定n个权值作为n的叶子结点，构造一棵二叉树，若带权路径长度达到最小，称这样的二叉树为最优二叉树，也称为哈夫曼树(Huffman Tree)。哈夫曼树是带权路径长度最短的树，权值较大的结点离根较近。-Given n weights as leaf nodes n, constructing a binary tree. If the right path length to a minimum, said such a binary tree for the optimal binary tre
8uart
- VXWORKS 环境下的8路串口驱动，基于PCI的。以验证。-VXWORKS UART DRIVER
BDTime2UTC
- 实现北斗时（北斗周计数，周内秒）到UTC的转换-transfer BDT to UTC