最小生成树算法 meaning in English
minimal spanning tree algorithm
Examples
- Minimum spanning tree algorithm based on extended double list storage structure
基于扩展双链式存储结构的最小生成树算法 - The application and analyze about the algorithm of minimum spanning tree in multi - join
最小生成树算法在多元连接中的应用及算法分析 - At the same time , a fast heuristic algorithm of mimimum cost tree with delay constraint are presented , its time complexity is ( pn2 )
同时还提出了一种满足延迟约束的多播最小生成树算法（时间复杂度为( pn2 ) ） 。 - The nmst is taken as prediction tree and is used to remove the correlation of hyperspectral image . compared with the mst algorithm , the construction speed of nmst is improved more than ten times
近最小生成树算法与最小生成树算法相比，预测树的构造速度提高一个数量级以上，而压缩比降低了不到5 。 - Firstly , the connected end sets of the relay lines are got using the breadth first search algorithm and the connected relationship of wiring terms is got in the electrical circuit diagram according to different cad block structure of different element type . secondly , the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm , and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention . finally , the optimized path algorithm which passes each vertex in the completed non - directional graph once and only once is put forward , this algorithm and the prim minimum spanning tree algrotithm can generate the inner panel wiring diagram and terminal wiring diagram automatically
首先,采用广度优先搜索算法查找电气原理图中的连通导线端点集,并根据不同类型的继电元件对应的cad图块结构的不同,得到电气原理图中元件接线端子之间的连接关系;其次,根据二分图匹配算法为电气原理图中继电元件选择合适的型号和规格,并采用人工干预和自动布置相结合的方法完成屏面布置图的自动生成;最后,提出了完全无向图中经过每个顶点一次且仅一次的优化路径算法,利用该算法和经过预处理的prim最小生成树算法自动生成屏内安装接线图和端子接线图。