https://github.com/dal3x/advanced-data-structures
Implementation of a predecessor and range minimum query data structure with a user interface. Supports time and memory measurements.
https://github.com/dal3x/advanced-data-structures
data-structures-and-algorithms educational-project predecessor rmq
Last synced: 4 months ago
JSON representation
Implementation of a predecessor and range minimum query data structure with a user interface. Supports time and memory measurements.
- Host: GitHub
- URL: https://github.com/dal3x/advanced-data-structures
- Owner: DAL3X
- License: gpl-3.0
- Created: 2023-05-29T10:42:44.000Z (about 2 years ago)
- Default Branch: master
- Last Pushed: 2025-02-10T20:59:50.000Z (4 months ago)
- Last Synced: 2025-02-10T21:35:25.073Z (4 months ago)
- Topics: data-structures-and-algorithms, educational-project, predecessor, rmq
- Language: C++
- Homepage:
- Size: 2.49 MB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
This repository implements two types of datastructures for the advanced datastructures course at KIT.
One is a y-fast-trie for predecessor queries, the other one a range minimum query datastructure utilising cartesian trees.
To compile simply run the build.sh script (or just the one line contained in it) and an application called "ads_programm" should be created. (But it will throw a warning!)
This application can then be used with "ads_programm [pd|rmq] input_file output_file".
The data format is decribed [here](https://algo2.iti.kit.edu/download/kurpicz/2023_advanced_data_structures/project.pdf).
For memory measurements [malloc_count](https://github.com/bingmann/malloc_count) is used. The rights lay by the original author.
Requires GCC with C++ 11 or newer!
Tested with Ubuntu 22.04.2 LTS.