search for: graphss

I would like to apply network measures (such as betweenness centrality, upper boundedness, etc.) to a weighted graph with non-integer weights, defined by a euclidean distance matrix. The package sna provides the measures that I want to use, but seems only to operate on binary graphs. I have read work by Mark Newman (http://aps.arxiv.org/abs/cond-mat/0407503/), who suggests that a weighted graph