<s>
The	O
MENTOR	B-Protocol
routing	I-Protocol
algorithm	I-Protocol
is	O
an	O
algorithm	O
for	O
use	O
in	O
routing	B-Protocol
of	O
mesh	B-Architecture
networks	I-Architecture
,	O
specifically	O
pertaining	O
to	O
their	O
initial	O
topology	B-Architecture
.	O
</s>
<s>
The	O
algorithm	O
assumes	O
three	O
things	O
are	O
conducive	O
to	O
low-	O
"	O
cost	O
"	O
(	O
that	O
is	O
,	O
minimal	O
in	O
distance	O
travelled	O
and	O
time	O
between	O
destinations	O
)	O
topology	B-Architecture
:	O
that	O
paths	O
will	O
tend	O
to	O
be	O
direct	O
,	O
not	O
circuitous	O
;	O
that	O
links	O
will	O
have	O
a	O
"	O
high	O
utilization	O
"	O
—	O
that	O
is	O
,	O
they	O
will	O
be	O
used	O
to	O
nearly	O
their	O
maximum	O
operating	O
capacity	O
;	O
and	O
that	O
"	O
long	O
,	O
high-capacity	O
links	O
[	O
will	O
be	O
used ]	O
whenever	O
possible.	O
"	O
</s>
<s>
The	O
minimum	O
spanning	O
tree	O
on	O
which	O
traffic	O
flows	O
in	O
the	O
latter	O
case	O
is	O
heuristically	O
defined	O
by	O
Dijkstra	B-Algorithm
's	I-Algorithm
algorithm	I-Algorithm
and	O
Prim	B-Algorithm
's	I-Algorithm
algorithm	I-Algorithm
.	O
</s>
