Skip to content
Prev 164515 / 398503 Next

i graph library: how can generates a fully connected graph from a similarity matrix

dinesh kumar 
Dear R users

I have a similarity matrix 100X100. I used this matrix as adjacency matrix
to generate igraph graph object. Its a fully connected graph. The similarity
score is the weight of the edge. Now I want to remove all possible lowest
scores (edges) but I want to get back a fully connected graph (dont want any
isolated vertex).How can I do it?

Also is there any possibility that I can remove the edges which dont pass a
threshold (below 70% similarity score).

I attached the similarity matrix.

I would appreciate the reply

Thanks in advance

Dinesh

Thread (2 messages)

dinesh kumar i graph library: how can generates a fully connected graph from a similarity matrix Dec 11 Gábor Csárdi i graph library: how can generates a fully connected graph from a similarity matrix Dec 12