I think you are right.
Indeed thanks to the 'quick and dirty' loop suggested by Frederik I
found there's a bunch of nodes of the same type which are linked... even
though the
is.bipartite(graph)
[1] TRUE
Il 14.11.2013 22:57 Tamás Nepusz ha scritto:
Hi,
I gave it a try. But apparently my graph is bipartite:
is.bipartite(graph)
[1] TRUE
is.bipartite() checks whether your graph is bipartite with *some*
mapping of vertices into two groups, but it idoes not check whether
the “type” attribute actually reflects the truth or not. So, it
can happen that you still have an edge that goes between vertices of
the same type.
—
T.
_______________________________________________
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
