[FEA]: SCC better implementation

[Ibrahim25-ai]

Is this a new feature, an improvement, or a change to existing functionality?

Improvement

How would you describe the priority of this feature request

High

Please provide a clear description of problem this feature solves

i want cuGraph to optimize the SCC algorithm. because i have a directed graph and i can t find any other algorithm to help me in finding vertices connections.

Describe your ideal solution

the current solution creates a dense representation of the graph (actually 2 copies, A and A transpose) and do matrix multiplications to compute the SCC. This is going to require hundreds of gigabytes of GPU memory for a graph. if there is a method that will take less space it would be great.

Describe any alternatives you have considered

No response

Additional context

No response

Code of Conduct

• [X] I agree to follow cuGraph's Code of Conduct
• [X] I have searched the open feature requests and have found no duplicates for this feature request

[ChuckHastings]

This feature is on our list. We will incorporate your interest and evaluate where to put it onto our road map.