吉卜塞占卜 吉卜塞 占卜 吉卜塞 占卜

自已编制的几个学习java语言时的小程序，希望对初学者有所帮助-own establishment several java language learning at the small program, and I hope to help beginners

基于AD9851的任意波形发生器实现,基于AD9851的任意波形发生器实现-Based on the AD9851 realize the arbitrary waveform generator, based on the AD9851 realize the arbitrary waveform generator

树的应用，实现树的递归，非递归的多种顺序查找 -tree applications, the tree is recursive and non- recursive sequence of the multiple search

用MFC写的可以实现中文简繁字体转换的小程序.-with MFC write Chinese 66.248.97.196 can achieve a small font conversion process.

LonWorks NodeBuilder Errors Guide

一个运动控制卡的例程,编辑后就可以运行.-A motion control card routines, editing after the run.

7 segment driving with 74164 with atmel

[输入] 图的顶点个数N，图中顶点之间的关系及起点A和终点B [输出] 若A到B无路径，则输出“There is no path” 否则输出A到B路径上个顶点 [存储结构] 图采用邻接矩阵的方式存储。 [算法的基本思想] 采用广度优先搜索的方法，从顶点A开始，依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B，则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M，再访问与VA2邻接顶点...，如此下去，直至找到B，最先到达B点的路径，一定是边数最少的路径。实现时采用队列记录被访问过的顶点。每次访问与队头顶点相邻接的顶点，然后将队头顶点从队列中删去。若队空，则说明到不存在通路。在访问顶点过程中，每次把当前顶点的序号作为与其邻接的未访问的顶点的前驱顶点记录下来，以便输出时回溯。 #include int number //队列类型 typedef struct{ int q[20] -[imported] map of the number of vertices N, Vertex map of the relationship between the starting point and end point A and B [output] if A to B without path then exporting "There is no path" Otherwise output A to B on the path vertices [storage structure] plan adopted adjacency matrix of storage. [Algorithm for the basic idea] BFS way from the vertex A, A visit followed with adjacent vertices VA1, VA2 ,..., VAK, visiting times, if not visit B, continue to visit with the VA1 adjacent vertices VA11, VA12 ,..., VA1M. VA2 and then

在开发板TMS320C5402下调试灯闪的程序-the TMS320C5402 Development Board under the lights blinking debugging procedures

该压缩包收集了美信MAXIM的2千3百多个器件的封装，采用protel99SE格式制作。-The compressed packets collected Maxim MAXIM 2 1000 3 packages more than 100 devices, using Protel99SE format.