k-minimum spanning tree

最小生成树（英語：Minimum spanning tree，簡稱MST）是最小權重生成樹（英語：Minimum weight spanning tree）的簡稱，是一个连通加权无向图中一棵权值最小的生成树。 在一給定的無向圖 G = ( V , E ) {\displaystyle G=(V,E)}

(1). ISSN 2045-2322. doi:10.1038/s41598-020-58568-5.  Figure 1: Minimum-Spanning-Tree of 462 hemagglutinin gene sequences of “Old-World”-orthopoxviruses

Applied Mathematics: 75, 1983, The third classical minimum spanning tree algorithm was discovered by Jarník and rediscovered by Prim and Dikstra; it is commonly