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
Create a graph which keeps neighboring nodes sorted by id #110
Comments
What you want is: |
Yes, except also for others like SharedArrayBasedDirectedGraph. cc @plofgren as he was interested in this. |
Is anyone working on this issue? If not, I can start working on it soon. |
I can work on ArrayBasedDirectedGraph |
Allows nodes that store neighbors sorted in ArrayBasedGraph
I'll try to work on SharedArrayBasedDirectedGraph . |
Allows nodes that store neighbors sorted in ArrayBasedGraph
Allows nodes that store neighbors sorted in ArrayBasedGraph
Allows nodes that store neighbors sorted in ArrayBasedGraph
In some applications one needs fast intersections of adjacency lists and fast search of whether a node v is a neighbor of a node u. In such cases, a graph that keeps the adjacency list in sorted order would be great.
This should work for both in and out directions in both ArrayBasedDirectedGraph and SharedArrayBasedDirectedGraph.
The text was updated successfully, but these errors were encountered: