spanning tree algorithm 中文意思是什麼

spanning tree algorithm 解釋
伸縮樹法
  • spanning : 分解
  • tree : n 特里〈姓氏〉。n 1 樹〈主要指喬木，也可指較大的灌木〉。 ★玫瑰可以稱為 bush 也可以稱為 tree 2 木...
  • algorithm : n. 【數學】演算法；規則系統；演段。
  1. 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最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。
  2. Most of the spanning tree algorithm ( sta ) failures occur due to the excessive loss of bpdus causing the blocked ports to transition to forwarding mode

    大多的生成樹演算法（ sta ）失敗發生由於過多的丟失bpdu導致阻塞埠轉換為轉發模式。
  3. It introduces the architecture of the switch, hol, delay control, vlan and spanning - tree algorithm, and crossbar backplane and store - and - forward technology

    介紹了線頭阻塞、時延控制、虛擬局域網和生成樹演算法等概念以及交換機的交換矩陣和共享存儲器等關鍵技術。
  4. Minimum spanning tree algorithm based on extended double list storage structure

    基於擴展雙鏈式存儲結構的最小生成樹演算法
  5. The creativity of the work in the paper can be shown as the following four aspects : ( 1 ) for single subnet, the condition of simple link judgement is added into the ptda, so the algorithm is improved well ; ( 2 ) for multiple subnets, the ptda becomes more effective, benefited from use of breadth - first - search algorithm of graph, port - deletion method etc ; ( 3 ) due to suitable adoption of the three protocols stp, snmp and arp, the ptda based on spanning tree protocol can get very effective and correct ; ( 4 ) owing to the employment of ieee802. 1 q, the ptda of vlan is all - purpose to some extent

    本文的創新之處主要體現在以下四個方面:在單子網物理拓撲發現演算法中，增加了判斷簡單連接的條件，使演算法更加完善;在多子網物理拓撲發現演算法中採用圖的廣度優先遍歷方法、埠刪除方法等，該演算法更加有效;在生成樹協議物理拓撲發現演算法中，正確使用stp 、 snmp和arp三種協議，物理拓撲發現非常準確;在vlan物理拓撲發現演算法中，正確運用了ieee802 . 1q協議，該演算法具有通用性。
  6. The application and analyze about the algorithm of minimum spanning tree in multi - join

    最小生成樹演算法在多元連接中的應用及演算法分析
  7. ( 3 ) on the basis of the dimensioning principle of correctness, integrality, clearness and rationality, utilizing the modified spanning tree algorithm in graph theory to ascertain the non - functional dimensions, accomplish the dimensioning mode analysis of the part

    （ 3 ）根據尺寸標注所要求的正確性、完整性、清晰性及合理性等原則，用改進了的圖論中的生成樹演算法，確定出零件的非功能尺寸，完成零件尺寸標注模式的分析。
  8. When a switch is turned on, the spanning - tree algorithm is used to identify the root bridge

    當一個交換器被開機時，擴充樹演演算法會先去找根橋接器。
  9. In this protocol, based on the analyses of the existing clustering algorithms, a clustering algorithm with maximal residual energy is provided. a tree structure is constructed by the proposed algorithm so that the cluster - heads are on a spanning tree rooted at the sink

    在協議中，通過分析已有的經典組簇演算法，並結合代碼分發的特點提出了一個最大剩餘能量組簇演算法，並基於簇結構提出了一個綜合建樹演算法。
  10. A protection algorithm for mesh virtual ring based on spanning tree

    一種光網路中統一網管的實現方案
  11. Algorithm of documents categorization based on bayesian - spanning tree

    基於貝葉斯擴張樹的文本分類演算法
  12. Algorithm and analysis of fuzzy minimal spanning tree in fluid pipeline networks

    流體管網中模糊最小樹的演算法與分析
  13. The algorithm used to create this loop free logical topology is the spanning - tree algorithm

    用來建立沒有?圈的邏輯拓撲之演演算法通常稱為擴充樹演演算法。
  14. A new algorithm called the rapid spanning - tree algorithm was developed to reduce the time for a network to compute a loop free logical topology

    一個新的演演算法叫做快速擴充樹演演算法，是開發用來減少網路上，計算一個沒有?圈的邏輯拓撲所需的時間。
  15. ( 2 ) this article promotes an idea that applies information compression techniques to xml data format. it puts forward structure guided compression model ( sgcm ), including algorithms such as xml structure tree spanning based on huffinan coding for element frequency, and sgcmheap generation algorithm. not only common compression techniques are used, structure based compression optimization is also rendered

    （ 2 ）本文提出將信息壓縮技術應用於xml ，提出了結構制導的xml壓縮模型sgcm ，包括相關的演算法，如基於元素出現頻度huffman編碼的xml結構樹生成演算法， sgcmheap的生成演算法? ?不僅利用了當前通用的部分壓縮技術，而且探討在xml結構的基礎上有對其進行壓縮優化的可能。
分享友人
分享到 Line

分享到臉書