-
camera 驱动源码，用用于支持ov511系列芯片的摄像头，和ov7620系列芯片的摄像头...
camera 驱动源码，用用于支持ov511系列芯片的摄像头，和ov7620系列芯片的摄像头-camera driver source code, with support for the ov511 series chip camera, ov7620 series and the camera chip
- 2022-03-17 18:23:19下载
- 积分：1
-
用MATLAB做的解方程的程序源程序及演示课件。
用MATLAB做的解方程的程序源程序及演示课件。-do with MATLAB solution to the equation and demonstrate procedures source courseware.
- 2022-05-21 21:53:24下载
- 积分：1
-
计算距离广州亚运会的时间，即广州亚运会倒计时牌
计算距离广州亚运会的时间，即广州亚运会倒计时牌-Guangzhou Asian Games calculating the distance of time, namely, in Guangzhou Asian Games countdown board
- 2022-07-22 11:52:37下载
- 积分：1
-
基础代码汇总整理
回顾NOIP2009
For OIers
基础代码汇总整理
回顾NOIP2009
For OIers-Collected, prepared and reviewed the underlying code NOIP2009 For OIers
- 2022-05-19 14:05:58下载
- 积分：1
-
C 语言开发环境
C 语言开发环境 -C language development environment
- 2022-12-11 20:40:04下载
- 积分：1
-
一堆猴子都有编号，编号是1，2，3 ...m ,这群猴子（m个）按照1...
一堆猴子都有编号，编号是1，2，3 ...m ,这群猴子（m个）按照1--m的顺序围坐一圈，从第1开始数，每数到第N个，该猴子就要离开此圈，这样依次下来，直到圈中只剩下最后一只猴子，则该猴子为大王。-monkeys have a pile of numbers, numbers 1, 2, 3 ... m, these monkeys (m) In accordance with the 1-- m sitting in the order in a circle, starting from a few every few months to the first N, The monkeys will be leaving this ring, and so on down until the circle only last a monkey, the monkey king to.
- 2022-01-25 16:09:22下载
- 积分：1
-
本源码的开发环境为keil c 单片机最小系统的应用实例跑马灯
本源码的开发环境为keil c 单片机最小系统的应用实例跑马灯-The source development environment for the smallest single-chip microcomputer system keil c application Marquee
- 2023-09-09 21:05:03下载
- 积分：1
-
学习和研究软件内含的设计思想和原理，通过安装、显示、传输或者存储软
件等方式使用软件的，!...
学习和研究软件内含的设计思想和原理，通过安装、显示、传输或者存储软
件等方式使用软件的，!
-Study and research includes the design of software ideas and principles, through the installation, display, transmission or storage software, such as the use of software,!
- 2022-07-13 14:45:40下载
- 积分：1
-
Typical video processing YUV image sequence, stefan, cif format
视频处理的典型YUV图像序列，stefan，cif格式，-Typical video processing YUV image sequence, stefan, cif format
- 2022-02-05 03:51:40下载
- 积分：1
-
Create a storage structure of a given graph from the adjacency list and adjacenc...
1 创建给定图的存储结构，从邻接表和邻接矩阵两种存储方式中选择一种。
2 对所创建的图进行深度和广度优先搜索遍历，给出遍历过程中的顶点序列。
3 求图的最小生成树，按构造顺序输出边的序列。（两种方法都要求！）
3 编写一个主函数，将上面函数连在一起，构成一个完整程序。
4 将实验源程序调试并运行。
-Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store. Two pairs of maps created by the depth and breadth-first search traversal, given the culmination of the process of traversal sequence. 3 order to map the minimum spanning tree, according to the order of the output side of the sequence structure. (Both methods require!) 3 to prepare a main function, the above function together to form a complete program. 4 source debugging and running the experiment.
- 2022-04-16 10:47:00下载
- 积分：1
