Search Results for "minimum spanning tree"

MLPACK is a C++ machine learning library with emphasis on scalability, speed, and ease-of-use. Its aim is to make machine learning possible for novice users by means of a simple, consistent API, while simultaneously exploiting C++ language features to provide maximum performance and flexibility for expert users. * More info + downloads: https://mlpack.org * Git repo: https://github.com/mlpack/mlpack

JUL Designer is a RAD tool used to visually build a JavaScript application. Given a component based application running in an event-driven environment, JUL Designer helps you to generate the component tree with the attached event listeners. It also generates the JavaScript code for the current component tree. System requirements / Download the desktop app OR: * a CSS2.1 compliant web browser with JavaScript 1.5 or later engine * Node.js 0.10.0 or later installed * OR a web...

JCS - JUL Comment System is a way of documenting your JavaScript source code while keeping the comments in a separate file. It allows you to associate the comments to any version of the source code and to get the updated commented code. Also, JCS is able to generate and to document the code for an entire JavaScript namespace or DOM tree loaded by a web page. System requirements / Download the desktop app OR: * a CSS2.1 compliant web browser with JavaScript 1.5 or later engine...

Satsuma is a graph library for .NET, written in C#. Satsuma is an easy-to-use and flexible library, which implements all the necessary graph structures, and the fastest possible graph algorithms. DOCUMENTATION: http://satsumagraph.sourceforge.net/ Satsuma is not a charting library. 'Graph' is used in the mathematical sense here (e.g. nodes connected with arcs). Satsuma is released under the zlib license. This license is very permissive and allows you to use Satsuma for both personal...

Traditional Computer Science algorithms and data structures implemented in JavaScript. Algorithms such as collatzConjecture, extendedEuclidean, fastPower, fibonacci, findDivisors, fisherYates, gcd (Greatest common divisor), greatestDifference, lcm (Least common multiple), newtonSqrt, nextPermutation, powerSet, reservoirSampling, shannonEntropy, etc.

This JSP Tree viewer comes with fewer Java Scripts. So it will not depend on browser versions. My other projects : Simplest JAX WS client https://sourceforge.net/projects/easyjaxwsclient/ Happiness never comes with money. Happy Free and Open Source Time to you. Inbox me if you need help. skonkaduwa@gmail.com Saminda Konkaduwa @Pearl in the Indian Ocean

The Access Road software is a universal simulator of access controls that is intended to improve design and auditing of IT security. Access Road offers the out-of-the-box simulations of GNU/Linux Ubuntu® (components and rights on the file system), MySQL Server®, and a generic Role-Based-Access-Control application to adapt to your needs. It is designed for database, system, and application administrators, IT architects and developers, auditors. Access Road provides a full simulation of...

Alternative approach to minimum redundancy coding (fixed-length) without using tree data structures. The main advantages are simplicity and flexibility.

This project provides IEEE 802.1d Rapid Spanning Tree Protocol (RSTP) in Linux Kernel. The project is based on the existing ethernet bridging functionality in Linux Kernel.

Rapid Spanning Tree (RSTP, 802.1w) Library & Simulator

A minimalistic CASE tool that will allow end-users to analyze their graphs (plain-old graphs, UML diagrams, ERDs, etc.) by applying various graph theory functions to them (such as a shortest path algorithm or a spanning tree algorithm.)