<s>
In	O
graph	O
theory	O
,	O
Edmonds	B-Algorithm
 '	I-Algorithm
algorithm	I-Algorithm
or	O
Chu–Liu/Edmonds	O
 '	O
algorithm	O
is	O
an	O
algorithm	O
for	O
finding	O
a	O
spanning	O
arborescence	O
of	O
minimum	O
weight	O
(	O
sometimes	O
called	O
an	O
optimum	O
branching	O
)	O
.	O
</s>
<s>
This	O
is	O
as	O
fast	O
as	O
Prim	B-Algorithm
's	I-Algorithm
algorithm	I-Algorithm
for	O
an	O
undirected	O
minimum	O
spanning	O
tree	O
.	O
</s>
