[FEA]: Depth First Search Traversal DFS

[karthikkatu]

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

New Feature

How would you describe the priority of this feature request

Critical (currently preventing usage)

Please provide a clear description of problem this feature solves

I can see that cuGraph supports traversal algorithms like Breadth First Search(BFS) and Multi Source Breadth First Search(MSBFS). I want cuGraph to support Depth First Search. Can DFS be supported or provided?

I want the it to return all the DFS paths as the list not in the format of [vertex predecessor]. I want it in the format [v1, v2, v3, v4 .....](dfs path 1)

[v1, v5, v6, v7 .....](dfs path 2)

something like this.

Is it possible to provide DFS traversal? or is there anyway where I can get DFS by using existing features and Im unaware of it?

Please reply if DFS can be supported and provided or if DFS can be done with existing functionality ?

Describe your ideal solution

We could use the BFS (existing) and convert it into DFS in a faster way if parallelised using GPU. Or we can calculate DFS from scratch (just my 2 cents)

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