I need to use a compact data structure for permutations [1,2] in Java. I know several libraries for C++ that contain them, but none for Java. Does anyone know about such library?
[1] Munro, J. Ian, Rajeev Raman, Venkatesh Raman, and S. Srinivasa Rao. “Succinct Representations of Permutations and Functions.” Theor. Comput. Sci. 438 (2012): 74–88. https://doi.org/10.1016/j.tcs.2012.03.005.
[2] Barbay, Jérémy, and Gonzalo Navarro. “On Compressing Permutations and Adaptive Sorting.” Theor. Comput. Sci. 513 (2013): 109–23. https://doi.org/10.1016/j.tcs.2013.10.019.
look at this link:
https://github.com/phishman3579/java-algorithms-implementation
Thank you, but that is not what I am looking for. I am searching for compact data structures to store a permutation of numbers, such as those explained in the following papers:
[1] Munro, J. Ian, Rajeev Raman, Venkatesh Raman, and S. Srinivasa Rao. “Succinct Representations of Permutations and Functions.” Theor. Comput. Sci. 438 (2012): 74–88. https://doi.org/10.1016/j.tcs.2012.03.005.
[2] Barbay, Jérémy, and Gonzalo Navarro. “On Compressing Permutations and Adaptive Sorting.” Theor. Comput. Sci. 513 (2013): 109–23. https://doi.org/10.1016/j.tcs.2013.10.019.
Take a look at:
https://github.com/yshahun/succinct-util
I hope that is what you are looking for.
Mmmm, no. They have implementations for some compact data structures, but not for permutations.
Thank you anyway, I didn't know that library and it could be useful in the future.
- Badges
- Science topic
- Similar topics
- Computer Science and Engineering
- Artificial Intelligence