Still curious about the code of building symmetric adjacency matrix

[BilyZ98]

` adj = sp.coo_matrix((np.ones(edges.shape[0]), (edges[:, 0], edges[:, 1])),
shape=(labels.shape[0], labels.shape[0]),
dtype=np.float32)

# build symmetric adjacency matrix
adj = adj + adj.T.multiply(adj.T > adj) - adj.multiply(adj.T > adj)`

I don't understand how the last line code produces the symmetric matrix.
And I think it is intuitive to build the symmetric like this
adj = adj + adj.T

Can anyone help to answer my questions? thanks a lot

[BilyZ98]

ok now I understand. the multiply is a point-wise multiplication, not a matrix product.

[Spico197]

ok now I understand. the multiply is a point-wise multiplication, not a matrix product.

Hi, mate. I have the same problem here. I'm curious why we have to subtract adj.multiply(adj.T > adj)? Entries in adj.multiply(adj.T > adj) should be all zeros.

[Pager07]

ok now I understand. the multiply is a point-wise multiplication, not a matrix product.

Hi, mate. I have the same problem here. I'm curious why we have to subtract adj.multiply(adj.T > adj)? Entries in adj.multiply(adj.T > adj) should be all zeros.

#3