Search Results for "spanning tree"
Sort By:
Showing 20 open source projects for "spanning tree"
View related business solutions-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
1
mapgen2
Map generator for games
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... -
2
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
-
3
popt4jlib
Parallel Optimization Library for Java
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... -
4
MSTgold
Estimate minimum spanning trees with statistical bootstrap support
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. ... -
Powerful App Monitoring Without Surprise BillsTired of monitoring tools that punish you for scaling? AppSignal offers transparent, predictable pricing with every feature unlocked on every plan. Track errors, monitor performance, detect anomalies, and manage logs across Ruby, Python, Node.js, and more. Trusted by developers since 2012 with free dev-to-dev support. No credit card required to start your 30-day trial.
-
5
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).
-
6
E-Reader
Extreem Reader for Cosmological simulation data P-Gadet2 and ART codes
Extreem Reader for Cosmological simulation data P-Gadet2 and ART codes.It conserves memory by using memory mapped files. Contains some basic analysis tools such a KD-Tree, Minimum Spanning Tree, and rendering module using PMViewer algorithm. -
7
Rapid Spanning Tree Protocol (RSTP) implementation for Linux. This project is active on http://git.kernel.org/cgit/linux/kernel/git/shemminger/rstp.git/?h=master but not much forum and support for cross compiling and for bug report and fix. Here it is forked to help and maintain forum.
-
8
algorithms.js
Classic algorithms and data structures implemented in JavaScript
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. -
9
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.
-
Stop Storing Third-Party Tokens in Your DatabaseRolling your own OAuth token storage can be a security liability. Token Vault securely stores access and refresh tokens from federated providers and handles exchange and renewal automatically. Connected accounts, refresh exchange, and privileged worker flows included.
-
10
-
11
Multiple Spanning Tree Protocol daemon !! THE PROJECT HAS MOVED: https://github.com/mstpd/mstpd !! !! THIS REPOSITORY HAS HISTORICAL VALUE ONLY !!
-
12
Simple Java Database
Simple Database written in Java
A simple database with commands similar to those of SQL. It is to be run from the command line. (java -jar DatabaseJAR.jar) The application allows users to create tables, add data to the tables, view data from tables using various filters, back-up and restore the database, read commands from a text file, perform various set operations (such as union and intersection) on tables, and define indices on tables to allow faster manipulation. (To simplify the binary tree structure, the define... -
13
DistRoboNet
Evaluation of Distributed Algorithms in Mobile Robot Networks
...Algorithms and methods to be evaluated include: a multidimensional cellular automata-based approach to robot formation control; push and insertion methods for distributed auctioning and task allocation; a distributed spanning tree communication protocol for collective situational awareness; and a thermodynamics-inspired approach to group-level obstacle avoidance. -
14
IEEE 802.1d ethernet bridging (plus Spanning Tree protocol) for the linux kernel. Kernel code is in Linux 2.4 and 2.6 kernels.
-
15
crfparser is a simple open source projective Maximum Spanning Tree dependency parser for practical natural language processing applications.
-
16
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.
-
17
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.
-
18
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.
-
19
-
20
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.)
- Previous
- You're on page 1
- Next
