Sparse version of nn.dense.dense_mincut_pool

[xiaohan2012]

🚀 The feature, motivation and pitch

The nn.dense.dense_mincut_pool operator requires the input adjacency matrix to be dense. This requirement does not scale well as the matrix size grows. We may use operations on sparse matrix to address this issue.

Alternatives

Additional context

No response

[xiaohan2012]

If you see any major flaw in this idea, please let me know. I'd be glad to contribute to this idea.

[xiaohan2012]

Similar issue: #7364

[rusty1s]

We initially designed it this way because mincut_pool needs to operate on dense adjacency matrices anyway in consecutive applications. I am definitely open though to support it for both sparse and dense adjacency matrices.

[xiaohan2012]

Hi, I'm interested in making a pull request. Meanwhile I cannot push my branch to this project. Maybe I need to be added to this project first?

[rusty1s]

If you want to contribute to PyG, you need to fork this repo, push the changes to your local fork, and then submit a PR to PyG.

[xiaohan2012]

Thanks for the tips. I made a draft PR #9243 but have some questions. It would be great if someone could take a look at it.