Search Results for "minimum spanning tree"
Sort By:
Showing 35 open source projects for "minimum 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.
-
Host LLMs in Production With On-Demand GPUsDeploy your model, get an endpoint, pay only for compute time. No GPU provisioning or infrastructure management required.
-
1
dive
A tool for exploring each layer in a docker image
A tool for exploring a docker image, layer contents, and discovering ways to shrink the size of your Docker/OCI image. As you select a layer on the left, you are shown the contents of that layer combined with all previous layers on the right. Also, you can fully explore the file tree with the arrow keys. Files that have changed, been modified, added, or removed are indicated in the file tree. This can be adjusted to show changes for a specific layer, or aggregated changes up to this layer.... -
2
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... -
3
OpenXR SDK
Generated headers and sources for OpenXR loader
OpenXR is a royalty-free, open standard that provides high-performance access to Augmented Reality (AR) and Virtual Reality (VR), collectively known as XR, platforms and devices. This repository contains OpenXR headers, as well as source code and build scripts for the OpenXR loader. It contains all generated source files and headers pre-generated for minimum dependencies. The OpenXR 1.0 specification is free for anyone to download, review and comment. Without a cross-platform standard, VR... -
4
Broot
A new way to see and navigate directory trees
Get an overview of a directory, even a big one. That's what makes it usable where the old tree command would produce pages of output. Hit alt/enter and you're back to the terminal in the desired location. This way, you can navigate to a directory with the minimum amount of keystrokes, even if you don't exactly remember where it is. Broot is fast and doesn't block (any keystroke interrupts the current search to start the next one). -
Save Up to 91% on Cloud Compute With Spot VMsRun batch jobs at 60-91% off with Spot VMs. Long-running workloads get automatic discounts with sustained use.
-
5
jul-designer
JUL Designer - a RAD tool for JavaScript
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 server with PHP 5.2.0 or later extension * 1024x768 minimum resolution All major browsers supported, including: FF 4+, IE 8+, Edge, Safari 4+, Chrome 2+, Opera 10+., IOS 4+, Android 2.3+. -
6
jul-comments
JCS - JUL Comment System
...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 * Node.js 0.10.0 or later installed * OR a web server with PHP 5.2.0 or later extension * 1024x768 minimum resolution All major browsers supported, including: FF 4+, IE 8+, Edge, Safari 4+, Chrome 2+, Opera 10+., IOS 4+, Android 2.3+. -
7
Metztli Reiser4
Reiser4 SFRN 4.0.2 /Zstd Debian Trixie minimal install media ISO/USB
Modified Debian netboot with rtw89 WiFi-support install image suitable to be 'burned' onto ~340 MB CD|USB media with command (assuming USB device is at /dev/sdc *else* modify or you risk data loss) at Linux shell: dd if=metztli-reiser4.iso of=/dev/sdc bs=4M; sync Enables native reiser4 create/partition/format of storage media during Debian OS installation—accomplished via Internet. Guided non-expert install defaults to 500MB /boot JFS & reiser4 non-LVM others. Expert... -
8
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
-
9
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... -
Cut Data Warehouse Costs by 54%BigQuery delivers 54% lower TCO with exabyte scale and flexible pricing. Free migration tools handle the SQL translation automatically.
-
10
In-Close
In-Close is a fast Formal Concept miner.
In-Close is a fast Formal Concept Miner and Tree Builder for FCA files in the cxt format and FIMI .dat files. Features include: minimum support for intent and extent, output of analysis data, output of concepts, output of reduced context using minimum support values and output of sorted cxt file (thus can convert dat to cxt format). -
11
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. ... -
12
Satsuma .NET Graph Library
a delicious .NET graph library
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... -
13
The program `Stock Management' presents a system for a franchise with three stores and replenishes the stock for ten items at the end of the week. ‘Stock Management’ uses the principle of Minimum Heap, which is an efficient data structure based on a binary tree, to help find the store replenish its stock by using the minimum price product and see whether it’s able to restock its store completely to the initial stock level. An initial budget is given to each of the stores and the sales of the week of each of ten items are taken with a new item price taken for the ten goods.
-
14
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).
-
15
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. -
16
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. -
17
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.
-
18
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.
-
19
-
20
Multiple Spanning Tree Protocol daemon !! THE PROJECT HAS MOVED: https://github.com/mstpd/mstpd !! !! THIS REPOSITORY HAS HISTORICAL VALUE ONLY !!
-
21
Cost-sensitive Classifiers
Adaboost extensions for cost-sentive classification
Adaboost extensions for cost-sentive classification CSExtension 1 CSExtension 2 CSExtension 3 CSExtension 4 CSExtension 5 AdaCost Boost CostBoost Uboost CostUBoost AdaBoostM1 Implementation of all the listed algorithms of the cluster "cost-sensitive classification". They are the meta algorithms which requires base algorithms e.g. Decision Tree Moreover, Voting criteria is also required e.g. Minimum expected cost criteria Input also requires to load an arff file and a cost matrix (sample arff and cost files are uploaded for users' reference) This extension uses weka for classification and generates the classification model along with confusion matrix. For given dataset and cost matrix -
22
-
23
jsp tree
JSP Tree viewer with minimum Java Scripts
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 -
24
Access Road
Simulator of access controls
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... -
25
CloudPower
A tool for organising, visualising and executing Web resources.
CloudPower is a Java application that offers functionality similar to that found in operating systems, for the World Wide Web. References to Web resources, whether they be static or dynamic can be arranged into sets. These sets can themselves contain other sets, allowing for resources to be arranged like files on an operating system. These sets can be saved and retrieved, allowing users to organise their cloud resources. Two graph visualisations (hierarchy and energy) let users quickly...
