[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] What exactly does igraph_transitivity_undirected() compute
From: |
Gábor Csárdi |
Subject: |
Re: [igraph] What exactly does igraph_transitivity_undirected() compute for directed graphs? |
Date: |
Mon, 7 Dec 2015 11:56:06 +0000 |
It's because of the multiple edges in the first graph. I.e.:
> transitivity(as.undirected(g, mode = "each"),"local")
[1] 0.3333333 0.3333333 1.0000000
Gabor
On Mon, Dec 7, 2015 at 10:05 AM, Szabolcs Horvát <address@hidden> wrote:
> Hello,
>
> What precisely does igraph_transitivity_undirected() compute for
> directed graphs?
>
> The C documentation states that
>
> "Directed graphs are considered as undirected ones."
>
> but this is not exactly the case.
>
> With an example using the R interface (for simplicity),
>
>> g<-make_graph(c(1,2, 2,1, 2,3, 3,1))
>> transitivity(g,"local")
> [1] 0.3333333 0.3333333 1.0000000
>
>> transitivity(as.undirected(g),"local")
> [1] 1 1 1
>
> Can someone clarify what precisely is computed in the directed case?
>
> Szabolcs
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help