Hi!
In my research I need to compute the minimum spanning trees (MST) from a batch of adjacency matrix of size B x N x N, where the N x N dimension refers to a matrix whose elements are distances, and B is the batch dimenion.  And I want to find a way to output a matrix of size B x N x N, where N x N is the MST computed from the given adjacency matrices.
The problem is to deal with the batch. For non-batched version I plan on calling scipy.sparse.csgraph.minimum_spanning_tree, but it doe not seem to support a batch dimension, and computing the mst sequentially would be too slow.
Thanks!
%% I have the feeling that it would be really nice if torch.sparse could support some sort of MST algorithm for gpu?