You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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.
The text was updated successfully, but these errors were encountered:
🚀 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, thenx
should no longer be visited by the DFS.The text was updated successfully, but these errors were encountered: