Search Tree

Tree::Binary::Search is a binary search tree for Perl. SYNOPSIS use Tree::Binary::Search; my $btree = Tree::Binary::Search->new(); $btree->useNumericComparison(); $btree->insert(5 => "Five"); $btree->insert(2 => "Two"); $btree->insert(1 => "One"); $btree->insert(3 => "Three");... Platforms: *nix

libgist provides a generalized search tree C++ library. This directory contains the 2.0 release of the GiST C++ library. Please refer to our WWW home page located at for updates on documentation and new releases. libGiST is not public domain software. It is copyrighted by the University of... Platforms: *nix

A stack-based sequential depth-first decoder that returns Maximum-Likelihood solutions to M-QAM modulated MIMO system-type problems, i.e., a lattice decoder with optional justified rectangular boundary control. In such problems, the depth of the search tree is known and the number of children per... Platforms: Matlab

This is a program able to play the connect-four game, using a minimax tree search. The interesting part is that the search tree is independent of the heuristic and can be reused. Is written in compiled java. Platforms: Windows, Mac, Linux

Gecode/J is a Java interface for the Gecode C++ constraint programming library. It allows you to: model and solve constraint problems in Java. explore the search tree with our tree visualization tool. Either using the built-in depth-first search strategy, or manually and interactively.... Platforms: *nix

Grid based special divisions and search tree based sorted lists are used to optimize basic calculations.It was built and optimized for Flash 10. Platforms: Flash

libx1f4l2 is a data structures library. Featured are BST backed lists. The BST (binary search tree) backed lists are all purpose lists, allowing for sequential and random access. The complexity for most operations is log(N) Platforms: *nix

C Algorithms Library is a collection of commonly used Computer Science algorithms. The focus is on code that is well documented and tested, portable, and reusable. The C Programming Language has a much smaller standard library compared to other more modern programming languages such as Java... Platforms: *nix

DSA extensions contains classes similar in purpose to the classes provided in java.util. Currently, it contains sortable Lists and Maps, as well as a balanced binary search tree and a binary array search algorithm. Platforms: Windows, Mac, Linux

A stack-based sequential priority first decoder that returns Maximum-Likelihood solutions to M-QAM modulated MIMO system-type problems, i.e., a lattice decoder with optional justified rectangular boundary control. In such problems, the depth of the search tree is known and the number of children... Platforms: Matlab

A stack-based sequential priority first decoder that returns Maximum-Likelihood solutions to spherical LAST coded MIMO system-type problems, i.e., a lattice decoder with spherical boundary control. In such problems, the depth of the search tree is known but the number of children per node is not... Platforms: Matlab

A stack-based sequential depth-first decoder that returns Maximum-Likelihood solutions to spherical LAST coded MIMO system-type problems, i.e., a lattice decoder with spherical boundary control. In such problems, the depth of the search tree is known but the number of children per node is not... Platforms: Matlab

A stack-based sequential priority first decoder that returns Maximum-Likelihood solutions to spherical LAST coded MIMO system-type problems, i.e., a lattice decoder with spherical boundary control. In such problems, the depth of the search tree is known but the number of children per node is not... Platforms: Matlab

Pleased to introduce a small and hopefully useful program SiMiUP. This is a free memo pad type wiki. His personality trait is the ability to encrypt any note with any password . Without a password can not decipher it, even us. Over time, each note will acquire a unique, own properties.... Platforms: Windows, Windows 8

When the dataset is small, when you have to run only a few number of search, or when the dimensions of points is large, the brute search method is still faster than kd-trees data structure. Computing the distances one by one take a minor time than building the tree.Some of this problems have... Platforms: Matlab

Legacy Family Tree is an award winning full-featured professional genealogy program that helps you track, organize, print, and share your family history. The program is free and has no restrictions. (A Deluxe Edition is also available.) The user interface is easy-to-use and is always... Platforms: Windows

dtRdr::GUI::Wx::SearchTree is a Perl module that can display search results as a tree. SYNOPSIS Methods book_root Create a root for the book. $tree->book_root($book); When were displaying multiple books, this will not be the root of the tree? want_item $item =... Platforms: *nix

Tree::Visualize is a Perl module for visualizing Tree structures. SYNOPSIS use Tree::Visualize; use Tree::Binary; my $tree = Tree::Binary->new("*") ->setLeft( Tree::Binary->new("+") ->setLeft(Tree::Binary->new("2")) ->setRight(Tree::Binary->new("2")) ) ->setRight(... Platforms: *nix

In this file you can find a simple but very effective algorithm for Nearest Neighbour Search which I megalomaniacly called the GLTree.You want more? go to the Professional version of GLTreeIt has been designed for uniformly random data, where is the fastest I ever used, but works fine even on... Platforms: Matlab

this file you can find a simple but very effective algorithm for Nearest Neighbour Search which I megalomaniacly called the GLTree.You want more? go to the Professional version of GLTreeIt has been designed for uniformly random data, where is the fastest I ever used, but works fine even on sparse... Platforms: Matlab