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

More efficient Neighbors encoding #88

Open
DanySK opened this issue Mar 8, 2019 · 0 comments
Open

More efficient Neighbors encoding #88

DanySK opened this issue Mar 8, 2019 · 0 comments
Assignees
@DanySK
Labels
question

Comments

@DanySK
Copy link
Member

DanySK commented Mar 8, 2019

Currently neighborhoods are directly computed by LinkingRules, which also builds them. They could be instead be stored internally as a bitset of size nodes², and produced on the fly when required.
The current computeNeighborhood(Node<T> center, Environment<T, P> env) method could be replaced by areNeighbors(Node<T>, Node<T>): boolean.
@DanySK DanySK self-assigned this Mar 8, 2019
@DanySK DanySK added the question label Mar 8, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@DanySK DanySK

Labels
question
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@DanySK