Hi everyone, I have two questions about methods available in the igraph python package.
Is there a method that would return all the unconnected pairs of nodes in an undirected graph? Ideally, there is no duplicate as (1, 2) and (2, 1) are the same in this context. In addition, given two nodes in an undirected graph, is there a method that returns their common neighbors? Many thanks for your help! Best regards, Merton
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
