图的深度优先遍历和广度优先遍历，以邻接矩阵方式输入。（按照提示输入）！...

数据结构电子书,清华大学出版社,严蔚敏老师-Data Structure e-books, Tsinghua University Press, YAN Wei-min Teachers

线性表的链式表示时各基本操作的实现,例如链表的初始化，删除，添加，-Linear chain, said the table when the realization of all basic operations, such as the initialization list, delete, add, and so on

资源描述 介绍opencv特有的数据结构cvmat，可用作opencv的作图，图像成分分析   

根据贪心算法，来求解最小生成树； 这种情况，可能求不不全局最优解，但是，可以求出当前情况下的最优解；-According to greedy algorithm to solve the minimum spanning tree this situation, it may not seek the global optimal solution is not, however, you can find the optimal solution under the current situation

一个快速，高效的字典查询软件。采用改进的红黑树的搜索算法。-A fast, efficient software dictionary query. Improved red and black tree search algorithm.

酒店管理系统,有数据库,课程设计的很好选择,欢迎下载-Hotel Management System, a database, curriculum design, a good choice, welcome to download

录入数据是开发数据库管理软件最基本的工作,录入数据有多种方法,本方法通过药品库入库登记来说明利用表格录入数据的方法.单击登记按纽,选择"供应商"全称,经手人,结算方式"等信息,在表格中输入入库药品的信息,在药品编号列选择药品编号后回车,将自动填入该药品的基本信息,用户在最后一列回车后自动添加新的记录.-development of the database is the most basic management software, a data input methods, the method for warehousing drugs through registration forms to illustrate the use of data input methods. Click registration button, select the "supplier" designation, handling, clearing way "information, etc. input forms in the arsenal of drugs, the drugs listed No. No. choice after the transport drugs, will automatically fill in the basic information of drug users in the final after a carriage return automatically add new records.

有关数据结构的源代码。。。望大家指教。。。同时也想下载信息论的-The data structure of the source code. . . Hope everyone advice. . . At the same time also want to download the Information Theory

假设以如下说明的三元组 (F、C、L/R) 序列输入一棵二叉树的诸边(其中 F 表示双亲结点的标识，C 表示孩子结点标识，L/R 表示 C 为 F 的左孩子或右孩子)，且在输入的三元组序列中，C 是按层次顺序出现的。设结点的标识是字符类型。F=‘＾’时 C 为根结点标识，若 C 亦为‘＾’，则表示输入结束。试编写算法，由输入的三元组序列建立二叉树的二叉链表,并以中序序列输出。^AL ABL ACR BDL CEL CFR DGR FHL ^^L -Assuming the following description of the triple (F, C, L/R) sequence of a binary tree of all the input side (where F that identifies the parent node, C, said child node ID, L/R that C is F, left or right child child), and triples in the input sequence, C is the emergence of a hierarchical order. Node identity is established character types. F = " ^" C for the root identity when, if C is also a " ^" , then enter the end. Test preparation algorithm, the input sequence of triples binary build the binary tree list, and in order to sequence the output

实现树的创建算法，创建一个至少包含3层，8个结点的二叉树，并对此树实现先中后序的递归遍历算法。输出三种遍历结果。再实现一个叶子结点查找算法，判断一个给定的数值是否在此树中作为叶子结点。-To achieve the creation of the tree algorithm, to create at least a three-layer, 8 nodes of a binary tree, and after this tree in order to achieve the first recursive traversal algorithm. Output the results of three kinds of traversal. And then to achieve a leaf node search algorithm to determine whether a given value in this tree as a leaf node.