Showing 3 open source projects for "binary tree"

View related business solutions
  • MongoDB Atlas runs apps anywhere Icon
    MongoDB Atlas runs apps anywhere

    Deploy in 115+ regions with the modern database for every enterprise.

    MongoDB 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.
    Start Free
  • Build Securely on AWS with Proven Frameworks Icon
    Build Securely on AWS with Proven Frameworks

    Lay a foundation for success with Tested Reference Architectures developed by Fortinet’s experts. Learn more in this white paper.

    Moving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
    Download Now
  • 1

    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. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    An interactive binary search tree. The user may interact with the tree by performing rotations, balancing, insertions, and deletions. For educational purposes
    Downloads: 2 This Week
    Last Update:
    See Project
  • 3
    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next