Search Results for "spanning tree"

mapgen2 is a procedural map / island generator intended for games. It focuses on generating continent/island style maps (coastlines, mountains, rivers, etc.) with a vector / polygonal structure rather than a full high-resolution tile grid. Originally written in ActionScript, this tool emphasizes generating aesthetically pleasing island maps with realistic natural features while keeping computational complexity manageable. It supports exporting to SWF (Flash) via appropriate tooling. The most...

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

popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known...

Minimum spanning tree (MST) algorithms can generate multiple, equally-minimal, MSTs but MST programs typically report only one, arbitrarily chosen MST. Similarly, most MST programs do not provide statistical metrics to support the credibility of the MSTs that they estimate. MSTgold estimates the number of alternative MSTs, reports up to a user-determined number of those trees, reports a consensus tree, and implements a bootstrapping metric to assess the reliability of alternate MST solutions. ...

A educational Java software featuring a graph editor and algorithms animation to learn how the algorithms work. Algorithms: Breadth First Search (BFS), Depth First Search (DFS), Minimum Spanning Tree (Prim), Single-Source Shortest Path (Dijkstra), Maximum Flow (Edmonds-Karp).

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.

Implementation of minimum spanning tree (MST) algorithms.

crfparser is a simple open source projective Maximum Spanning Tree dependency parser for practical natural language processing applications.

Weyland is a tool that collects information about a switched network, presents the information in a convenient format, and displays a graph of the spanning tree of the network.

A Java userland file synchronization program that runs as a daemon. Designed synchronize between many systems simultaneously. Builds a minimal spanning tree for bandwidth efficient update distribution.

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.)