s t cut can be a utilized to identify two components of graph partitioning as used herein an s t cut is defined with respect to two nodes s and t of a weighted directed graph g v e thereby a partition of the vertices of a graph that defines the partition obtained by the minimum s t cut may be represented by the s t cut may be defined as a set of edges c e as wherein c v is a partition of the vertices of a graph that defines the partition obtained by the minimum s t cut s and t are sets of vertices from the graph g that respectively have members s and t c e is a subset of the edges in the graph g the defines the partition obtained by the minimum s t cut and i and j are vertices in the graph or nodes in the corresponding simulated electrical network as described herein below given that each edge of the graph has an associated non negative weight w the weight the s t cut is the sum of the weights w of the set of edges of the cut the sum w may be determined by as one skilled in the art will readily recognize preferential partitioning.