File size: 2,533 Bytes
f5a3e3c ce79f22 f5a3e3c ce79f22 83205bf ce79f22 35cef62 ce79f22 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 |
---
dataset_info:
features:
- name: question
dtype: string
- name: answer
dtype: string
- name: algo_name
dtype: string
- name: length
dtype: int64
splits:
- name: test_1
num_bytes: 183920334
num_examples: 100400
- name: test_2
num_bytes: 185222175
num_examples: 100600
- name: test_3
num_bytes: 184881343
num_examples: 100600
- name: test_4
num_bytes: 186159042
num_examples: 100800
- name: test_5
num_bytes: 183726177
num_examples: 100400
download_size: 219757341
dataset_size: 923909071
configs:
- config_name: default
data_files:
- split: test_1
path: data/test_1-*
- split: test_2
path: data/test_2-*
- split: test_3
path: data/test_3-*
- split: test_4
path: data/test_4-*
- split: test_5
path: data/test_5-*
license: apache-2.0
language:
- en
pretty_name: CLRS Text Testing Datasets
size_categories:
- 100K<n<1M
---
# CLRS Text Testing Datasets
Dataset containing 5 different test splits for the CLRS-30 Algorithms, each split is generated with a different random seed using our [GitHub code](https://github.com/google-deepmind/clrs/tree/master/clrs/_src/clrs_text).
The full list of 30 algorithms and lengths included in each split is available [here](https://github.com/google-deepmind/clrs/blob/master/clrs/_src/clrs_text/generate_clrs_text.py#L88).
The full paper available on [ArXiv](https://arxiv.org/abs/2406.04229)
### Licensing Information
We are releasing this dataset under the terms of [Apache-2.0](https://choosealicense.com/licenses/apache-2.0/).
## Bibtex
If you use our dataset, please cite us:
```bibtex
@article{markeeva2024clrs,
title={The CLRS-Text Algorithmic Reasoning Language Benchmark},
author={Markeeva, Larisa and McLeish, Sean and Ibarz, Borja and Bounsi, Wilfried and Kozlova, Olga and Vitvitskyi, Alex and Blundell, Charles and Goldstein, Tom and Schwarzschild, Avi and Veli{\v{c}}kovi{\'c}, Petar},
journal={arXiv preprint arXiv:2406.04229},
year={2024}
}
```
## Full List of Algorithms
- activity_selector
- articulation_points
- bellman_ford
- bfs
- binary_search
- bridges
- bubble_sort
- dag_shortest_paths
- dfs
- dijkstra
- find_maximum_subarray_kadane
- floyd_warshall
- graham_scan
- heapsort
- insertion_sort
- jarvis_march
- kmp_matcher
- lcs_length
- matrix_chain_order
- minimum
- mst_kruskal
- mst_prim
- naive_string_matcher
- optimal_bst
- quickselect
- quicksort
- segments_intersect
- strongly_connected_components
- task_scheduling
- topological_sort |