Hi, I don't think we have anything for this. You can submit a feature request for it here: https://github.com/igraph/igraph/issues?state=open
Maybe you can use subgraph isomorphisms with colored edges as a workaround. It might be tricky, because you have to consider automorphisms of the signed triangle as well. Gabor On Mon, Apr 21, 2014 at 2:45 AM, Tina Wey <[email protected]> wrote: > Hello, > > Is there anything like triad.census() for signed networks? For example, I > would like to count the number of triads with different +/- combinations in > multiple networks. > > Thank you in advance for help and advice, > Tina > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help > >
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
