cut_sets

cut_sets(k: PlanarDiagram, order: int, max_cut_sets=None) → list

Finds all k-cut of a graph. A k-cut-set of a graph is a set of k edges that when removed disconnects the graph into two or more components. In our case, we assume the components have more than one node. This may cause potential problems, for example, if the cut-set disconnects the graph into three components, and only one component has one node, the algorithm does not find this cut-set. If needed, the algorithm can be easily adopted for this situation. :param k: knot/graph :param order: number of arcs in the cut-set (k) :param max_cut_sets: if not None, finds up to max_cut k-cut-sets :return: a list of cut-sets consisting of tuples of arcs