Minimal Spanning Tree Algorithm

We use the idea of Chu-Liu/Edmonds Algorithm, see paper [1,2], to implement four functions here.1. Maximal Directed Maximum Spanning Tree By DirectedMaximumSpanningTree.m2. Minimal Directed Maximum Spanning Tree By DirectedMinimalSpanningTree.m3. Maximal Directed Maximum Spanning Forest By...

Gato (Graph Animation Toolbox): Animate graph algorithms for example for computing shortest paths, minimal spanning trees, maximum flows or maximal cardinality or weight matchings. Create your own animations using the Animated Data Structures (ADS).

This script is a simple example demonstrating the construction of binary trees.


Platforms: Windows, Mac, *nix, Python, BSD Solaris

This script implements the Union Find data structure and algorithm. This data structure allows one to find out which set an object belongs to, as well as join two sets. The algorithm's performance, given m union/find operations of any ordering, on n elements has been shown to take log* time per...


Platforms: Windows, Mac, *nix, Python, BSD Solaris

Itzam/Java project is a pure Java reimplementation of the Itzam embedded database engine, and it is 100% interoperable with files created by Itzam/Core. Since Itzam/Core is the basis of wrappers written in languages such as C++ and Python, Itzam/Java is compatible with those language libraries...


Platforms: *nix

The QuickGraph package will provide generic directed / undirected graph datastructures and algorithms for .Net 2.0 and up. QuickGraph comes with algorithms such as depth first seach, breath first search, A search, shortest path, k-shortest path, maximum flow, minimum spanning tree, least common...


Platforms: Windows

Peklo is a graph editor and an environment for visualizing and comparing different algorithms for some graph-theoretic problems, e.g. flows, shortest path, minimum spanning tree.


Platforms: *nix

BNet is an exact Bayesian inference library for C++. This library implements the junction tree algorithm for discrete variable Bayesian networks. Examples are provided to illustrate its capabilities. Installation: type make to compile everything type make doc to compile the documentation...


Platforms: *nix

This package provides a fully functional and complete ActiveX control. The control depicts a spanning tree. It's sort of the same control that the Microsoft Visual InterDev 6.0 uses to design and maintain the navigation structure for a Web site. The control can be used to build a site diagram....


Platforms: Windows

The archive includes genfis4.m that generates Mamdani- and Sugeno-type FIS using CART algorithm to extract fuzzy rule information from data set. It is based mostly on Fuzzy Logic Toolbox but it has required to modify Toolbox's fuzzy rule building principle. As a result some original m-files was...


Platforms: Matlab

Creata-Tree creates one of the most powerful JavaScript menu trees available for your web site. It comes complete with installation and un-installation. The program has a nice tree view for you to layout items and it's very straightforward. Creata-Tree requires only basic HTML skills. The...


Platforms: Windows

Algorithm::Huffman is a Perl extension that implements the Huffman algorithm. SYNOPSIS use Algorithm::Huffman; my %char_counting = map {$_ => int rand(100)} (a .. z, A .. Z); # or better the real counting for your characters # as the huffman algorithm doesnt work good with random data...


Platforms: *nix

Tree::Binary is a Object Oriented Binary Tree for Perl. SYNOPSIS use Tree::Binary; # a tree representaion of the expression: # ((2 + 2) * (4 + 5)) my $btree = Tree::Binary->new("*") ->setLeft( Tree::Binary->new("+") ->setLeft(Tree::Binary->new("2")) ->setRight(Tree::Binary->new("2"))...


Platforms: *nix

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

Algorithm::AhoCorasick::SearchMachine provides an implementation and low-level interface of Algorithm::AhoCorasick. Feeds input to the state machine. First (after the instance) argument of this method is the input text (which can be empty, in which case the method doesnt do anything), second...


Platforms: *nix

at32 Manager Tree was developed to be an applet that simply pops up a pane on the right hand side of your screen, and is essentially a tree structure. You can add new topics or simple text files (for making notes). In addition, via a right click pop-up menu you can access the appropriate topic's...


Platforms: Windows

Minimal XML very small and efficient lib is a library to handle XML documents storing them in a DOM-like tree, witten for C and C++. The library allows to load or write documents from files or memory, and provides callbacks for read and write progress.


Platforms: *nix

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

Imagine beautiful quiet lake among the green mountains. The very old oak tree grows on the small island at the midst of the water. This is the Magic Tree. Only one night of the year the strange appealing halo surrounds it, emitting colourful sparkles. This night Magic Tree grants the wishes of...


Platforms: Windows

Top winner of the BCB contest 2006 "Minimal Website" is a program to make a complete websites from plain texts. The texts are translated to formatted HTML contents automatically which then are embedded in a common layout for the website. A navigation menu is generated automatically too. Colors,...


Platforms: Windows