Re: [igraph] weights in igraph_get_shortest_paths_dijkstra

[Gábor Csárdi]

On Tue, Feb 24, 2009 at 1:55 AM, Daniel Schreiber <address@hidden> wrote:
> yes - I read the documentation.
> Maybe the question was not expressed clearly:
> How are the weights ordered in this vector? By the edge-id?

Yes, by edge id. And you are right, this might be not obvious from the
documentation.

G.

> Daniel
>
> 2009/2/23 Gábor Csárdi <address@hidden>:
> - Show quoted text -
>> It seems to be in the documentation:
>> http://cneurocvs.rmki.kfki.hu/igraph/doc/html/igraph_get_shortest_paths_dijkstra.html
>> says "const igraph_vector_t *weights,"
>>
>> see more here: 
>> http://cneurocvs.rmki.kfki.hu/igraph/doc/html/igraph-Vectors.html
>>
>> Best,
>> Gabor
>>
>> On Mon, Feb 23, 2009 at 8:29 PM, Daniel Schreiber <address@hidden> wrote:
>>> hi
>>>
>>> I couldn't figure out from the documentation how the 'weights'
>>> parameter for the igraph_get_shortest_paths_dijkstra function is
>>> defined. I'm using the C interface.
>>>
>>> Daniel
>>>
>>>
>>> _______________________________________________
>>> igraph-help mailing list
>>> address@hidden
>>> http://lists.nongnu.org/mailman/listinfo/igraph-help
>>>
>>
>>
>>
>> --
>> Gabor Csardi <address@hidden>     UNIL DGM
>>
>



-- 
Gabor Csardi <address@hidden>     UNIL DGM