Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Implement faster data structures #11

Open
netotz opened this issue Mar 26, 2022 · 0 comments
Open

Implement faster data structures #11

netotz opened this issue Mar 26, 2022 · 0 comments
Assignees
@netotz
Labels
enhancement New feature or request

Comments

@netotz
Copy link
Owner

netotz commented Mar 26, 2022 •
edited
Loading

Some operations could be done in less time by changing some of the data structures.

For example, instead of using an allocation matrix with users rows and facilities columns (in which each cell is the kth level of closeness), one of users rows and closeness columns (each cell being a facility) would allow to get the alpha-neighbors in O(1).
@netotz netotz self-assigned this Mar 26, 2022
@netotz netotz added the enhancement New feature or request label May 25, 2022
@netotz netotz changed the title Implement better data structures Implement faster data structures Jun 13, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@netotz netotz

Labels
enhancement New feature or request
Projects
ANPCP code migration to C#
Status: Ready
Milestone
No milestone
Development

No branches or pull requests
1 participant
@netotz