[R] 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



-- 
Dinesh Kumar Barupal
Junior Specialist
Metabolomics Fiehn Lab
UCD Genome Center
451 East Health Science Drive
GBSF Builidng
University of California
DAVIS
95616
http://fiehnlab.ucdavis.edu/staff/kumar
-------------- next part --------------
An embedded and charset-unspecified text was scrubbed...
Name: pubchem-sim.txt
URL: <https://stat.ethz.ch/pipermail/r-help/attachments/20081211/7151a6e6/attachment.txt>