Re: [igraph] betweenes and closeness considering time sequences of arcs

[Gabor Csardi]

Fabrizio, no, this is not implemented in igraph currently,
you'll have to implement it for yourself. It is not very hard 
if you know C. Just look for the closeness/betweenness function is the 
structural_properties.c file, copy it under a new name and 
modify it to check that the edge leading to a new vertex on 
the search path is newer than the previous one.
I'm not saying it is trivial, though, there can be some unexpected 
complications.

Gabor

Ps. please consider joining the list, otherwise your mails 
will be delayed, maybe even for days if I'm offline. Thanks.

On Fri, Jul 04, 2008 at 06:01:30PM +0200, Fabrizio Natale wrote:
> Dear all,
> 
> I am working with a network representing movements of animals (arcs) between
> farms (nodes) at given dates.
> 
>  
> 
> I need to get betweenness and closeness measures of nodes considering only
> valid paths based on the correct time sequence of the connecting arcs:
> 
> a path between A and C passing trough B is valid only if the arc between A and
> B has a date antecedent to the date of the arc between B and C.
> 
>  
> 
> Is there already a way of implementing this using igraph?
> 
> I would be very thankful if you could help me.
> 
>  
> 
>  
> 
> Fabrizio
> 
>  
> 

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


-- 
Csardi Gabor <address@hidden>    UNIL DGM