[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:44:31 +0100

I'll happily attempt a recompile to Dijkstra's, as that was exactly the mechanism I was hoping for.



Benjamin Fields
PhD Student
Dept. of Computing
Goldsmiths College, University of London
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 12:42 PM, Tamas Nepusz wrote:

Hi Benjamin,

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?
Dijkstra's shortest path algorithm is already implemented in the development tree, so igraph 0.5.1 will definitely include it. If you are willing to recompile igraph, I can send you a patch that adds this functionality to igraph.


igraph-help mailing list

reply via email to

[Prev in Thread] Current Thread [Next in Thread]