Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: sparse_permutation
Note: This documentation is automatically generated.
A compact representation for permutations of {0..N-1} that displaces few elements: it needs only O(K) memory for a permutation that displaces K elements.
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2024-08-06 UTC.
[null,null,["Last updated 2024-08-06 UTC."],[],["The content describes a `SparsePermutation` class in C++ designed for representing permutations of elements {0..N-1}. It offers a memory-efficient approach, requiring only O(K) memory for permutations that displace K elements. The documentation highlights that this is a compact representation suitable when dealing with permutations that move a relatively small subset of the total elements. The `SparsePermutation` class is the key component discussed.\n"],null,[]]
