Re: [igraph] Why does get.all.shortest.paths have no weight argument?

[Gábor Csárdi]

Hi,

it is not a question of design, we just haven't implemented it yet.
You can follow this issue here:
https://bugs.launchpad.net/igraph/+bug/525624

Best,
Gabor

On Mon, Feb 22, 2010 at 3:47 AM, Marcel Salathé
<address@hidden> wrote:
> Hi
>
> I hope this is the right place to post this question which is in some sense
> a design question.
>
> I'm curious why get.all.shortest.paths does not have a weight argument, or
> doesn't include weights if there are weights associated with edges? This
> seems unintuitive since get.shortest.paths (which will return just one of
> the shortest paths) does indeed have a weight argument (and even recognizes
> if weights are associated with edges).
>
> Thanks for clarification!
>
> Marcel
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>



-- 
Gabor Csardi <address@hidden>     UNIL DGM