Re: [igraph] Edge betweenness for specific origin and destination in Directed graph

[Gábor Csárdi]

On Tue, May 12, 2009 at 7:54 AM, Aisan Kazerani
<address@hidden> wrote:
> Hi Gabor,
>
[...]
> Any way, I have a question about the small code you sent me before: I
> tried to use it for directed graph as well but it didn't work, I think
> that's because igraph is unable to get shortest path for directed graphs.
> Is it correct?

Aisan,

it is not correct, igraph is fine with directed paths. You just need
to supply mode="out" to get.all.shortest.paths().

G.

> Do you have any suggestion?
>
> Thanks in advance.
>
> Cheers,
> Aisan
>
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>



-- 
Gabor Csardi <address@hidden>     UNIL DGM