Content deleted Content added
m moved Distributed Minimim Spanning Tree to Distributed minimum spanning tree: caps, spelling incorrect |
cleanup, cat |
||
Line 1:
{{cleanup}}
Distributed minimum spanning tree problem has similar meaning as [[Minimum spanning tree]] problem, but is different in definition of inputs/outputs and is totally different in its solution approaches, although most basic paradigm resembles '''Borůvka's algorithm''' approach.
Line 15 ⟶ 16:
<references/>
[[Category:Graph theory]]
| |||