Search - digital search tree

Search - digital search tree - List

[Data structs] datrie_cvs20061001.tar DL : 0: This an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries. See the details of the implementation at [2]: http://linux.thai.net/~thep/datrie/datrie.html Historically, this was first implemented as C++ classes in a library called midatrie [2], but later simplified and rewritten from scratch in C.-This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries. See the details of the implementation at [2]: http://linux.thai.net/~thep/datrie/datrie.html Historically, this was first implemented as C++ classes in a library called midatrie [2], but later simplified and rewritten from scratch in C.
Update : 2025-02-17 Size : 34kb Publisher : lucoy
[AI-NN-PR] NineGrid DL : 0: 八数码问题的C++程序代码。八数码问题是个典型的状态图搜索问题。搜索方式有两种基本的方式，即树式搜索和线式搜索。搜索策略大体有盲目搜索和启发式搜索两大类。盲目搜索就是无“向导”的搜索，启发式搜索就是有“向导”的搜索。-8 digital issues of C++ program code. Digital 8 is a typical problem of the state map search problems. There are two basic search methods, namely, tree-type search and linear search. Search strategy has largely blind search and heuristic search two categories. Blind search is no " wizard" of the search, heuristic search is a " guide" the search.
Update : 2025-02-17 Size : 54kb Publisher : 李建峰
[Other] HBDS_TRE DL : 0: it is a hierchical binary digital search tree.
Update : 2025-02-17 Size : 1kb Publisher : devendraupadhyay567
[SCM] 51-practical-subroutine-(assembly) DL : 0: 第1章二进制定点数运算第2章二进制浮点数运算第3章十进制（BCD码）数运算第4章代码转换第5章数据变换第6章排序、查找和非线性算法第7章数学函数第8章树和图第9章延时与跳转控制第10章人机交互接口第11章单片机测控接口第12章 51单片机内部资源编程实例第13章单片机数据传输接口第14章波形发生与控制实例第15章 C51单片机软件抗干扰和数字滤波-Chapter 1 dot binary number operations Chapter 2 binary floating-point arithmetic Chapter 3 decimal (BCD) several operations Chapter 4 code conversion Chapter 5 data transform Chapter 6, sort and search and nonlinear algorithm Chapter 7 mathematical functions Chapter 8 and FIG tree Chapter 9 delay and jump control Chapter 10 human-computer interaction interface Chapter 11 microcontroller measure-control interface Chapter 12 51 SCM internal resources programming examples Chapter 13 single-chip microcomputer data transmission interface Chapter 14 waveform occurrence and control example Chapter 15 C51 software anti-interference and digital filter
Update : 2025-02-17 Size : 120kb Publisher : 张志刚
[SCM] ds18b20-search DL : 0: 单总线数字温度传感器DS18B20二叉树搜索算法，带Protues仿真文件。-Single-bus digital temperature sensor DS18B20 binary tree search algorithm with the Protues simulation files.
Update : 2025-02-17 Size : 110kb Publisher : snake
[VC/MFC] zz DL : 0: 对于八数码问题，设初始状态和目标状态如图3.2所示。设d (x)表示节点x在搜索树中的深度，评估函数为f (x)=d (x)+w(x)，其中w(x)为启发式函数。试按下列要求给出八数码问题的搜索图，并说明满是一种A*算法，找出对应的最优搜索路径-For eight digital problem, set the initial state and the target state shown in Figure 3.2. Let d (x) indicates that the node x in the depth of the search tree, the evaluation function f (x) = d (x)+ w (x), where w (x) is a heuristic function. Test requirements given in the following figure eight digital search, and a full description of A* algorithm to find the corresponding optimal search path
Update : 2025-02-17 Size : 182kb Publisher : 曹晓沛