Re: [igraph] Implementation of "Finding set of Key players on the network!

[Gábor Csárdi]

Shahab,

no, the full algorithm is not implemented. You can follow this issue here:
https://bugs.launchpad.net/igraph/+bug/597196

Best,
Gabor

On Mon, Jun 21, 2010 at 8:20 PM, shahab mokarizadeh
<address@hidden> wrote:
> Thanks a lot, I solved the errors, of invalid vertex id while
> computing shortest path,  simple by applying your hints.
>
> I find in the archives of the "igraph" forum, some implementation for
> finding key players in a social network (following link)
>
> http://lists.nongnu.org/archive/html/igraph-help/2007-09/msg00014.html
>
>
> I wonder whether the full algorithm is implemented or not?  Honestly I
> didn't understand the optimization algorithm well.
> Is there anyone who has implemented that algorithm?
>
> regards,
> /Shahab
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>



-- 
Gabor Csardi <address@hidden>     UNIL DGM