The MatlabBGL library fills a hole in Matlab's suite of algorithms. Namely, it provides a rich set of algorithms to work with graphs, as in graph theory graphs. The MatlabBGL package uses Matlab's native sparse matrix type as a graph and provides algorithms that work
The algorithms included are
Searching: breadth first search,depth first search, and astar (A*) search
Shortest Path Algorithms: Dijkstra's...
Aleph-w is a library of data structures and algorithms implemented in and for C++.
It contains the main data structures: single and double lists, special arrays (dynamic and of bits), many types of trees: multitrees, binary search...
This little application generates Mandelbrot/Frame's fractal trees in Python (see http://www.math.union.edu/research/fractaltrees/). Given an iteration depth, a trunk length, and a branching angle, this algorithm generates the corresponding tree....
Over recent releases, Statistics Toolbox has included new functionality for multivariate classification methods, including cross-validation, feature selection, Nadodcve Bayes, bagged decision trees, ROC performance curves and integration with...
% This function allow you to build 3D-fractal trees
% by using modified algorithms based on the so-called Kantor`s array
% and method of inverse trace
% These methods allow you to economise time and computer memory
%...
% This function allow you to bild fractal trees
% by using modified algorithms based on the so-called Kantor`s array
% and method of inverse trace
% These methods allow you to economise time and computer memory
%...
Nile is a project management and flow charting tool that combines traditional tools like Gantt charts with fluid object diagrams and structural trees, all in a rich user interface. Nile will be available in both desktop and web-based form.
Allows multi-value fields to be stored and displayed as hierarchical trees. Basically any Field API field can be transformed into a tree.
implementation of graph algorithms including maximal flow/minimal cut,cheapest max flow, maximal matching, strong connectivity, topological sorting, shortest path,dfs,bfs and minimal spanning tree
The Simple Declarative Language provides an easy way to describe lists, maps, and trees of typed data in a compact, easy to read representation.
A small script for creating DHTML trees dynamically.
This applet draws trees using calculations. Source code available.
Likno Drop-Down Menu Trees is more than a powerful cross-browser, platform-independent html tree control for your web pages. It's an intuitive way of showing structured information and providing your visitors with the means to manipulate this...
Likno Drop-Down Menu Trees is more than a powerful cross-browser, platform-independent html tree control for your web pages. It's an intuitive way of showing structured information and providing your visitors with the means to manipulate this...
My implementation of 2-3 Trees on python
A simple example demonstrating the construction of binary trees.
The union find data structure is primarily used for Kruskal's Minimum Spanning Tree algorithm, though can be used whenever one only needs to determine of two items are in the same set, and be able to combine sets quickly.
The watch_directories() function takes a list of paths and a callable object, and then repeatedly traverses the directory trees rooted at those paths, watching for files that get deleted or have their modification time changed. The callable...
This recipe draws a dendrogram (horizontal format used for evolutionary trees), as ASCII text, given as input a binary tree in the form of a tuple for each tree node. Tree leaves can be any Python object other than a length-2 tuple, and are...
Binary search trees provide O(lg n) performance on average for important operations such as item insertion, deletion, and search operations. Balanced trees provide O(lg n) even in the worst case.
GNU libavl is the most complete,... | 
