iqm.benchmarks.entanglement.graph_states.find_edges_with_disjoint_neighbors

iqm.benchmarks.entanglement.graph_states.find_edges_with_disjoint_neighbors(graph: Sequence[Sequence[int]]) → list[list[Sequence[int]]]

Finds sets of edges with non-overlapping neighboring nodes.

Parameters:

graph (Sequence[Sequence[int]]) – The input graph specified as a sequence of edges (Sequence[int]).

Returns:

A list of lists of edges (Tuple[int]) from the original graph with non-overlapping neighboring nodes.

Return type:

list[list[Sequence[int]]]