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 cugraph k_truss algo is not supported for input graphs with >1 connected component (separate issue needed).
In order to prevent nx-cugraph users from receiving bad results/crashes, nx_cugraph.k_truss() should raise an informative exception if the input graph has >1 connected component.
One proposal is to simply call the PLC WCC algo and check the number of components, then raise NotImplementedError if >1. This check and exception can be removed when a future version of PLC k_truss that supports >1 connected component is available (24.02 at the earliest?).
Fixes#3963 and add `connected_components`, `is_connected`, `node_connected_component`, and `number_connected_components`.
Also updated `_groupby` to handle groups that are not consecutive integers starting with 0.
Also, `plc.weakly_connected_components` does not handle isolated nodes well, and I needed to handle this at the Python layer as was done in #3897
Authors:
- Erik Welch (https://github.com/eriknw)
Approvers:
- Rick Ratzel (https://github.com/rlratzel)
URL: #3965
The current cugraph k_truss algo is not supported for input graphs with >1 connected component (separate issue needed).
In order to prevent nx-cugraph users from receiving bad results/crashes,
nx_cugraph.k_truss()
should raise an informative exception if the input graph has >1 connected component.One proposal is to simply call the PLC WCC algo and check the number of components, then raise
NotImplementedError
if >1. This check and exception can be removed when a future version of PLC k_truss that supports >1 connected component is available (24.02 at the earliest?).cc @ChuckHastings
The text was updated successfully, but these errors were encountered: