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
The current neighborsOf predicate processor introduced in #325, only provides filtering on a per-node basis. When it is required to display neighbors of not just one but several nodes, the complexity of the operation becomes O(n2). This is not particularly useful for very large graphs with many thousands of nodes.
A simple improvement to the neighborsOf predicate processor would be for it to also accept an array of ids.
The text was updated successfully, but these errors were encountered:
This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.
Hello @senakafdo. Sigma v1 has been deprecated and won't be maintained anymore. This said, version 2 is now out, and in v2, since sigma now relies on graphology as its graph representation, the bug you are mentioning is no longer an issue as neighbor handling should very straightforward and efficient now.
The current neighborsOf predicate processor introduced in #325, only provides filtering on a per-node basis. When it is required to display neighbors of not just one but several nodes, the complexity of the operation becomes O(n2). This is not particularly useful for very large graphs with many thousands of nodes.
A simple improvement to the neighborsOf predicate processor would be for it to also accept an array of ids.
The text was updated successfully, but these errors were encountered: