搜索资源列表
data-structure-experiment
- 数据结构实验：用C++实现二叉树的结点总数、叶子结点个数和深度，能够很好地掌握二叉树及对二叉树进行遍历。-Experimental data structure: it uses C++ to achieve the total number of nodes of the binary tree, the leaf node number and depth, you can master the binary tree and binary tree traversal.
PhoneBook
- 掌握树形控件（Tree Control）、时间日期控件（Date Time Picker）、分割线（Picture Control）的使用；掌握拖拽、移动、释放左键等鼠标事件的使用。-Master tree control (Tree Control), the date and time controls (Date Time Picker), the dividing line (Picture Control) use grasp drag, move, release the left
CSharp
- Windows 操作系统的注册表包含了很多有关计算机运行的配置方式，打开注册表我们可以看到注册表是按类似于目录的树结构组织的，其中第二级目录包含了五个预定义主键分别是：HKEY_CLASSES_ROOT，HKEY_CURRENT_USER，HKEY_LOCAL_MACHINE，HKEY_USERS，HKEY_CURRENT_CONFIG。-Windows operating system registry contains a lot of information about the compu
pro.3
- 哈夫曼树的应用和实现 通过构造哈夫曼树及哈夫曼编码，掌握树型数据结构的基本实现方法。-Huffman tree application and by constructing Huffman tree and Huffman coding, to master the basic method tree data structure.
graph
- 掌握图的两种存储结构； 掌握Dijkstra算法； 掌握Prim及Kruskal算法； 邻接矩阵、最短路径及其长度 邻接表、最小生成树 -Learn two storage structure Master Dijkstra algorithm Master Prim and Kruskal algorithm Adjacency matrix, and the length of the shortest path Adjac
echashudejianliyubianli
- ．熟悉二叉树的存贮结构及遍历方式，掌握有关算法的实现。 2．能够利用二叉树解决具体问题。 -. Familiar binary tree traversal storage structure and master realized about the algorithm. 2. Able to use binary solve specific problems.
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
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