feat: introduce graph InEdges & OutEdges methods #183
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Up to now, if one was interested in getting all edges of a source or target, there used to be two options:
Edges
method and filter the result based on source/target.AdjacencyMap
/PredecessorMap
method, select the appropriate key and transform the map into a sliceBoth of these options have proved to be quite inefficient for very big graphs, e.g. with millions of edges.
Therefore we are introducing two new methods which take advantage of the store's internal structures:
InEdges
: returns a slice of all edges in the graph with a specific target vertexOutEdges
: returns a slice of all edges in the graph with a specific source vertex.