[FEA] Expose count_multi_edges for cuGraph C++ graph_view_t to python
#2417
Labels
feature request
New feature or request
Comments
rapids-bot bot
pushed a commit
that referenced
this issue
May 17, 2024
…4426) Python property graph class does some expensive dask calls to determine if a graph is a multi-graph. This PR exposes to the C API and the PLC layer the graph_view method that counts the number of multi-edges in the graph. Specifically, the function returns the number of extra edges exist. So if the edge `(u,v)` exists `k` times, that edge contributes `k-1` to the return value. If the return value of this function is greater than 0 then the graph is a multi-graph. If the return value is 0 then while the graph might be labeled a multi-graph, there are no multi-edges so it could be treated as a graph. Closes #2417 Note that the property graph python code would still need to be modified to use this function. Authors: - Chuck Hastings (https://github.com/ChuckHastings) Approvers: - Seunghwa Kang (https://github.com/seunghwak) - Joseph Nke (https://github.com/jnke2016) - Alex Barghi (https://github.com/alexbarghi-nv) URL: #4426
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Describe the solution you'd like and any additional context
We should expose count_multi_edges for cuGraph C++ graph_view_t to python to check if a graph has multi_edges.
It is possible for that it can be used to
has_duplicatesin Property Graphs.Currently we do expensive
has_duplicatescall here and using thatcount_multi_edgesmight be more optimial.For more context see discussion here
The text was updated successfully, but these errors were encountered: