资源列表
asdfasxa32
- 掌握图的邻接矩阵的存储结构；实现图的两种遍历：深度优先遍历和广度优先遍历。-master plan adjacency matrix storage structure; Implementation plans of the two traverse : depth-first traversal and breadth traversal priority.
back_Pos_setting
- POS系统后台的设置方案范例，DOC文档。-POS systems installed background programs example, DOC files.
front_Pos-misER
- POS—MIS前台ER图设计范例，DOC文档。-POS-MIS prospects ER designs example, DOC files.
SkyEYE2
- SKYEYE 使用-SKYEYE use
EDA_1012
- EDA_1012，eda课件
uCOSfor
- uCOS-II 初级程序员指南 uCOS-II 初级程序员指南-for uCOS-II Junior Programmer's Guide for uCOS-II Junior Programmer's Guide
54545484548465
- 软件设计师历年真题 1990年-2005年12月真题-software designers simulated the calendar year 1990, December 2005 simulated
asfweess
- 实现栈的基本操作以及栈在程序设计上的应用-achieve the basic operation of the procedure and stack design of the application
12332aas
- 快速排序，基本思想：通过一趟排序将待排序记录分割成独立的两部分，其中一部分记录的关键字均比另一部分记录的关键字小，则可分别对这两部分记录继续进行排序，以达到整个序列有序。-quick sort, the basic idea : The trip will rank ordering records to be separated into two independent parts, part of the keyword record than another part of the rec
22aaaaa
- 以有序表表示静态数据源，使用二分查找指定关键字的数据项的位置。-said in an orderly form of static data sources, the use of two-keyword search for the specified data item position.
3adf
- 遍历是二叉树各种操作的基础，显示，遍历过程中可以对各结点进行各种操作，又实现各种的目的。-traverse binary tree is the basis for various operations, that the process can traverse the nodes of various operations, Also achieve various objectives.
C++1598
- 对于初学者训练编程技巧，积累编程经验很有帮助-training for beginners programming skills and accumulated experience helpful Programming