[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Weighted graphs in Python interface
From: |
Benjamin Fields |
Subject: |
Re: [igraph] Weighted graphs in Python interface |
Date: |
Mon, 2 Jun 2008 12:11:12 +0100 |
Hi igraph list -
Sorry Jonathan , I don't have any answers, but I was about to ask a
very similar question. I'm trying to retrieve the shortest path
between pairs of vertices on my weighted directed graph (the weights
are stored as floats in an attribute field, all greater than or equal
to zero). In order to be useful I need to retrieve the actually
path(s) that result in the shortest length. I can't seem to work out
a way to do this with built in functions. Anyone have any idea?
Benjamin Fields
PhD Student
Dept. of Computing
Goldsmiths College, University of London
address@hidden
mobile: +44 (0)796 106 1568
"Which is more musical: a truck passing by a factory or a truck
passing by a music school?" --John Cage
On Jun 2, 2008, at 10:15 AM, Jonathan Donges wrote:
2. I would like to calculate shortest path related measures
including the weights, i.e. the length of a path should be defined
by the sum of the edge weights on the way. Particularly, I am
interested in average path length, vertex betweenness centrality and
vertex closeness centrality using edge weights. The weights are all
positive in my application. Is this implemented yet in iGraph? Maybe
in some developement version? If not, do you have suggestions for
other fast libraries implementing these features?