Re: [igraph] Leading eigenvector for directed graphs

[Tadaishi Yatabe-Rodriguez]

Does the Infomap algorithm impleneted in Igraph work for directed networks or just ignores edge direction? I need to run on a directed weighted network, and I've tried to make it run in C++, but I'm very illiterate in this programming language to make it work.

Thanks,

Tada

On Fri, Aug 29, 2014 at 9:40 AM, Tadaishi Yatabe-Rodriguez <address@hidden> wrote:

Hi,

Has it been implemented yet this algorithm for directed paths?

I have a directed weighted network of 62 nodes and 130 arcs, and can't made up my mind yet of what to use. The leading eigenvector seems nice, but can't find how to actually run it.

I read this article were they implemented it in C++, but I can't find the code and know nothing about C++.

Small- and large-scale network structure of live fish movements

in Scotland

By

Darren Michael Green,Alison Gregory, Lorna Ann Munro

Thanks,

Tada

--

Tadaishi Yatabe

DVM, MPVM, PhD (C)

Center for Animal Disease Modeling and Surveillance (CADMS)

Department of Medicine and Epidemiology

School of Veterinary Medicine

University of California Davis

--

Tadaishi Yatabe

DVM, MPVM, PhD (C)

Center for Animal Disease Modeling and Surveillance (CADMS)

Department of Medicine and Epidemiology

School of Veterinary Medicine

University of California Davis