Search Results for "minimum spanning tree" - Page 2
Sort By:
Showing 35 open source projects for "minimum spanning tree"
View related business solutions-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
1
IEEE 802.1d ethernet bridging (plus Spanning Tree protocol) for the linux kernel. Kernel code is in Linux 2.4 and 2.6 kernels.
-
2
crfparser is a simple open source projective Maximum Spanning Tree dependency parser for practical natural language processing applications.
-
3
A free PHP based server monitoring script. The script is designed focussing on minimum memory usage and an attractive user interface. Server++ uses Google Chart API to provide server information in an easy to understand and an enhanced way.
-
4
Alternative approach to minimum redundancy coding (fixed-length) without using tree data structures. The main advantages are simplicity and flexibility.
-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
5
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.
-
6
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.
-
7
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.
-
8
Numerically estimate an efficiency of code construction algorithms. Randomly generate n binary words of length m with minimum Hamming distance d and create a prefix code (= retrieval tree) from them. Based on PhD work.
-
9
-
Paessler - Monitor Your Whole Network in MinutesWaiting weeks for a monitoring rollout isn't an option when infrastructure doesn't stop running. PRTG's auto-discovery scans your network and suggests from over 200 pre-configured sensor types, so you're watching servers, applications and devices within minutes, not after a multi-week deployment. Enterprise-strength monitoring, without the enterprise complexity. Start your free trial today.
-
10
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.)
