For a node
of minimum degree set
,
,
, and
.
(2) While
(3)
Choose
(4)
The number of shortest augmenting paths from
to
(5)
If
then
(6)
Set
,
, followed by
Algorithm 2:
Matula-Min-Cut
.