Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.
Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Start Free Trial
Stop Cyber Threats with VM-Series Next-Gen Firewall on Azure
Native application identity and user-based security for your Azure cloud
Gain integrated visibility across all traffic in a single pass. Deploy Palo Alto Networks VM-Series to determine application identity and content while automating security policy updates via rich APIs.
spdict is a library of dictionary algorithms written in C++. It has support for sorted array, binary search tree, red-black tree, skip list, and balanced tree algorithms. Also include a cache class.
produce full software package using the binary decision diagram (BDD) representation to manipulate logic maps for design optimization objectives multiplyer{like(A+B)(C)(D)}In C++ Core.C++ GUI.VB6 Verilog Modules Quin McCluskey Multi Functions Operations
BinML is a specification and a Java library. It takes XML specifications of (binary) file formats as input and while parsing a binary file it builds an Abstract File Tree containing all the information in a more processing friendly format.
AI-powered service management for IT and enterprise teams
Enterprise-grade ITSM, for every business
Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
.Net Generic Data Structures
Provides parametric polymorphic data structores (the first is an AVL Binarytree, always balanced), for the .Net framework.
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.
ADLIB - a C library of fundamental algorithms and their data structures. It includes thread safe implementation of circular list, doubly linked list, stack, queue, deque and binary search tree.
Libtc is a collection of useful things. It currently includes a linked list, hash table, binarytree, configuration file parser, some string utilities, plus some functions often missing on some systems.
A Generic Data Structures Library. A collection of data structures you're most likely to need. Written in ANSI C. Interface is basic, but powerful, and intuitive. Has AVL tree, binary heap, queue/linked list, and more. All platforms.
Opsis is a Java applet designed to teach binary search tree algorithms. Opsis is not an animation program; rather, the system
uses visual programming in an abstract way.