Return a set of RPST Nodes with the largest number of arcs below a given
threshold, such that the set represents a partition over the edges of the
original Petri net (if the RPST has not been modified), i.e., all edges of
the petri net belong to one node, and only one.