Search Results for "data structures"

KACTL (the KTH Algorithmic Contest Template Library) is an extensively curated and high-performance C++ algorithms library created by the competitive programming team at the Royal Institute of Technology (KTH) to serve as a trusted, battle-tested codebase for algorithmic contests, programming competitions, and general algorithm development. The repository aggregates dozens of concise implementations of essential data structures, numerical methods, graph algorithms, string processing tools, computational geometry routines, and optimization techniques, all designed with speed, correctness, and compactness in mind. Instead of reinventing algorithms on the fly during contests like ACM-ICPC or Codeforces rounds, competitors can import exactly the component they need — whether a segment tree with lazy propagation, a minimum cost flow solver, or a fast Fourier transform — and focus their energy on problem logic and strategy.

CDS (Concurrent Data Structures) is a C++ template library of lock-free and fine-grained lock-based algorithms. It contains a collection of concurrent data structures: queues, stacks, sets, maps, etc, and safe memory reclamation schema for concurrent containers - Hazard Pointer and user-space RCU. See doxygen doc http://libcds.sourceforge.net/doc/cds-api/index.html.

librfc is a C/C++ shared library containing public domain implementations of core RFC data structures and algorithms written in C++11.

The library for utilization of Minimal Quadtree format for storing very large sparse matrices. Please see the paper referenced below for the description of a problem. Corresponding papers: Tree-based Space Efficient Formats for Storing the Structure of Sparse Matrices (I. Šimeček, D. Langr, P. Tvrdík), In Scalable Computing: Practice and Experience, volume 15, 2014. Space Efficient Formats for Structure of Sparse Matrices Based on Tree Structures (I. Šimeček, Daniel Langr, Pavel...

An algorithm is represented by a .h file and placed under include. (one .header file per algorithm.) The demo program for the algorithm demonstration is placed under src. (one demo per algorithm.) After the program passes correctly, please initiate Pull Requests, the code is verified and stored in the library, and the new algorithm implementation is published in the README. TAB = 4 space. set ts=4 in vim. Graph output format is Graphviz Dot format. (the output format of the graph is in dot...

libdry is a C++44 shared library containing public domain implementations of data structures and algorithms.

This will help a new data structure learner to learn data structures quickly.

--> Now available in English! Click "Browse All Files" to get it. <--- AlgDomes is a free, open source, educational application, designed to visually project and explain known algorithms in data structures. Designed & Created by: Konstantinos Kourmousis and Pavlos Paschalidis. ====================================== Η εφαρμογή AlgDomes είναι μια δωρεάν, ανοιχτού κώδικα εκπαιδευτική εφαρμογή οπτικοποίησης και επεξήγησης γνωστών αλγορίθμων σε δομές δεδομένων. Δημιουργήθηκε από τους Κουρμούση Κωνσταντίνο και Πασχαλίδη Παύλο, υπό την εποπτεία του Τομέα Υπολογιστικών Τεχνικών και Συστημάτων του Τμήματος Πληροφορικής του Τ.Ε.Ι. ...

Project provides a set of concurrent building blocks (Java & C/C++) that can be used to develop parallel/multi-threaded applications. Components are grouped into 4 categories: 1.Data Structures 2. Parallel Patterns 3.Parallel functions 4.Atomics and STM

Ertha is an open source GIS whose main focus is to guarantee easy extensibility and straightforward integration of custom modules. It provides basic geographic rendering and topologic analysis and exposes the main data structures loaded from shapefiles.

ARMR provides a foundation for creating an efficient in-memory database. Its unique list processing structures simplify programming logic and allow the developer to rapidly sort, group, and select data. Give your app a hypercard like capability.

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.

The MemSL for C and C++ includes a complete data structures/collection classes library, memory tracing, memory debugging, logging, entry/exit tracing, exception handling, definable memory handlers, built-in threads support and much more.

A library for Lock-Free Data Structures

This library is meant to offer an array of general purpose data structures and algorithms for a multitude of uses. Each structure must be examined for its specific usefulness to be determined. Please see the API documentation for more details.

C++ implementation of the DAWG and trimmed DAWG data structures. Supports basic string searching.

General Toolkit Library is a general purpose toolkit written in C++ designed to make it easier for developers to produce applications. It provides classes and templates that implement several data structures like Arrays, Lists, Heaps, Sets, Files, etc.

Some data structures developed in c++ for the 'Algorithms & Data Structures' exam at the Computer Science Department of the University of Bari by Tafuni Vito & Nicola Perrini.

libBAD is a basic collections of algorithms and data structures.

Cosmos (by OpenGenus Foundation) is your personal offline collection of every algorithm and data structure one will ever encounter and use in a lifetime. This provides solutions in various languages spanning C, C++, Java, JavaScript, Swift, Python, Go and others. This work is maintained by a community of hundreds of people and is a massive collaborative effort to bring the readily available coding knowledge offline.