您要查找的是不是：
- minimum spanning tree problem, kruskal and prim algorithms. (譯)：最小生成樹(shù)問(wèn)題，檢驗和普里姆algorithms.
- Genetic algorithms of degree-constrained minimum spanning tree problem 遺傳算法在求解度約束最小生成樹(shù)中的應用
- multi-criteria minimum spanning tree problems 多判據最小生成樹(shù)問(wèn)題
- degree-constrained minimum spanning tree problems 度約束最小生成樹(shù)問(wèn)題
- A Heuristic Genetic Search Algorithm for Solving the Degree-Constrained Minimum Spanning Tree Problem 求解度限制最小生成樹(shù)問(wèn)題的啟發(fā)式遺傳搜索算法
- Fast approximation algorithm for the degree-constrained minimum spanning tree problem 求解度約束最小生成樹(shù)的快速近似算法
- An Adaptive Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem 求解度約束最小生成樹(shù)問(wèn)題的自適應遺傳算法
- Study on the Problem of Constrained Minimum Spanning Tree. 約束最小生成樹(shù)問(wèn)題研究。
- data structure course design package download, including two one. Josephus 2. The minimum spanning tree problem! ! ! I was handed over to the teachers, to your reference! ! 數據結構課程設計打包下載，包括兩個(gè)1.;約瑟夫環(huán)2
- By Kruskal (Kruskal) algorithm ideas, the preparation of a minimum spanning tree of a complete search procedure. (譯)：由克魯斯卡爾（秩）算法的思想，編制一個(gè)最小生成樹(shù)一個(gè)完整的搜索程序。
- Minimum spanning tree data structure source code. Hope useful for all of us. Thanks! 數據結構最小生成樹(shù)源代碼。希望對大家有用。謝謝！
- Based on separable rectilinear minimum spanning tree (SMST), optimal algorithms for rectilinear Steiner tree L_RST and optimal Z_RST are presented. 本文提出了基于可分離最小生成樹(shù)(SMST)的優(yōu)化L形直角斯坦(Steiner)樹(shù)(L_RST)和優(yōu)化Z_RST的算法。
- By representing the multi-dimensional gene expression data as nodes of a tree,MST algorithm can transform the data clustering to the partition of the minimum spanning tree. 聚類(lèi)分析已成為對基因表達數據進(jìn)行挖掘以提取生物醫學(xué)信息的主要方法。
- The Clustering takes advantage of geographic information of all nodes to adapt its cluster number, and forms the k clusters based on Minimum Spanning Tree and Kruskal Algorithm. 聚類(lèi)時(shí)充分考慮到節點(diǎn)分布的地理信息，自適應地調節聚類(lèi)的數目，再根據圖論中最小生成樹(shù)的理論，利用Kruskal算法將所有節點(diǎn)劃分為k類(lèi)。
- With the method,vertexes of graph are stored in fields and edges are expressed in records.A method to traverse graph and calculate the minimum spanning tree of graph is given. 在該方法中,圖中各頂點(diǎn)信息用字段來(lái)存放,圖中的邊用記錄來(lái)表示,給出了在該表示方法中對圖進(jìn)行遍歷和求解最小生成樹(shù)的算法。
- Design requirements: the use of Kruskal algorithm for minimum spanning tree network to the text of the various forms of output spanning tree edges and their weights. 設計要求：利用克魯斯卡爾算法求網(wǎng)的最小生成樹(shù)；以文本形式輸出生成樹(shù)中各條邊以及它們的權值。
- Design requirements: the use of algorithms for network Prims minimum spanning tree to the text of the various forms of output spanning tree edges and their weights. 設計要求：利用Prims算法求網(wǎng)的最小生成樹(shù)；以文本形式輸出生成樹(shù)中各條邊以及它們的權值。
- A new real-time reconfiguration approach for large-scale distribution system, based on the minimum spanning tree algorithm and the switch exchange method, is presented. 提出了一種利用最小樹(shù)算法和開(kāi)關(guān)交換方法進(jìn)行大規模配電網(wǎng)重構的新方法。
- With the example of using genetic algorithm to get minimum spanning tree, the author encodes a graph simulating the topology of real network, builds a corresponding model and makes analysis on it. 且結合運用遺傳算法求解圖的最小生成樹(shù)的例子，對一個(gè)模擬網(wǎng)絡(luò )拓撲結構的有權無(wú)向圖進(jìn)行了編碼，為求解過(guò)程建立了相應的模型，并對該模型進(jìn)行了分析。
- Research on the TSP problem with minimum spanning tree 用最小生成樹(shù)解決TSP問(wèn)題
