<s>
The	O
reverse-delete	B-Algorithm
algorithm	I-Algorithm
is	O
an	O
algorithm	O
in	O
graph	O
theory	O
used	O
to	O
obtain	O
a	O
minimum	O
spanning	O
tree	O
from	O
a	O
given	O
connected	O
,	O
edge-weighted	O
graph	O
.	O
</s>
<s>
It	O
first	O
appeared	O
in	O
,	O
but	O
it	O
should	O
not	O
be	O
confused	O
with	O
Kruskal	B-Algorithm
's	I-Algorithm
algorithm	I-Algorithm
which	O
appears	O
in	O
the	O
same	O
paper	O
.	O
</s>
<s>
This	O
algorithm	O
is	O
a	O
greedy	B-Algorithm
algorithm	I-Algorithm
,	O
choosing	O
the	O
best	O
choice	O
given	O
any	O
situation	O
.	O
</s>
<s>
It	O
is	O
the	O
reverse	O
of	O
Kruskal	B-Algorithm
's	I-Algorithm
algorithm	I-Algorithm
,	O
which	O
is	O
another	O
greedy	B-Algorithm
algorithm	I-Algorithm
to	O
find	O
a	O
minimum	O
spanning	O
tree	O
.	O
</s>
<s>
Kruskal	B-Algorithm
’s	I-Algorithm
algorithm	I-Algorithm
starts	O
with	O
an	O
empty	O
graph	O
and	O
adds	O
edges	O
while	O
the	O
Reverse-Delete	B-Algorithm
algorithm	I-Algorithm
starts	O
with	O
the	O
original	O
graph	O
and	O
deletes	O
edges	O
from	O
it	O
.	O
</s>
<s>
It	O
is	O
recommended	O
to	O
read	O
the	O
proof	O
of	O
the	O
Kruskal	B-Algorithm
's	I-Algorithm
algorithm	I-Algorithm
first	O
.	O
</s>
