常见java数据结构的使用方法，包括Arrays类Collections类HashSet类List类TreeSet类Map类Vector类...

稀疏矩阵的基本运算。-sparse matrix of basic operations.

轻量级数据库，动态DLL，不需要安装直接使用。-small database， link DLL，and need not intall any program。

此书详细的介绍了各种流行和重要的图算法 识货的就下咯-book detailed account of a popular and important map know the quality of the algorithm on the basis of 1,10

数据结构基础学习程序，在TURBO C++集成环境中使用，特别适合数据结构初学者参考使用-Data structure based on the learning process, in the TURBO C++ Integrated environment, in particular data structure suitable for use and reference for beginners

学校景点分布图最佳路径选择，通过最短路径选择让游者能够自由选择最佳观赏路径-schools attractions distribution choose the best path through the shortest path chosen You can watch free to choose the best path

本书是关于计算机科学与工程领域的基础性研究科目之一――数据结构与算法的专著。 本书在简要回顾了基本的C++ 程序设计概念的基础上，全面系统地介绍了队列、堆栈、树、图等基本数据结构，以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法，为数据结构与算法的继续学习和研究奠定了一个坚实的基础。更为可贵的是，本书不仅仅介绍了理论知识，还提供了50多个应用实例及600多道练习题。 本书内容广博权威，结构清晰合理，是一本全新的有关数据结构与算法的教材，对于计算机科学与工程领域的从业人员也是一本很好的参考书。-the book is on the computer science and engineering fields, the basis for one of the subjects of study-- data structure and algorithm monographs. The book in a brief review of the basic design concept C program on the basis of a comprehensive and systematic introduction of the queue, stack, trees and map basic data structure and the greedy algorithm, divide and conquer algorithm, branch-and-bound algorithm multiple algorithm design methods, data structures and algorithms for continuous learning Research and lay a solid foundation. Even more valuable is that the book not only on the theoretical knowledge but also provided more than 50 application examples and more than 600 Exercises Road. The contents broad authority, a clear and reasona

数据结构中的链表类实现多项式的相加 用C++实现!-Linked list data structure in the sum of polynomial-type implementation with C++ implementation!

一个适用于水文系统水情信息在局域网是的传输软件-apply to a regimen hydrological information system on LAN is the transmission software

数据结构答案2，经多次修改而成，比答案册的还要简单清楚。-answer two data structure, several revisions, the book also answers simple and clear.

清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;