Search - file Tree B

Search - file Tree B - List

[Data structs] OPT DL : 0: 从输入文件中读取数据,构造最优二叉树,输入文件格式如下: 节点的值出现概率例如: A 0.001 B 0.25-Read from the input file data, the optimal binary tree structure, input file format is as follows: node probability value such as: A 0.001B 0.25
Date : 2026-01-10 Size : 905kb User : 魏木木
[Data structs] Haffmancode DL : 0: 课程设计： 1.求出在一个n×n的棋盘上，放置n个不能互相捕捉的国际象棋“皇后”的所有布局。 2.设计一个利用哈夫曼算法的编码和译码系统，重复地显示并处理以下项目，直到选择退出为止。【基本要求】 1) 将权值数据存放在数据文件(文件名为data.txt，位于执行程序的当前目录中) 2) 分别采用动态和静态存储结构 3) 初始化：键盘输入字符集大小n、n个字符和n个权值，建立哈夫曼树； 4) 编码：利用建好的哈夫曼树生成哈夫曼编码； 5) 输出编码； 6) 设字符集及频度如下表：字符空格 A B C D E F G H I J K L M 频度 186 64 13 22 32 103 21 15 47 57 1 5 32 20 字符 N O P Q R S T U V W X Y Z 频度 57 63 15 1 48 51 80 23 8 18 1 16 1 -Curriculum design: 1. Obtained in an n × n chessboard, the place to catch each other should not n个chess "Queen" of all the layout. 2. The design of a use of Huffman coding and decoding algorithms systems, and deal with duplicate to show the following items until the exit date selection. The basic requirements 【】 1) will be the right value data stored in data files (file named data.txt, located in the implementation of procedures in the current directory) 2), respectively, dynamic and static storage structure 3) Initialization: keyboard input character set size of n, n and n characters of the right value, set up Huffman tree 4) Coding: Using the built Huffman tree generated Huffman coding 5) output coding 6) The character set and the frequency of the following table: Space characters A B C D E F G H I J K L M Frequency of 186 64 13 22 32 103 21 15 47 57 1 5 32 20 Character N O P Q R S T U V W X Y Z Frequency 57 63 15 1 48 51 80 23 8 18 1 16 1
Date : 2026-01-10 Size : 538kb User : 赵刚
[Data structs] shujujiegou DL : 0: 以广州旅游业为背景，设计一个变长记录文件存取类库。程序采用B+树作为索引系统，支持字节流嵌入方式和文件链接方式，以较友好的用户界面，加强程序容错性-Guangzhou tourism industry as the background, to design a variable-length record file access library. Program uses B+ tree as an indexing system to support byte-stream mode and file link embedded approach to a more user-friendly interface, to strengthen the process fault tolerance
Date : 2026-01-10 Size : 3.43mb User : liang
[Data structs] bBplusDotNet DL : 0: B树,源代码，根据B树的算法原理，可生成相应的B树文件。内有完整的生成工程算法和测试工程，并且全部测试通过。-B tree, the source code, according to B tree algorithm principle, can generate the corresponding B-tree file. There are a full generation of engineering algorithms and test engineering, and all the test.
Date : 2026-01-10 Size : 342kb User : 勇
[Data structs] B-tree.tar DL : 0: TBTree.h is the file, which contains the implementation of the B-tree data structure.
Date : 2026-01-10 Size : 3kb User : xlong
[Data structs] CIAdatabase DL : 0: 解析一个文件中的内容，以B tree的方式存储其中的国家，职位，人民，是一个基于B TREE的搜索算法实现。包括了源代码，原始文件以及搜索案例-Parse the contents of a file to B tree stored in a manner which the state, position, people, is a B TREE-based search algorithm. Including the source code, the original case file and search
Date : 2026-01-10 Size : 2.01mb User : leo
[Data structs] DST DL : 0: 大二数据结构的实验，里面包含实验报告、源码、可执行文件，用VC++6.0开发的。动态查找表。功能齐全，实现二叉排序树、平衡二叉树、B_树、2-3树、B+树。- Experimental sophomore data structures, which contains experimental reports, source code, executable file, using VC++6.0 development. Dynamic look-up table. Functional, to achieve binary sort tree, balanced binary tree, B_ tree, 2-3 tree, B+ trees.
Date : 2026-01-10 Size : 559kb User : 麦思明
[Data structs] 4 DL : 0: B+树用以进行排序，建立检索表，进行一定范围的数据的查找，和文件目录下文件的管理,提高检索的速度-B+ tree for sorting, the establishment of keys, to find a range of data, files and file directory management and improve the speed of retrieval
Date : 2026-01-10 Size : 6kb User : ok
[Data structs] Btree DL : 0: This a C++ code. The task is to construct a B-tree. Given some leaves values, it is required to construct the corresponding tree and assess a range of evaluations for the variables, indicating that the result returned. please find the full description in the file.-This is a C++ code. The task is to construct a B-tree. Given some leaves values, it is required to construct the corresponding tree and assess a range of evaluations for the variables, indicating that the result returned. please find the full description in the file.
Date : 2026-01-10 Size : 4.08mb User : Mona Saleh
[Data structs] DB_ii_Final DL : 0: 基于二进制文件的B+数索引和倒排文件，其中B+树的删除利用插入实现-Achieve based on the number of binaries B index and the inverted file, including the deletion of the B-tree by inserting
Date : 2026-01-10 Size : 275kb User : eros
[Data structs] algorithms-master DL : 0: 1. 经典的算法实现 2. 服务器端 3. 正确，易于使用和改造, 一个头文件一个算法，并附带一个demo. 1. 一个算法用一个.h文件表示放到include下.2. 算法演示的demo程序放到src下.3. 程序正确通过后，请发起Pull Requests，代码被验证后入库，并在README中发布新算法实现。已实现 ( Implemented ): Array shuffle Prime test(trial division) Prime test(Miller-Rabin s method) 2D Array Arbitary Integer Linear congruential generator Maximum subarray problem Bit-Set Queue Stack Binary Heap Fibonacci Heap Priority Queue (list based) Bubble sort Selection sort Insertion sort Radix sort Quick sort Merge sort Heap sort Double linked list Skip list Self-organized linked-list ops (move-to-front, move-ahead-one) Largest common sequence Binary search tree Dynamic order statistics Red-black tree Interval tree Prefix Tree(Trie) Suffix Tree B-Tree Suffix Array等-(classical algorithms implementations) (based on linux/gcc) (correct! and ease of use, one .header file per algorithm) one .header file per algorithm. )( one demo per algorithm. )(Please Use Fork+Pull Requests !!! Correctness is the most important!)
Date : 2026-01-10 Size : 1.56mb User : 汪小君