<s>
A	O
flooding	B-Protocol
algorithm	I-Protocol
is	O
an	O
algorithm	O
for	O
distributing	O
material	O
to	O
every	O
part	O
of	O
a	O
graph	O
.	O
</s>
<s>
Flooding	B-Protocol
algorithms	I-Protocol
are	O
used	O
in	O
computer	B-Protocol
networking	I-Protocol
and	O
graphics	B-Protocol
.	O
</s>
<s>
Flooding	B-Protocol
algorithms	I-Protocol
are	O
also	O
useful	O
for	O
solving	O
many	O
mathematical	O
problems	O
,	O
including	O
maze	B-Application
problems	O
and	O
many	O
problems	O
in	O
graph	O
theory	O
.	O
</s>
<s>
Different	O
flooding	B-Protocol
algorithms	I-Protocol
can	O
be	O
applied	O
for	O
different	O
problems	O
,	O
and	O
run	O
with	O
different	O
time	O
complexities	O
.	O
</s>
<s>
For	O
example	O
,	O
the	O
flood	B-Protocol
fill	I-Protocol
algorithm	I-Protocol
is	O
a	O
simple	O
but	O
relatively	O
robust	O
algorithm	O
that	O
works	O
for	O
intricate	O
geometries	O
and	O
can	O
determine	O
which	O
part	O
of	O
the	O
(	O
target	O
)	O
area	O
that	O
is	O
connected	O
to	O
a	O
given	O
(	O
source	O
)	O
node	O
in	O
a	O
multi-dimensional	O
array	B-Data_Structure
,	O
and	O
is	O
trivially	O
generalized	O
to	O
arbitrary	O
graph	O
structures	O
.	O
</s>
<s>
If	O
there	O
instead	O
are	O
several	O
source	O
nodes	O
,	O
there	O
are	O
no	O
obstructions	O
in	O
the	O
geometry	O
represented	O
in	O
the	O
multi-dimensional	O
array	B-Data_Structure
,	O
and	O
one	O
wishes	O
to	O
segment	O
the	O
area	O
based	O
on	O
which	O
of	O
the	O
source	O
nodes	O
the	O
target	O
nodes	O
are	O
closest	O
to	O
,	O
while	O
the	O
flood	B-Protocol
fill	I-Protocol
algorithm	I-Protocol
can	O
still	O
be	O
used	O
,	O
the	O
jump	B-Protocol
flooding	I-Protocol
algorithm	I-Protocol
is	O
potentially	O
much	O
faster	O
as	O
it	O
has	O
a	O
lower	O
time	O
complexity	O
.	O
</s>
<s>
Unlike	O
the	O
flood	B-Protocol
fill	I-Protocol
algorithm	I-Protocol
,	O
however	O
,	O
the	O
jump	B-Protocol
flooding	I-Protocol
algorithm	I-Protocol
cannot	O
trivially	O
be	O
generalized	O
to	O
unstructured	O
graphs	O
.	O
</s>
