#
o1
Here are 2 public repositories matching this topic...
A library for bijectively mapping all ordered pairs from two finite sets A and B into a single linear index. KombiN orders pairs by ascending weight (sum of indices) using a three-region zig-zag algorithm, enabling O(1) bidirectional lookups.
algorithm mapping lookup pairs bijection index combinatorics combination cross-language descrete-math o1 zig-zag
-
Updated
Aug 1, 2025 - C#
Improve this page
Add a description, image, and links to the o1 topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the o1 topic, visit your repo's landing page and select "manage topics."