如何从节点列表中获取相应的边

Question

I have a list of nodes in a form similar to this: Nodelist=[[1,2,3],[4,7,6],[7,2,9]] Such that there is an edge that connects them, for example 1 is connected to 2 and 2 to 3. These are not the complete set of nodes in my graph.

What I want to do is return a list of edges if there is a connection between the two nodes in Nodelist. ie output=[(1,2),(2,3),(3,1),...]

What I know already, every node in a sublist of Nodelist is connected, ie there is an edge between (1,2),(2,3),(3,1).

I hope what i'm asking makes sense, any help would be appreciated. Please let me know if I need to clarify on anything.

Answer 1

Try this:

from itertools import combinations

[list(combinations(x, 2)) for x in node_list] 

combinations gives all combinations of a list of the given size. So combinations([1,2,3], 2) would give you [(1,2), (2,3), (3,1)] Just do that for each of the node_lists.