|
Mathematical Education, 2020, Issue 1(93), Pages 51–53
(Mi mo695)
|
|
|
|
Students and teachers of mathematical specialties
Hierarchical algorithm for constructing a minimal spanning tree
S. V. Zakurdaev
Abstract:
Based on the concept of “mutually adjacent neighbors”, an algorithm for constructing a minimal spanning tree is developed.
Keywords:
minimal spanning tree, hierarchical algorithm, nearest neighbors.
Citation:
S. V. Zakurdaev, “Hierarchical algorithm for constructing a minimal spanning tree”, Math. Ed., 2020, no. 1(93), 51–53
Linking options:
https://www.mathnet.ru/eng/mo695 https://www.mathnet.ru/eng/mo/y2020/i1/p51
|
Statistics & downloads: |
Abstract page: | 89 | Full-text PDF : | 74 |
|