-
Couldn't load subscription status.
- Fork 56
Closed
Labels
Description
Similar to the corresponding method in PyG, coalesce(g) should correspond to removing duplicate edges and accumulating the corresponding values, followed by edge sorting.
Can be possibly implemented using the functions remove_multi_edges and sort_edge_index we already have.
This function makes sense only when the underlying graph type is COO
dferre97