<s>
A	O
kinetic	B-Data_Structure
minimum	I-Data_Structure
spanning	I-Data_Structure
tree	I-Data_Structure
is	O
a	O
kinetic	B-Data_Structure
data	I-Data_Structure
structure	I-Data_Structure
that	O
maintains	O
the	O
minimum	O
spanning	O
tree	O
(	O
MST	O
)	O
of	O
a	O
graph	O
whose	O
edge	O
weights	O
are	O
changing	O
as	O
a	O
continuous	O
function	O
of	O
time	O
.	O
</s>
<s>
The	O
most	O
efficient	O
known	O
data	O
structure	O
for	O
the	O
general	O
case	O
uses	O
a	O
kinetic	B-Data_Structure
sorted	I-Data_Structure
list	I-Data_Structure
to	O
store	O
the	O
edge	O
weights	O
,	O
and	O
a	O
standard	O
MST	O
algorithm	O
to	O
compute	O
the	O
MST	O
given	O
the	O
sorted	O
edge	O
weights	O
.	O
</s>
<s>
This	O
data	O
structure	O
considers	O
the	O
dual	O
view	O
of	O
the	O
graph	O
,	O
and	O
then	O
divides	B-Algorithm
based	O
on	O
Frederickson	O
's	O
restricted	O
partitions	O
to	O
make	O
this	O
efficient	O
.	O
</s>
