-
Notifications
You must be signed in to change notification settings - Fork 3k
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
[Feature] FindEdge/FindEdges for Immutable Graph #404
Conversation
Works fine with Transformer. |
@zheng-da EdgeSubgraph finished. |
std::vector<int64_t> *indptr, | ||
std::vector<dgl_id_t> *indices, | ||
std::vector<dgl_id_t> *edge_ids, | ||
bool in_csr); |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
can you make the input arguments const reference? input pointers usually mean the vectors will be modified by the method.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
updated
everything else looks good. |
Description
FindEdge(s) and EdgeSubgraph have not been implemented in Immutable Graph. #369
Checklist
Please feel free to remove inapplicable items for your PR.
or have been fixed to be compatible with this change
Changes
EdgeList
structure inImmutableGraph
, and a shared pointer attributeedge_list_
; to avoid unnecessary memory cost,edge_list_
is created when it's required.EdgeSubgraph
EdgeSubgraph
, but I was too lazy and I would finish it soon.