Linked-list-version-judge

数据结构的二叉-the binary tree data structure tr

一． 问题描述很多涉及图上操作的算法都是以图的遍历为基础的。试写一个程序，演示在连通的无向图上访问全部节点的操作。二． 基本要求以邻接多重链表为存储结构。实现连通无向图的深度和广度优先遍历。以用户指定的节点为起点，分别输出每种遍历下的节点访问序列和相应生成树的边集。-one. Description many issues involving maps of algorithms are to traverse the map-based. A written test procedures, demonstrating the connectivity of undirected graph visit all the nodes on the operation. 2. Adjacent to the basic requirements for storage of multiple linked list structure. Connectivity to the map without the depth and breadth- first traversal. User specified nodes as a starting point, the output of each node traversal visit Spanning Tree sequence and the corresponding set of edges.

图的建立与多种遍利方法-map and the establishment of a variety of methods !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! good times

说明：  c4.5 关于决策树decision tree的matlab实现程序 (c4.5 decision tree decision tree on the realization of the matlab program)

CSharp下的图书管理系统源码，值得学习-CSharp under the library management system source code, it is worth learning

数据结构的java实现-data structure to achieve the java

软件简介：（贸易管理系统Delphi源代码（有开发文档） 采用access+delphi设计 软件实现功能：供应商信息的输入，修改，查询； 顾客信息的输入，修改，查询； 商品信息的输入，修改，查询； 进货信息的输入，修改，查询； 销售信息的输入，修改，查询。 输入：输入数据记录，并提交，可以保存入数据库； 输入信息包括 供货商： 供应商编号-software description : (Trade Management System Delphi source code (with the development of documentation) using access delphi design software functions : information provider input, modify and inquiries; Customer information input, modify and inquiries; Information on the importation of goods, modify, inquiries; NT information on the importation, modification, inquiries; sales information input, modify inquiries. input : input data records, and submitted it to keep the database; input suppliers including : provider number

通过冒泡排序法和选择排序法实现对若干数字的排序。(To achieve the order of several numbers)

数据结构的电子教案，对各章的重点说的比较清楚-Data structure of electronic lesson plans, the focus of the chapter, said the relatively clear

该代码实现了深拷贝的问题，对于深拷贝进行了一系列的介绍，并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)