[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## Re: [igraph] Weighted Neighborhood?

**From**: |
Gábor Csárdi |

**Subject**: |
Re: [igraph] Weighted Neighborhood? |

**Date**: |
Mon, 5 Jul 2010 13:41:42 +0200 |

Lorenzo,
there is no "weighted neighborhood" function.
As a workaround you can calculate the weighted shortest paths from the
given node to/from all others, and then see how many of the path
lengths are below your limit.
Best,
Gabor
On Mon, Jul 5, 2010 at 1:10 PM, Lorenzo Isella <address@hidden> wrote:
>* Dear All,*
>* I wonder if, for a weighted graph, there is any implementation in igraph*
>* of a weighted neighborhood.*
>* I.e. I ask myself how many nodes I can visit from node i along a path*
>* starting from that node and whose weight is at most w, where the path*
>* weight is defined as the sum of the weights of all the edges the path*
>* consists of.*
>* Many thanks*
>
>* Lorenzo*
>
>
>* _______________________________________________*
>* igraph-help mailing list*
>* address@hidden*
>* http://lists.nongnu.org/mailman/listinfo/igraph-help*
>
--
Gabor Csardi <address@hidden> UNIL DGM