Search Results for "tree" - Page 2
Sort By:
Showing 50 open source projects for "tree"
View related business solutions-
The top-rated AI recruiting platform for faster, smarter hiring.Humanly is an AI-first recruiting platform that helps talent teams hire in days, not months—without adding headcount. Our intuitive CRM pairs with powerful agentic AI to engage and screen every candidate instantly, surfacing top talent fast. Built on insights from over 4 million candidate interactions, Humanly delivers speed, structure, and consistency at scale—engaging 100% of interested candidates and driving pipeline growth through targeted outreach and smart re-engagement. We integrate seamlessly with all major ATSs to reduce manual work, improve data flow, and enhance recruiter efficiency and candidate experience. Independent audits ensure our AI remains fair and bias-free, so you can hire confidently.
-
Toast POS for RestaurantsRestaurant success isn’t built on one thing — it’s about a thousand little things coming together, every shift, every service. From FOH to BOH and every moment in between, manage it all with the POS that knows restaurants.
-
1
the c prototyping tools library provides thread-safe linked list, priority queue, hash table, hash list, AVL tree and trie implementations, as well as a thread pool and thread management framework, a tcp and http socket api, and a dbms abstraction layer.
-
2
-
3
A fully functional red-black tree implemented in C++/CLI with an OO approach of naming and structuring which makes the code highly readable as well as easily portable to C# or Java. The package also includes a binary search tree and two traversal algorithms.
-
4
An interactive binary search tree. The user may interact with the tree by performing rotations, balancing, insertions, and deletions. For educational purposes
-
EAM Maintenance Management SoftwareThe Asset Guardian (TAG) is an intuitive and highly scalable asset maintenance system that helps organizations streamline maintenance processes, improve asset performances, reduce operational costs, and boost productivity.
-
5
A simple Ternary Search tree implementation, which also includes delete and getting common prefixes operation. I've tested it on Linux WindRiver 1.4 box with g++. Please report bugs at kunalekawde2002@yahoo.com
-
6
ADTL is an Advanced Data structures Template Library written in C++. it includs sixteen kinds of stl-like contains, such as fibonacci heap,pariring heap,skew heap,avl tree,red-black tree,splay tree,skip list, unrolled linked list and so on.
-
7
Fast cython implementation of trie data structure for Python. Development is inactive, but moved to: http://github.com/martinkozak/cytrie.
-
8
The gsuffix library implements serveral algorithms used for enumerative string searches. It incorporates the suffix tree and suffix array data structures as well as some other methods.
-
9
This small C package is made of an independent AVL tree library, and of an extension module for Python that builds upon it to provide objects of type 'avl_tree' in Python, which can behave as sorted containers or sequential lists.
-
All-in-one solution to control corporate spendingWallester Business is a leading world-class solution to optimize your company’s financial processes! Issuing virtual and physical corporate expense cards with an IBAN account, expense monitoring, limit regulation, convenient accounting, subscription control — manage your finance on all-in-one platform in real time! Wallester Business benefits your business growth!
-
10
Alternative approach to minimum redundancy coding (fixed-length) without using tree data structures. The main advantages are simplicity and flexibility.
-
11
This is a fully STL-compliant C++ map/set/multimap/multiset implementation for g++ using an AVL tree instead of a Red-Black tree (that is present in current libstdc++).
-
12
Genetic Programming (tree structure) predictor within Weka data mining software for both continuous and classification problems.
-
13
It is the source code for a tree mining algorithm called TRIPS. It can mine frequent subtrees from a forest of tree structures.
-
14
This is an avl tree implementation. It is implemented in very optimized way and easy to use. It does not force you to use any specific way of memory allocation. It does not use recursive call. It is implemented with emphasis on speed and simplicity.
-
15
Classic game solved with MinMax algorithm (full solution tree) and simple Heuristics. Specially for learning and teaching computer AI
-
16
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.
-
17
JSONER is a JavaScript library intented to simplify most used operations with JSON based on event API on JSON tree. It includes: data lookup and binding solution, HTML form by JSON dynamically creation and population, transformation and comparison JSONs.
-
18
A Java API for using suffix trees with natural language and an Eclipse/SWT-based GUI for suffix tree visualization using Graphviz.
-
19
A library of data structures with a unified API, written in portable C. Lists (uni- and bidirectional), a vector, a hash, a balanced tree (RB or AVL), a heap and tuples. Memory management, clone support, error handling.
-
20
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.
-
21
The tree control library is a C++ container library which stores generic types in tree structures. Three containers are available in the library: tree, multitree, and unique_tree. The library usage and syntax is much like that of the STL.
-
22
The treexpr library is a Free Software library that applies regular expression concepts to tree structures. It it written in C and has a JNI binding to Java.
-
23
Find case inconsistencies in the source tree. May be useful for porting applications in any programming language from case-insensitive (like Windows) to case-sensitive (like Linux) runtime environment.
-
24
Provisio.Collections brings STL like iterator-based containers to the .Net world (especially C#). It offers fundamental sequential (vector/list/deque) and associative (tree/skiplist) containers that can be filled, traversed and modified using iterators.
-
25
Provides fast lookup for a Subject Based messaging product using a trie. It allows for configurable wildcard characters to replace a single or multiple subject field(s) (A.B.*.D.>). Insertion in to the tree returns a unique handle for subsequent deletion
