Re: [igraph] shortest path between all nodes on a weighted network

[Colin Garroway]

Gabor,

Thanks for the quick response.  I'll keep working at it.  

Again I'm new to networks but Holme et al. 2007 Physica A 373 (2007), 821-830 (http://arxiv.org/abs/cond-mat/0411634
) seem to have come up with a clustering coefficient for weighted networks that has all the typical desired porperties.

Colin

On 11/04/07, Gabor Csardi <address@hidden> wrote:

Colin,

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.

Best,
Gabor

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
>    Colin

> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help


--
Csardi Gabor <address@hidden>    MTA RMKI, ELTE TTK


_______________________________________________
igraph-help mailing list
address@hidden
http://lists.nongnu.org/mailman/listinfo/igraph-help

-- 
Colin Garroway (PhD candidate)
Wildlife Research and Development Section
Ontario Ministry of Natural Resources
c/o Trent University
DNA Building
2140 East Bank Drive
Peterborough, ON, K9J 7B9
Canada
Phone: 705-755-1535