|Subject:||Re: [igraph] shortest path between all nodes on a weighted network|
|Date:||Wed, 11 Apr 2007 16:25:44 -0400|
the short answer is no, this is not possible.
Some igraph functions can handle weighted edges,
but the shortest path and the transitivity functions can't. (Btw. how
to define the weighted transitivity of a network?)
Check the sna and the RBGL packages, these might help. Unfortunately
igraph is quite bad on weighted networks.
On Wed, Apr 11, 2007 at 03:55:20PM -0400, Colin Garroway wrote:
> Hello All,
> I have a small undirected weighted network. 34 nodes and 93 edges. Edges
> are weighted as the dissimilarity between between nodes. I want to
> determine the shortest path length between all nodes. Is this possible in
> igraph or an existing R package? Also does transitivity calculation
> incorporate edge weight some how?
> I am new to igraph and relatively new to R and am quite stuck on the
> shortest path question. Any suggestions would be greatly appreciated.
> Thank you
> igraph-help mailing list
Csardi Gabor <address@hidden> MTA RMKI, ELTE TTK
igraph-help mailing list
|[Prev in Thread]||Current Thread||[Next in Thread]|