-
编程文档手册1.5版
编程文档手册1.5版-programming documentation manual version 1.5
- 2022-03-15 05:47:32下载
- 积分:1
-
nasm中文帮助文档,对学习nasm至关重要
nasm中文帮助文档,对学习nasm至关重要-nasm Chinese help documentation nasm is essential for learning! ! ! ! !
- 2022-07-08 13:07:36下载
- 积分:1
-
TC下的图形库 v2.3
TC下的图形库 v2.3-TC under the Smart Graphics Library
- 2023-06-16 02:55:03下载
- 积分:1
-
74芯片大全,了利用此其安全的完成电路板的设计与制作,是开发电路板的好帮手。...
74芯片大全,了利用此其安全的完成电路板的设计与制作,是开发电路板的好帮手。-the pcb is a good messege for alarge engineer,
- 2022-04-11 14:08:52下载
- 积分:1
-
This is the impulse c language on the DMA controller hardware documentation, the...
这是关于impulse c语言实现DMA硬件控制器的文档,实现的平台是Nios II Platform-This is the impulse c language on the DMA controller hardware documentation, the realization of the platform is the Nios II Platform
- 2022-01-25 16:34:07下载
- 积分:1
-
详细介绍了如何使用MAXPLUS对ATF1504的编程及烧写全过程
详细介绍了如何使用MAXPLUS对ATF1504的编程及烧写全过程-detail how to use the FPGA to ATF1504 programming and the entire process of burning
- 2022-06-19 03:21:06下载
- 积分:1
-
network programming RT8139d information network chips
网络编程 RT8139d 网络芯片资料-network programming RT8139d information network chips
- 2023-04-05 19:55:04下载
- 积分:1
-
利用c++进行K线图的绘制,此处为举例说明,希望有所帮助
利用c++进行K线图的绘制,此处为举例说明,希望有所帮助-Using c++ mapping for K-line, here for example, want to be helpful
- 2022-04-28 18:02:56下载
- 积分:1
-
用堆栈实现迷宫求解问题
基本思想:
若当前位置可以通过,则压入栈中,否则探求下一位置,若走不通,则回朔,迷宫大小:M*N.迷宫设置自定义。
求解迷宫...
用堆栈实现迷宫求解问题
基本思想:
若当前位置可以通过,则压入栈中,否则探求下一位置,若走不通,则回朔,迷宫大小:M*N.迷宫设置自定义。
求解迷宫问题的简单方法是:从入口出发,沿某一方向进行探索,若能走通,则继续向前走;否则沿原路返回,换一方向再进行探索,直到所有可能的通路都探索到为止。
为避免走回到已经进入的点(包括已在当前路径上的点和曾经在当前路径上的点),凡是进入过的点都应做上记号。-Maze with the stack to achieve the basic idea for solving the problem: If the current position can be adopted, in pressure, otherwise the next location to explore, if a dead end, then back to New Moon, the size of the maze: M* N. maze set up a custom. A simple maze to solve the problem is: starting from the entrance, along a certain direction to explore, can walk, then continue to move forward otherwise return along the same route, a direction for further exploration, until all possible pathways are exploring to date. In order to avoid going back to have access points (including the current path and current path in the point), all the points should be entered mark.
- 2022-03-21 17:16:01下载
- 积分:1
-
delphi学习笔记,对初学者有帮助^-^
delphi学习笔记,对初学者有帮助^-^-delphi study notes, for beginners help ^- ^
- 2023-03-12 10:00:03下载
- 积分:1