-
This specification defines the Audio Codec ‘97 (AC ‘97) Architecture and Digital...
This specification defines the Audio Codec ‘97 (AC ‘97) Architecture and Digital Interface (AC-link) specifically
designed for implementing audio and modem I/O functionality in mainstream PC systems. This specification does
not explicitly define the companion AC ‘97 Digital Controller component (sometimes referred to or abbreviated as
DC ‘97), which typically varies in features and implementation, but is AC ‘97 compliant with this specification.-This specification defines the Audio Codec
- 2022-05-06 15:37:40下载
- 积分：1
-
LED 驱动器AS3693的控制器代码。适合做LED控制的人
LED 驱动器AS3693的控制器代码。适合做LED控制的人-spi interface for led driver as3693
- 2022-04-21 02:13:16下载
- 积分：1
-
圣维南方程组计算程序 vb开发 进行河道水流模拟计算
圣维南方程组计算程序 vb开发 进行河道水流模拟计算-Saint-Venant equations vb development of computational procedures for river flow simulation
- 2022-06-27 04:09:59下载
- 积分：1
-
人机猜数软件，可以实现人猜机器和机器才人两种功能，界面友好，程序健壮...
人机猜数软件，可以实现人猜机器和机器才人两种功能，界面友好，程序健壮-guess a few man-machine software, can achieve guess machines and machines were only two functions, friendly interface and robust procedures
- 2022-01-31 08:57:41下载
- 积分：1
-
mmstatd包含一个 C库和服务器，用于让应用程序很容易的更新计数器和管理器，以便对它们进行维护。它用内部日志支持事故恢复系统。
mmstatd包含一个 C库和服务器，用于让应用程序很容易的更新计数器和管理器，以便对它们进行维护。它用内部日志支持事故恢复系统。-mmstatd contains a C storehouse and the server, uses in to let
the application procedure very easy renewal counter and the
management, in order to carries on the maintenance to them. It uses
the internal diary support accident to restore the system.
- 2022-05-18 05:28:12下载
- 积分：1
-
在两台计算机间用并行打印口通信的TURBO C程序
在两台计算机间用并行打印口通信的TURBO C程序-between two computers in parallel with the Print Communication TURBO C Program
- 2023-01-12 01:05:04下载
- 积分：1
-
颜色图片灰色
colour picture to grey
- 2022-10-09 16:20:03下载
- 积分：1
-
文本比较器，可实现两个文本的比较，比如文本文档
文本比较器，可实现两个文本的比较，比如文本文档-Comparators text, the text can be compared both
- 2022-05-07 17:38:44下载
- 积分：1
-
[输入]
图的顶点个数N，图中顶点之间的关系及起点A和终点B
[输出]
若A到B无路径，则输出“There is no path” 否则输出A到B路...
[输入]
图的顶点个数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
- 2022-01-25 22:50:29下载
- 积分：1
-
内燃机振动信号的盲分离…
Blind separation of internal combustion engine vibration signals by a deflation method
- 2022-02-27 02:18:07下载
- 积分：1
