EPSON 打印机的列表功能 C 语言源代码

一些基本的数字图像处理算法，还比较全面、实用-some basic digital image processing algorithms, but also more comprehensive, practical

实验一 熟悉操作系统工作环境 实验二 Linux进程通信程序设计 实验三 Windows服务程序设计 实验四 进度调度程序设计及分析 实验五 存储管理程序设计及分析-experiment a familiar working environment operating system Linux process two experimental communication program design Wind Experiment 3 Diego experimental design services for the progress of four scheduling program design and analysis of experiments five storage management program design and analysis

遗传算法工具箱,可以直接调用该工具箱对各种神经网络进行优化处理，方便快捷-Genetic Algorithm Toolbox, you can directly call the toolbox of various neural network optimization, convenient and quick

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

BTX250汽车功放电路原理图 PDF格式-BTX250 car amplifier circuit schematics PDF format

C++基本小程序，供C++初学者用-basic procedures for beginners use C

一个贪食蛇的小游戏，可以一个人或者两个人玩-a small game can be a person or two people play

通过类型姓名年龄类别来显示动物-type names age categories to show animals

VC++.NET 时尚游戏开发编程40例，各种智力游戏

自己做的2进制和16进制转换工具，支持批量转换-Own 2-band and 16 hexadecimal conversion tools, support batch conversion