构造前缀树，深度广度优先搜索等功能。 This library is an implementation of the suffix tree algorithm applied to indexing. A search on "suffix trees Ukkonen" on a search engine should give you an idea of what I'm talking about. The interesting points are a linear index
树容器 tree.h The tree.hh library for C++ provides an STL-like container class for n-ary trees, templated over the data stored at the nodes. Various types of iterators are provided (post-order, pre-order, and others). Where possible the access methods
Descr iption ----------- B+ Tree is a type of tree, which represents sorted data in a way that allows for efficient insertion, retrieval and removal of records, each of which is identified by a key. It is a dynamic, multilevel index, with maximum an
Data has an important and unique role to play in modern civilization: in addition to its historic role as the raw material of the scientific method, it has gained increasing recognition as a key ingredient of modern industrial and business engineeri
Whether you are new to data mining or are a seasoned expert, this book will provide you with the skills you need to successfully create, customize, and work with Microsoft Data Mining Suite. Starting with the basics, this book will cover how to clea
You've got data to communicate. But what kind of visualization do you choose, how do you build it, and how do you ensure that it's up to the demands of the Web? In Data Visualization with Javascr ipt, you'll learn how to use Javascr ipt, HTML, and C
Combining knowledge with strategies, Data Structure Practice for Collegiate Programming Contests and Education presents the first comprehensive book on data structure in programming contests. This book is designed for training collegiate programming
