一个JAVA下applet到 application的转换

这是一个用vb.net编写的扫描条形码程序，在图书馆等利用它可是很方便的哦．-using vb.net prepared by the bar code scanning procedures, the use of the library, but it is very convenient oh.

转载供大家学习讨论，共同提高！我很喜欢搞程序编程，但是刚进入这领域，还在处于学习-reproduced for your study and discussion, common in! I like engaging programming, but just entering this field, but also in learning

足球手机游戏,ea出品!fifa2007!超好玩的足球游戏!

这个程序允许用户显示一个动画的闪屏，当程序执行且花费更长的时间来启动。

石器时代sa客户端修改辅助工具(可看图)-Stone Age sa client changes auxiliary instruments (see figure)

[输入] 图的顶点个数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

本程序是用C语言编写的100个节点的电力系统潮流计算程序-This program is written in C node 100 Power Flow Calculation Program

自动计算fir滤波器系数的工具，不妨一试-Automatic calculation of filter coefficients fir tools, try

DigitalImageProcessing_base_on_Matlab 基于Matlab的数字图像处理-DigitalImageProcessing_base_on_Matla b Based on Matlab Digital Image Processing

续接上面16*16VHDL 程序,可作参考,大家互相学习2-Then added 16* 16VHDL procedures above can be used for reference, we learn from each other 2