Circuit iterative partitioning algorithm

lh- · Apr 7, 2018

i have an example of iterative partitioning of the circuit.

this is the formula for calculating values for iterative partitioning:

Code:

Dij = Di + Dj - 2rij -> max; Dij > 0

Di(j) = Di(j)[external] - Di(j)[internal]

then given this graph:

these two calculations are done:

Code:

D12 = (2 - 1) + (3 - 1) - 2 * 2 = -1
D14 = (2 - 1) + (1 - 1) - 2 * 0 = 1
Dijmax = D14 = 1 >  0

i don't understand a thing since no explanation is given. can someone please explain?

thanks in advance.

D.A.(Tony)Stewart · Apr 8, 2018

Are you learning cut-set theory with K-L , F-M, and G-B methods. Keep studying
until you understand something.

lh- · Apr 8, 2018

okay, i got how this is done.

but what are the k-l, f-m and g-b methods?

Privacy & Transparency