搜索资源列表
ssd5 opt 6
- Calculating "The Sum of Its Parts" Prerequisites, Goals, and Outcomes Prerequisites: Students should have mastered the following prerequisite skills. Trees - Knowledge of tree representation, particularly general hierarchies STL map contain
BinaryTreeStudio
- 搜索二叉树的使用与编程,从初步开始到精通-Search the use of binary tree and programming, starting the preliminary to master
demoTree
- tree控件的演示,点击“添加子节点”会自动添加子节点A,B,C。此例适合初学者掌握Tree控件-Demos tree controls, click on the " Add a child node" will automatically add child nodes A, B, C. This case is suitable for beginners to master the Tree control
Chess
- 基于剪枝技术的一字棋博弈系统,理解和掌握博弈树的启发式搜索过程,能够用某种程序语言建立一个简单的博弈系统-Pruning techniques based word chess game systems, understand and master the game tree heuristic search process, we can build a simple game system in some programming language
admin5
- 1、网站模板以及功能模仿ADMIN5站长黄页。 2、支持用户注册、信息、密码修改,添加站点时由用户添加PR、ALEXA等信息。 3、支持网站点击排行、显示10条最新加入网站、同城分类、同城新闻信息。 4、由用户录入同城新闻信息、作者与主页,支持站点信息搜索。 5、可定制网页顶部top.asp与底部信息bottom.asp。 6、基本参数设置文件:config.asp-1, website templates and mimics ADMIN5 Master Pages.
TreeView_demo
- 利用TreeView来显示数据库信息,是一个学习TreeView的好方法,对新手要掌握目录树是个典型的例子-Using TreeView to display information, is a good way to learn TreeView, to master the directory tree is a typical example
10164
- Kruskal最小生成树算法一、 实验目的 1、 掌握图的邻接表结构 2、 掌握最小生成树算法 二、 实验内容 基于邻接表实现kruskal算法(Kruskal minimum spanning tree algorithm, the purpose of the experiment 1. Master the adjacency list structure of the graph 2, master the minimum spanning tree algorithm T
二叉链表
- 一、 实验目的 (一) 掌握二叉树的逻辑结构和二叉链表存储结构; (二) 验证二叉树的二叉存储和遍历及其基本操作的实现; (三) 理解算法与程序的关系,能够将顺序表算法转化为对应程序;(First, the purpose of the experiment (1) master the logical structure of the two tree and the storage structure of the two linked list; (two) verify the