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.

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

Improve efficiency of sampling strategies #28

Open
GillesVandewiele opened this issue Nov 2, 2020 · 0 comments
Open

Improve efficiency of sampling strategies #28

GillesVandewiele opened this issue Nov 2, 2020 · 0 comments
Labels
enhancement New feature or request

Comments

@GillesVandewiele
Copy link
Collaborator

🚀 Feature

Currently, the sampling techniques are rather slow. The depth-first-search (DFS) algorithm can potentially be improved by making use of smarter data structures and techniques such as caching.

Moreover, a very naive system is currently in place to avoid duplicate walks, but this should be improved as well (a tree should be built of things that are already included in the walk. If all children (neighbors) of a node x are already included in the walks, then x should no longer be visited by the DFS.

@GillesVandewiele GillesVandewiele added the enhancement New feature or request label Nov 2, 2020
@GillesVandewiele GillesVandewiele changed the title Improve sampling strategies Improve efficiency of sampling strategies Nov 2, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

1 participant