Hello,
please post to the list instead of posting me directly.
I am sorry to say, but I don't really know what you want to do. First
you asked about highly connected nodes, and now about clustering.
Perhaps you could give an example with the input and the expected
output.
Btw, if you know how to
Nathan,
if you have a weighted adjacency matrix, then you don't need graph
packages for this, just do
rowSums(data)
or
rowSums(data != 0)
depending you want the sum of the weights of the adjacent edges, or
just the number of adjacent edges. Or optionally colSums instead of
rowSums if your grap
Hello R Help Team,
I have created graph from weighted adjecency matrix .Is there a way I can
find highly connected nodes in Igraph like the Package RBGL does.
nathan
--
View this message in context:
http://www.nabble.com/Highly-Connected-Nodes-in-Igraph-tp22377522p22377522.html
Sent from the
3 matches
Mail list logo