[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Locating triangles in (directed) (massive) graphs
|
From: |
Tamás Nepusz |
|
Subject: |
Re: [igraph] Locating triangles in (directed) (massive) graphs |
|
Date: |
Tue, 11 Feb 2014 12:18:24 +0100 |
> Also I was looking at triad.census() and looking at its manual couldn't
> figure out how to interpret the output. Can you please help with that?
triad.census() gives you a vector of length 16. Each entry of the vector
contains the number of occurrences for a triad of a given type. There are 16
directed triads; the manual for the triad.census() function contains the
description of each of them. For instance, the first entry in your case was
113, which means that there are 113 occurrences of the empty triad in your
graph (i.e. groups of three vertices A, B and C such that there are no edges
between them).
T.